A Note on LÉvÊque and Telatar's Upper Bound on the Capacity of Wireless Ad Hoc Networks

Authors:
M. Franceschetti
Affiliations:
California Univ., La Jolla
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 2

Stochastic geometry and random graphs for the analysis and design of wireless networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The capacity of wireless networks: information-theoretic and physical limits

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

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.