IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of wireless networks
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
The balanced unicast and multicast capacity regions of large wireless networks
IEEE Transactions on Information Theory
Random access transport capacity
IEEE Transactions on Wireless Communications
On the impact of mobility on multicast capacity of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A general algorithm for interference alignment and cancellation in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multicast scaling laws with hierarchical cooperation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
Multicast performance with hierarchical cooperation
IEEE/ACM Transactions on Networking (TON)
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Wireless Personal Communications: An International Journal
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.90 |
In recent work, Özgür, Lévêque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., n nodes are placed uniformly at random in a square region of area n). They showed that for small path-loss exponents α ∈ (2, 3), cooperative communication is order optimal, and for large path-loss exponents α 3, multihop communication is order optimal. However, their results (both the communication scheme and the proof technique) are strongly dependent on the regularity induced with high probability by the random node placement. In this paper, we consider the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement. As a main result, we propose a more general novel cooperative communication scheme that works for arbitrarily placed nodes. For small path-loss exponents α ∈ (2, 3), we show that our scheme is order optimal for all node placements, and achieves exactly the same throughput scaling as in Özgür et al, This shows that the regularity of the node placement does not affect the scaling of the achievable rates for α ∈ (2, 3). The situation is, however, markedly different for large path-loss exponents α 3. We show that in this regime the scaling of the achievable per-node rates depends crucially on the regularity of the node placement. We then present a family of schemes that smoothly "interpolate" between multihop and cooperative communication, depending upon the level of regularity in the node placement. We establish order optimality of these schemes under adversarial node placement for α 3.