Journal ArticleDOI
On the connectivity of radio networks
TLDR
It is conjectured that the critical ranges of the two-dimensional problems are also different, and the author presents results to substantiate this conjecture.Abstract:
The connectivity of a two-dimensional radio network as a function of the range of the transmitters is still an open problem. It has bee conjectured that the critical range of this problem is the same as the one for the covering problem. The analysis of the one-dimensional problem makes it clear that situations can exist where these two ranges are different. It is conjectured that the critical ranges of the two-dimensional problems are also different. The author presents results to substantiate this conjecture. >read more
Citations
More filters
Book
Topology Control in Wireless Ad Hoc and Sensor Networks
TL;DR: In this article, the authors state several problems related to topology control in wireless ad hoc and sensor networks, and survey state-of-the-art solutions which have been proposed to tackle them.
Proceedings ArticleDOI
On the minimum node degree and connectivity of a wireless multihop network
TL;DR: This paper derives an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network and investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity.
Journal ArticleDOI
The critical transmitting range for connectivity in sparse wireless ad hoc networks
Paolo Santi,Douglas M. Blough +1 more
TL;DR: The critical transmitting range for connectivity in wireless ad hoc networks is analyzed and insight into how mobility affects connectivity is yielded and useful trade offs between communication capability and energy consumption are revealed.
Journal ArticleDOI
Connectivity of wireless multihop networks in a shadow fading environment
TL;DR: A tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size is given.
Journal ArticleDOI
On the Connectivity of Ad Hoc Networks
TL;DR: This paper presents a framework for the calculation of stochastic connectivity properties of wireless multihop networks, and compute a tight approximation for the critical (r0 ,n )pairs that are required to keep the network connected with a probability close to one.
References
More filters
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
Connectivity properties of a packet radio network model
TL;DR: A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined and it is shown that pi R/sup 2/D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network.
Journal ArticleDOI
Critical connectivity phenomena in multihop radio models
Y.-C. Cheng,Thomas G. Robertazzi +1 more
TL;DR: The results suggest that in optimizing transmission radius as a function of communication performance measures, the choice of radius may be bounded from below by the need to maintain a desired network connectivity.
Proceedings ArticleDOI
Connectivity properties of a mobile packet radio network model
TL;DR: The authors show that no magic number can exist, but the notion of a magic number is shown to be useful, and an explanation is provided for why computations based on magic numbers give answers that are good in practice.