Analytical Study of the Expected Number of Hops in Wireless Ad Hoc Network

Due to the randomness and mobility of ad hoc networks, estimating the average number of hops becomes very essential in multi-hop ad hoc networks, which is used as a key metric for performance comparison between multi-hop routing protocols; however, most current research derives the average number of hops based on simulations and empirical results, lacking the theoretical analysis of this essential metric. This paper presents a theoretical study of the expected number of hops between any two random nodes using typical modeling assumptions -an N-node randomly Poisson distributed connected network (i.e. for any two random nodes, they are connected by at least one path). The proposed theoretical analysis studies the relationship between the average number of hop counts and other critical ad hoc network parameters such as transmission range (r 0 ), node density (ρ), and area (A). At last, simulation results will be given to verify the theoretical analysis.

[1]  Jangeun Jun,et al.  The nominal capacity of wireless mesh networks , 2003, IEEE Wirel. Commun..

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

[3]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[4]  Hui Li,et al.  A statistical study of neighbor node properties in ad hoc network , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[7]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  Leonard E. Miller,et al.  Distribution of Link Distances in a Wireless Network , 2001, Journal of research of the National Institute of Standards and Technology.

[10]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[11]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

[12]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

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

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

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

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

[18]  Marco Conti,et al.  Mesh networks: commodity multihop ad hoc networks , 2005, IEEE Communications Magazine.

[19]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[21]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.