A note on Leveque and Telatar's upper bound on the capacity of wireless ad hoc networks
An alternative proof of the Leveque-Telatar (2005) upper bound on the maximum achievable information rate per communication pair in a wireless ad hoc network is presented. The argument exploits the spatial structure of the random point process representing the location of the nodes, and it is based on a simple geometric "stripping" construction that avoids complicated large deviation estimates.
capacity ad hoc networks network information theory random networks wireless networks