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

We derive an information theoretic upper bound on the maximum achievable rate per communication pair in a large extended ad-hoc wireless network. We show that under a reasonably weak assumption on the attenuation due to environment, this rate tends to zero as the number of users gets large.


Published in:
Proceedings of the 2004 IEEE International Symposium on Information Theory
Presented at:
IEEE International Symposium on Information Theory, Chicago, USA, 27 June - 2 July 2004
Year:
2004
Keywords:
Laboratories:




 Record created 2006-12-15, last modified 2018-11-14

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)