By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Franceschetti, M. ; California Univ., La Jolla

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 9 )