Elements of information theory
Elements of information theory
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On outer bounds to the capacity region of wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
On capacity scaling in arbitrary wireless networks
IEEE Transactions on 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
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
Wireless multicast: theory and approaches
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
Product Multicommodity Flow in Wireless Networks
IEEE Transactions on Information Theory
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Continuous data aggregation and capacity in probabilistic wireless sensor networks
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.84 |
We consider the question of determining the scaling of the n2-dimensional balanced unicast and the n2n-dimensional balanced multicast capacity regions of a wireless network with n nodes placed uniformly at random in a square region of area n and communicating over Gaussian fading channels. We identify this scaling of both the balanced unicast and multicast capacity regions in terms of Θ(n), out of 2n total possible, cuts. These cuts only depend on the geometry of the locations of the source nodes and their destination nodes and the traffic demands between them, and thus can be readily evaluated. Our results are constructive and provide optimal (in the scaling sense) communication schemes.