Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks

Abolhasan, M; Lipman, J

Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks

Abolhasan, M Lipman, J

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks, 2005, pp. 358 - 366
Issue Date:: 2005-01

Closed Access

	Filename	Description	Size
	2012005214OK.pdf		279.75 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Abolhasan, M	en_US
dc.contributor.author	Lipman, J	en_US
dc.contributor.editor	Abolhasan, M	en_US
dc.contributor.editor	Lipman, J	en_US
dc.date	2005-11-15	en_US
dc.date.issued	2005-01	en_US
dc.identifier.citation	Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks, 2005, pp. 358 - 366	en_US
dc.identifier.isbn	0-7695-2421-4	en_US
dc.identifier.uri	http://hdl.handle.net/10453/23645
dc.description.abstract	This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of self-selection. In self-selecting route discovery each node independently makes route request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased	en_US
dc.publisher	IEEE	en_US
dc.relation.ispartof	Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks	en_US
dc.relation.ispartof	Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on	en_US
dc.relation.isbasedon	10.1109/LCN.2005.60	en_US
dc.relation.isreplacedby	10453/16509
dc.relation.isreplacedby	http://hdl.handle.net/10453/16509
dc.rights	© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.title	Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks	en_US
dc.type	Conference Proceeding
utslib.location	NA	en_US
utslib.location.activity	Sydney, Australia	en_US
utslib.for	100503 Computer Communications Networks	en_US
dc.location.activity	Sydney, Australia	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computing and Communications
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.declined	1970-01-01T00:00:00.0+1000
pubs.consider-herdc	false	en_US
pubs.merge-to	10453/16509
pubs.merge-to	http://hdl.handle.net/10453/16509
pubs.deleted	1970-01-01T00:00:00.0+1000
pubs.place-of-publication	NA	en_US
pubs.start-date	2005-11-15	en_US

Abstract:

This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of self-selection. In self-selecting route discovery each node independently makes route request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/23645