Abstract
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 ldquostrippingrdquo construction that avoids complicated large deviation estimates.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
