A Note on LÉvÊque 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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2007-09, Vol.53 (9), p.3207-3211
Main Author: Franceschetti, M.
Format: Article
Language:English
Subjects:
Ad hoc networks
Applied sciences
Attenuation
capacity
Construction
Decoding
Deviation
Electrical engineering
Electronics
Estimates
Exact sciences and technology
H infinity control
Information rates
Information systems
Information theory
Information, signal and communications theory
Mobile ad hoc networks
network information theory
Networks
Position (location)
random networks
Random variables
Spread spectrum communication
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Upper bound
Upper bounds
Wireless communication
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2007.903135