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

Publication Type:
Conference Proceeding
Proceedings The IEEE Conference on Local Computer Networks, 30th Anniversary, 2005, pp. 358 - 365
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009006385OK.pdf310.65 kB
Adobe PDF
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 selfselection. In self-electing 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: