Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks

We derive an information-theoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number of users gets...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2005-03, Vol.51 (3), p.858-865
Hauptverfasser:	Leveque, O., Telatar, I.E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Ad hoc networks Applied sciences Attenuation Capacity Communication channels Communication systems cut-set bound Density eigenvalues Eigenvalues and eigenfunctions Exact sciences and technology Information theory Information, signal and communications theory Interference Networks random matrices Relays Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Transmission line matrix methods Upper bound Upper bounds Wireless communication Wireless networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We derive an information-theoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number of users gets large.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2004.842576