On the Hop Count Statistics in Wireless Multihop Networks Subject to Fading
Authors:
- 22 November 2011
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 23 (7) , 1275-1287
Abstract
Consider a wireless multihop network where nodes are randomly distributed in a given area following a homogeneous Poisson process. The hop count statistics, viz. the probabilities related to the number of hops between two nodes, are important for performance analysis of the multihop networks. In this paper, we provide analytical results on the probability that two nodes separated by a known euclidean distance are k hops apart in networks subject to both shadowing and small-scale fading. Some interesting results are derived which have generic significance. For example, it is shown that the locations of nodes three or more hops away provide little information in determining the relationship of a node with other nodes in the network. This observation is useful for the design of distributed routing, localization, and network security algorithms. As an illustration of the application of our results, we derive the effective energy consumption per successfully transmitted packet in end-to-end packet transmissions. We show that there exists an optimum transmission range which minimizes the effective energy consumption. The results provide useful guidelines on the design of a randomly deployed network in a more realistic radio environment.Keywords
This publication has 37 references indexed in Scilit:
- Connectivity and Transmit-Energy Considerations Between Any Pair of Nodes in a Wireless Ad Hoc Network Subject to FadingIEEE Transactions on Vehicular Technology, 2008
- Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio ModelMobile Networks and Applications, 2006
- On the hop count statistics for randomly deployed wireless sensor networksInternational Journal of Sensor Networks, 2006
- Bounds on hop distance in greedy routing approach in wireless ad hoc networksInternational Journal of Wireless and Mobile Computing, 2006
- Connectivity of Wireless Multihop Networks in a Shadow Fading EnvironmentWireless Networks, 2005
- The Number of Neighbors Needed for Connectivity of Wireless NetworksWireless Networks, 2004
- Efficient authentication and key distribution in wireless IP networksIEEE Wireless Communications, 2003
- Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performanceIEEE Transactions on Mobile Computing, 2003
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Calculation of number of relay hops required in randomly located radio networkElectronics Letters, 1989