A beaconless node velocity-based stable path routing protocol for mobile ad hoc networks

All the stable path routing protocols proposed in the literature for mobile ad hoc networks (MANETs) require beacon exchange among the neighbor nodes in order to choose stable links and paths. We propose a beaconless node velocity-based stable path (NVSP) routing protocol for MANETs. NVSP is an on-demand routing protocol that uses the broadcast Route-Request query cycle to discover routes when required. During the propagation of the Route-Request (RREQ) messages, every forwarding node includes its current node velocity information in the RREQs. The bottleneck velocity of a path is the maximum of the velocity of an intermediate node on the path. The destination chooses the path with the smallest bottleneck velocity and sends a Route-Reply (RREP) packet on the chosen path. The lifetime of NVSP routes is 25–35% and 55–75% more than that of the routes chosen by the minimum-hop based Dynamic Source Routing (DSR) protocol in networks of low and high density respectively. The lifetime of routes chosen by NVSP is 60–70% of the route lifetime incurred by the Flow-Oriented Routing Protocol (FORP), the routing protocol observed to determine the sequence of most stable routes in MANETs. On the other hand, the end-to-end delay per data packet and the energy consumed per packet incurred by NVSP are significantly lower than that of FORP and are lower or equal to that incurred for DSR.

[1]  Hannes Hartenstein,et al.  Stochastic Properties of the Random Waypoint Mobility Model , 2004, Wirel. Networks.

[2]  Natarajan Meghanathan,et al.  Exploring the Stability-Energy Consumption-Delay-Network Lifetime Tradeoff of Mobile Ad Hoc Network Routing Protocols , 2008, J. Networks.

[3]  Laura Marie Feeney,et al.  An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[4]  N. Meghanathan,et al.  Stability-Energy Consumption Tradeoff among Mobile Ad Hoc Network Routing Protocols , 2007, 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07).

[5]  Natarajan Meghanathan,et al.  Survey and Taxonomy of Unicast Routing Protocols for Mobile Ad Hoc Networks , 2009 .

[6]  Bernhard Hofmann-Wellenhof,et al.  Global Positioning System , 1992 .

[7]  Juan-Carlos Cano,et al.  Routing Mechanisms for Mobile Ad Hoc Networks Based on the Energy Drain Rate , 2003, IEEE Trans. Mob. Comput..

[8]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[9]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[10]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[11]  Mario Gerla,et al.  IPv6 flow handoff in ad hoc wireless networks using mobility prediction , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[12]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[13]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.