Elements of information theory
Elements of information theory
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
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
Intrinsic Limits of Dimensionality and Richness in Random Multipath Fields
IEEE Transactions on Signal Processing
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity scaling and spectral efficiency in wide-band correlated MIMO channels
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
Degrees of freedom in multiple-antenna channels: a signal space approach
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
Communication over a wireless network with random connections
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
A Note on LÉvÊque and Telatar's Upper Bound on the Capacity of Wireless Ad Hoc Networks
IEEE Transactions on Information Theory
Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
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
A simple upper bound on random access transport capacity
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
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
An overview of the transmission capacity of wireless networks
IEEE Transactions on Communications
Capacity of large-scale CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Wireless Personal Communications: An International Journal
A Constructive Capacity Lower Bound of the Inhomogeneous Wireless Networks
Wireless Personal Communications: An International Journal
Hi-index | 754.90 |
It is shown that the capacity scaling of wireless networks is subject to a fundamental limitation which is independent of power attenuation and fading models. It is a degrees of freedom limitation which is due to the laws of physics. By distributing uniformly an order of n users wishing to establish pairwise independent communications at fixed wavelength inside a two-dimensional domain of size of the order of n, there are an order of n communication requests originating from the central half of the domain to its outer half. Physics dictates that the number of independent information channels across these two regions is only of the order of √n, so the per-user information capacity must follow an inverse square-root of n law. This result shows that information-theoretic limits of wireless communication problems can be rigorously obtained without relying on stochastic fading channel models, but studying their physical geometric structure.