The critical transmitting range for connectivity in sparse wireless ad hoc networks
Top Cited Papers
- 22 April 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 2 (1) , 25-39
- https://doi.org/10.1109/tmc.2003.1195149
Abstract
We analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: assume n nodes, each capable of communicating with nodes within a radius of r, are randomly and uniformly distributed in a d-dimensional region with a side of length l; how large must the transmitting range r be to ensure that the resulting network is connected with high probability? First, we consider this problem for stationary networks, and we provide tight upper and lower bounds on the critical transmitting range for one-dimensional networks and nontight bounds for two and three-dimensional networks. Due to the presence of the geometric parameter l in the model, our results can be applied to dense as well as sparse ad hoc networks, contrary to existing theoretical results that apply only to dense networks. We also investigate several related questions through extensive simulations. First, we evaluate the relationship between the critical transmitting range and the minimum transmitting range that ensures formation of a connected component containing a large fraction (e.g., 90 percent) of the nodes. Then, we consider the mobile version of the problem, in which nodes are allowed to move during a time interval and the value of r ensuring connectedness for a given fraction of the interval must be determined. These results yield insight into how mobility affects connectivity and they also reveal useful trade offs between communication capability and energy consumption.Keywords
This publication has 26 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless NetworksPublished by Springer Nature ,2007
- An evaluation of connectivity in mobile wireless ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A new model for scheduling packet radio networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Smart kindergartenPublished by Association for Computing Machinery (ACM) ,2001
- Research challenges in wireless networks of biomedical sensorsPublished by Association for Computing Machinery (ACM) ,2001
- A probabilistic analysis for the range assignment problem in ad hoc networksPublished by Association for Computing Machinery (ACM) ,2001
- Power consumption in packet radio networksTheoretical Computer Science, 2000
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Next century challengesPublished by Association for Computing Machinery (ACM) ,1999
- Continuum PercolationPublished by Cambridge University Press (CUP) ,1996