Connectivity vs capacity in dense ad hoc networks
Authors:
- 23 December 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (0743166X) , 476-486
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//spl radic/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
This publication has 18 references indexed in Scilit:
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- Impact of interferences on connectivity in ad hoc networks2004
- The Number of Neighbors Needed for Connectivity of Wireless NetworksWireless Networks, 2004
- On the capacity of wireless networks: the relay case2003
- Connectivity in ad-hoc and hybrid networks2003
- On the capacity of hybrid wireless networks2003
- Ad hoc wireless networks with noisy links2003
- Mobility increases the capacity of ad-hoc wireless networks2002
- On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications2001
- Percolation1999