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

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Abolhasan, Mehran en_US
dc.contributor.author Lipman, Justin en_US
dc.contributor.editor M. Abolhasan and J. Lipman: en_US
dc.date.accessioned 2013-09-22T18:09:42Z
dc.date.available 2013-09-22T18:09:42Z
dc.date.issued 2005 en_US
dc.identifier 2012005214 en_US
dc.identifier.citation Lipman, Justin and Abolhasan, Mehran 2005, 'Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks', IEEE, NA, pp. 358-366. en_US
dc.identifier.issn 0-7695-2421-4 en_US
dc.identifier.other E1UNSUBMIT 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.language en_US
dc.publisher IEEE en_US
dc.relation.isbasedon http://dx.doi.org/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.parent Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks en_US
dc.journal.volume en_US
dc.journal.number en_US
dc.publocation NA en_US
dc.identifier.startpage 358 en_US
dc.identifier.endpage 366 en_US
dc.cauo.name CRIN Research Strength Core en_US
dc.conference OK Accepted HERDC pubs preUTS or unreported en_US
dc.for 100503 en_US
dc.personcode 108935 en_US
dc.personcode 0000087011 en_US
dc.percentage 100 en_US
dc.classification.name Computer Communications Networks en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on en_US
dc.date.activity 20051115 en_US
dc.location.activity Sydney, Australia en_US
dc.description.keywords en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record