Regularity, Interference, and Capacity of Large Ad Hoc Networks
Radha Krishna Ganti, Martin Haenggi · 2006
In the analysis of large random ad hoc networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. Using tools from stochastic geometry, we make an effort to derive interference and capacity results for clustered processes. We also reveal connections between the regularity of a point process and these metrics.