Elements of information theory
Elements of information theory
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Foundations and Trends® in Networking
Achievable rates and scaling laws for cognitive radio channels
EURASIP Journal on Wireless Communications and Networking - Cognitive Radio and Dynamic Spectrum Sharing Systems
Capacity and delay of hybrid wireless broadband access networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Scalability of node degrees in random wireless network topologies
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Throughput, delay, and mobility in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
The capacity of heterogeneous wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity of hybrid wireless networks with directional antenna and delay constraint
IEEE Transactions on Communications
On the broadcast capacity of wireless networks with cooperative relays
IEEE Transactions on Information Theory
Hi-index | 0.06 |
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 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.