Information Theoretic Cut-Set Bounds on the Capacity of Poisson Wireless Networks
The authors present a stochastic geometry based model, in which they investigate the fundamental limitations of wireless networks. They derive cut-set bounds on the information theoretic capacity of networks of arbitrary Poisson node density, size, power, bandwidth, and fading characteristics. In other words, they upper-bound the optimal performance in terms of capacity, under any communication scheme, that can be achieved between a subset of network nodes (contained in the cut) with all the remaining nodes. Additionally, they identify four different operating regimes, thus confirming previously known scaling laws (e.g., in bandwidth and/or power limited wireless networks), and extending them with specific bounds. Finally, they use their results to provide specific numerical examples.