The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

By Paolo Santi, Douglas M. Blough. IEEE Transactions on Mobile Computing, 2003

456 citations recorded by the source corpus.

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.

Subfields: Aerospace Engineering, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/cb3800f1d79b4b5aa4f2c69da7bfe69060876ade

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

In Computer Networks and Communications

Citations in the corpus

On the Connectivity of Ad Hoc Networks (2004, methodology): “During the writing of this article, an alternative solution method for uniform nodes on square areas was presented in [37].”
ATPC: adaptive transmission power control for wireless sensor networks (2006, unknown): “We refer to this group as network-level solutions, and typical examples in this group are [27] [25] [2] [18] [31].”
Analytical Model for Connectivity in Vehicular Ad Hoc Networks (2008, background): “V EHICULAR ad hoc networks (VANETs) are special types of mobile ad hoc networks (MANETs), where wireless-equipped vehicles spontaneously form a network while traveling along the road.”
Connectivity of Wireless Multihop Networks in a Shadow Fading Environment (2003, methodology): “Further analytical investigations of the connectivity in bounded areas were made by Santi and Blough [ 26 ,27], Bettstetter [2,3], and Desai [9].”
A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, background): “Santi and Blough [73] investigate the tradeoff between the transmission range and the size of the largest connected component in the communication graph.”
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks (2003, background): “For example, theoretical results with respect to routing ([1], [24]), capacity ([14], [17]), connectivity ([3], [16], [30]), and minimum power issues cannot be applied directly in a mobile scenario that employs the RWP model.”
Coverage and connectivity issues in wireless sensor networks: A survey (2008, background): “One of the important criteria for being able to deploy an efficient sensor network is to find optimal node deployment strategies and efficient topology control techniques [55,54].”