Abstrad-We study the connectivity and capacity of tinite ares ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network stmngly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the availahle rate per node is known to decrease like I/,,%. On the contrary, if the attenuation function does not have a singularity at the origin and is nnifiwrnly hounded. we irhtain hounds on the percolation domain for large node densities, which show that either the network heconies dkonnected, or the available rate per node decreases like l / n .
In REF , trade-off between connectivity and capacity of dense networks is studied.
Connectivity vs capacity in dense ad hoc networks
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Mathematics Computer Science