abstract: We review scaling results for the per-node throughput capacity of wireless networks under the following model: nodes are distributed in a square of area n according to a Poisson point process of unit density, source-destination pairs are selected uniformly at random and need to communicate information at rate R(n), each node radiates a signal x(t) subject to power constraint x2(t)
The gap between upper and lower bounds under different propagation models is discussed, as long as extensions of the model to fading, and issues in decentralized MAC and routing protocols design.