Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications

The significance of hop counts on the throughput and delay performance in multihop wireless networks has been well demonstrated in the literature. However, so far, there has been very little analytical work on determining the expected hop count for packet forwarding in multihop wireless networks. In this paper, we develop an analytical framework for the hop count distribution in a multihop wireless network with an arbitrary node density. We derive the average progress per hop and obtain the path connectivity probability in a network. Together with the derived per-hop progress and the path connectivity probability, we can express the probability distribution for the expected hop count in multihop wireless networks. We also demonstrate that, based on our analytical result, many network design guidelines can be provided. Specifically, the average packet delivery ratio in the network under a hop count limitation can be estimated accurately, and the tradeoff between the flooding cost and the search latency for target location discovery that is commonly used in many ad hoc routing protocols can also be evaluated.

[1]  Chunming Rong,et al.  Wireless Ad Hoc, Sensor and Mesh Networks , 2009 .

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

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

[4]  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.

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

[6]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[7]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

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

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

[10]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[11]  Radhika Nagpal,et al.  Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network , 2003, IPSN.

[12]  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).

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

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

[15]  P. Kumar,et al.  Capacity of Ad Hoc Wireless Networks , 2002 .

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