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

Publication Type:: Conference Proceeding
Citation:: Proceedings - Conference on Local Computer Networks, LCN, 2005, 2005 pp. 358 - 365
Issue Date:: 2005-12-01

Closed Access

	Filename	Description	Size
	2009006385OK.pdf		310.65 kB	Adobe PDF	View/Open
	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 https://orcid.org/0000-0002-4282-6666	en_US
dc.contributor.author	Lipman, J https://orcid.org/0000-0003-2877-1168	en_US
dc.date.issued	2005-12-01	en_US
dc.identifier.citation	Proceedings - Conference on Local Computer Networks, LCN, 2005, 2005 pp. 358 - 365	en_US
dc.identifier.isbn	0769524214	en_US
dc.identifier.isbn	9780769524214	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16509
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. © 2005 IEEE.	en_US
dc.relation.ispartof	Proceedings - Conference on Local Computer Networks, LCN	en_US
dc.relation.isbasedon	10.1109/LCN.2005.60	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.citation.volume	2005	en_US
utslib.for	0906 Electrical and Electronic Engineering	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 Electrical and Data Engineering
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.publication-status	Published	en_US
pubs.volume	2005	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. © 2005 IEEE.

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

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