On the throughput scaling of wireless relay networks
Authors:
- M. FranceschettiMFM. Franceschetti
- P. ThiranPTP. Thiran
- 5 June 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (6) , 2756-2761
Abstract
The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them is the requirement that the network is fully connected: the computed rate must hold for any pair of nodes of the network. We show that this requirement can be responsible for the lack of throughput scalability. We consider a two-dimensional (2-D) network of extending area with only one active source-destination pair at any given time, and all remaining nodes acting only as possible relays. Allowing an arbitrary small fraction of the nodes to be disconnected, we show that the per-node throughput remains constant as the network size increases. As a converse bound, we show that communications occurring at a fixed nonzero rate imply a fraction of the nodes to be disconnected. Our results are of information theoretic flavor, as they hold without assumptions on the communication strategies employed by the network nodes.Keywords
This publication has 16 references indexed in Scilit:
- Impact of interferences on connectivity in ad hoc networksIEEE/ACM Transactions on Networking, 2005
- Closing the gap in the capacity of random wireless networks2004
- A Random Walk Model of Wave PropagationIEEE Transactions on Antennas and Propagation, 2004
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- On the capacity of wireless networks: the relay case2003
- Connectivity in ad-hoc and hybrid networks2003
- Elements of Information Theory2001
- The longest edge of the random minimal spanning treeThe Annals of Applied Probability, 1997
- Continuum Percolation1996
- Large deviations for discrete and continuous percolationAdvances in Applied Probability, 1996