On the Throughput Capacity of Random Wireless Networks
Source: University of California
The authors consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users n grows. Their results rely on percolation theory arguments. When the node density is too high the network is fully connected but generates excessive interference. In the low density regime the network looses connectivity. Percolation theory ensures that a connected backbone forms in the transition region between these two extreme scenarios. This backbone does not include all the nodes, nevertheless it is sufficiently rich in crossing paths so that it can transport the total amount of traffic.