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

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 selfselection. 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. Disciplines Physical Sciences and Mathematics Publication DetailsThis article was originally published as: Abolhasan, M and Lipman, J, Efficient and highly scalable route discovey for on-demand routing protocols in ad hoc networks, The IEEE 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 selfselection. 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.

MOADRP: Mobile Ad-hoc Network Routing Protocol

“…At first we have studied SDSS. SDSS [3] is a self-selecting route discovery strategy proposed by Mehran Abolhasan and Justin Lipman. The basic idea is to reduce the re-broadcasting of RREQ packets, by maintaining some criterion.…”

“…The basic idea is to reduce the re-broadcasting of RREQ packets, by maintaining some criterion. In SDSS [3] the source node specified a utility metric in each RREQ. In SDSS-M (SDSS based on Mobility) [3], mobility is set as a criterion for selecting the nodes which are able to rebroadcast.…”

A Hop-Based Routing Scheme for MANETs

“…Let us survey the second approach [1,9,10]. These works reduce discovery overhead and mitigate interference among routing regions, indirectly improving route discovery latency.…”

“…Then, a node in the region which has better distance information to the destination forms its new region of µ-hop radius. In [1], the proposal of Abolhasan and Lipman limits the number of control packets in the route discovery phase by assigning more authority to intermediate nodes. Only nodes which satisfy given criteria re-broadcast RREQ packets; thus, network load and channel contention are reduced.…”

“…The first one [3 -5] deals with waiting time for the optimal routes at sources or destinations. The second one [1,9,10] divides the network into multiple sub-regions and each of these regions is controlled by a core node or a cluster head.…”