Connectivity vs capacity in dense ad hoc networks
Published 23 December 2004Open access
Olivier Dousse, Patrick Thiran
Citations190
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is found that the properties of the network strongly depend on the shape of the attenuation function, and bounds on the percolation domain for large node densities are obtained, which show that either the network becomes disconnected, or the available rate per node decreases.
Abstract
We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the available rate per node is known to decrease like 1/sqrt(n). On the contrary, if the attenuation function does not have a singularity at the origin and is uniformly bounded, we obtain bounds on the percolation domain for large node densities, which show that either the network becomes disconnected, or the available rate per node decreases like 1/n.
Keywords
Computer Science
IEEE Transactions on Information TheoryThe capacity of wireless networks
8,315 Citations2000Piyush Gupta, P. R. Kumar
IEEE/ACM Transactions on NetworkingMobility increases the capacity of ad hoc wireless networks
2,867 Citations2002Matthias Grossglauser, David Tse
Proceedings of the IEEEThe indoor radio propagation channel
1,730 Citations1993H. Hashemi
The principles of radio propagation in indoor environments are reviewed, the channel is modeled as a linear time-varying filter at each location in the three-dimensional space, and the properties of the filter's impulse response are described.
Birkhäuser Boston eBooksCritical Power for Asymptotic Connectivity in Wireless Networks
1,139 Citations1999Piyush Gupta, P.R. Kumar
It is shown that if n nodes are placed in a disc of unit area in !
Wireless NetworksThe Number of Neighbors Needed for Connectivity of Wireless Networks
832 Citations2004Feng Xue, P. R. Kumar
It is shown that in a network with n randomly placed nodes, each node should be connected to Θ(log n) nearest neighbors, and it appears that the critical constant may be close to one, but that remains an open problem.
IEEE Transactions on Information TheoryA Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
731 Citations2004L.-L. Xie, P. Rajesh Kumar
A model of wireless networks that particularly takes into account the distances between nodes, and the resulting attenuation of radio signals, is formulated, and a performance measure that weights information by the distance over which it is transported is studied.
Journal of the Society for Industrial and Applied MathematicsRandom Plane Networks
652 Citations1961E. N. Gilbert
On the capacity of hybrid wireless networks
533 Citations2003B. Liu, Zehui Liu +1 more
This work considers two different routing strategies and study the scaling behavior of the throughput capacity of a hybrid network, finding that if m grows asymptotically slower than √n, the benefit of adding base stations on capacity is insignificant, however, ifm grows faster than ∞, the throughputcapacity increases linearly with the number of base stations, providing an effective improvement over a pure ad hoc network.
Connectivity in ad-hoc and hybrid networks
525 Citations2003Olivier Dousse, Patrick Thiran +1 more
It is found that the introduction of a sparse network of base stations does significantly help in increasing the connectivity, but only when the node density is much larger in one dimension than in the other.
Unreliable sensor grids: coverage, connectivity and diameter
522 Citations2003Sanjay Shakkottai, R. Srikant +1 more
An unreliable wireless sensor grid-network with n nodes placed in a square of unit area is considered and it is shown that connectivity does not imply coverage, and a sufficient condition for connectivity of the active nodes is derived.
On the capacity of wireless networks: the relay case
476 Citations2003Michael Gastpar, Martin Vetterli
It is shown that lower and upper bounds meet asymptotically as the number of nodes in the network goes to infinity, thus proving that the capacity of the wireless network with n nodes under the relay traffic pattern behaves like log n bits per second.
IEEE Transactions on Information TheoryConnectivity properties of a packet radio network model
268 Citations1989Thomas K. Philips, Shivendra S. Panwar +1 more
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 of Physics A Mathematical and GeneralEfficient measurement of the percolation threshold for fully penetrable discs
225 Citations2000J. Quintanilla, Salvatore Torquato +1 more
Ad Hoc NetworksUnreliable sensor grids: coverage, connectivity and diameter
200 Citations2004Sanjay Shakkottai, R. Srikant +1 more
Advances in Applied ProbabilityOn a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications
138 Citations2001François Baccelli, Bartłomiej Błaszczyszyn
A random coverage process of the d-dimensional Euclidean space is defined and analysed which allows us to describe a continuous spectrum that ranges from the Boolean model to the Poisson–Voronoi tessellation to the Johnson–Mehl model.
Impact of interferences on connectivity in ad hoc networks
128 Citations2004Olivier Dousse, François Baccelli +1 more
Since small values of /spl gamma/ cannot be achieved without efficient CDMA codes, the use of a very simple TDMA scheme is investigated, where nodes can emit only every n-th time slot, and it is shown qualitatively that it even achieves a better connectivity than the previous system with a parameter /spl Gamma//n.
The Annals of Applied ProbabilityCovering algorithms, continuum percolation and the geometry of wireless networks
123 Citations2003Lorna Booth, Jehoshua Bruck +2 more
It is shown how a simple scaling operation can change the percolation properties of the model, leading to the almost sure existence of an unbounded connected component for large values of lambda, for any covering algorithm.
Advances in Applied ProbabilityOn a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications
60 Citations2001François Baccelli, Bartłomiej Błaszczyszyn
Ad hoc wireless networks with noisy links
36 Citations2003Lorna Booth, Jehoshua Bruck +2 more
This paper compares networks of geometric discs to other simple shapes, including probabilistic connections, and finds that when transmission range and node density are normalized across experiments so as to preserve the expected number of connections enjoyed by each node, the discs are the "hardest" shape to connect together.
Propagation loss at 1.8 GHz on microcellular mobile radio channels
6 Citations2002R.J.C. Bultitude, Denis Hughes
Results for base station antennas with different radiation patterns and polarisations indicate that it may be possible to vary these parameters in order to control R/sub b/,, and thus cell size, and intra-cell interference.