Critical node lifetimes in random networks via the Chen-Stein method
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Bounds on the throughput gain of network coding in unicast and multicast wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Achievable throughput in two-scale wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Network topology models for multihop wireless networks
ISRN Communications and Networking
Results on finite wireless sensor networks: Connectivity and coverage
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 754.84 |
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.