Analysis of the Expected Number of Hops in Mobile Ad Hoc Networks with Random Waypoint Mobility

The number of hops between the source and destination nodes is a key parameter in studying multi-hop ad hoc networks analytically. To the best of our known, there is no analytical work that considers the hop count of paths in MANETs in a random mobility environment. This paper presents a theoretical study for the expected number of hops between any random source-destination pair in multi-hop ad hoc networks where nodes move according to the random waypoint mobility model. The effects of network parameters such as node density, size of the network area, and node transmission range are studied. Simulation experiments for different network parameters have been conducted to validate the proposed analytical approach.

[1]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[2]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[3]  Subir Kumar Sarkar,et al.  Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications , 2007 .

[4]  Mingyan Liu,et al.  Revisiting the TTL-based controlled flooding search: optimality and randomization , 2004, MobiCom '04.

[5]  Jotun Hein,et al.  Statistical Methods in Bioinformatics: An Introduction , 2002 .

[6]  Wanjiun Liao,et al.  Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications , 2007, IEEE Transactions on Vehicular Technology.

[7]  Paul Schliekelman,et al.  Statistical Methods in Bioinformatics: An Introduction , 2001 .

[8]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[9]  Swades De,et al.  On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks , 2005, IEEE Communications Letters.

[10]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[11]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[12]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[13]  Hamid R. Rabiee,et al.  MobiSim: A Framework for Simulation of Mobility Models in Mobile Ad-Hoc Networks , 2007, Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007).

[14]  Christian Wagner,et al.  The Spatial Node Distribution of the Random Waypoint Mobility Model , 2002, WMAN.

[15]  Wendi B. Heinzelman,et al.  Flooding Strategy for Target Discovery in Wireless Networks , 2003, MSWIM '03.

[16]  Giorgio Ventre,et al.  Network Simulator NS2 , 2008 .

[17]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[18]  Weifa Liang,et al.  Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications , 2013, Wireless Algorithms, Systems, and Applications.

[19]  Wendi B. Heinzelman,et al.  Flooding Strategy for Target Discovery in Wireless Networks , 2005 .

[20]  Christian Bettstetter,et al.  On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[21]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[22]  Wanjiun Liao,et al.  Modeling the behavior of flooding on target location discovery in mobile ad hoc networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[23]  Warren J. Ewens,et al.  Statistical for Biology and Health: Statistical Methods in Bioinformatics , 2001 .

[24]  Janise McNair,et al.  Analytical Study of the Expected Number of Hops in Wireless Ad Hoc Network , 2008, WASA.