Elements of information theory
Elements of information theory
Cuts, Trees and ℓ1-Embeddings of Graphs*
Combinatorica
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
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 Overview of Scaling Laws in Ad Hoc and Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Achievable rates and scaling laws for cognitive radio channels
EURASIP Journal on Wireless Communications and Networking - Cognitive Radio and Dynamic Spectrum Sharing Systems
Modeling and optimization of transmission schemes in energy-constrained wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Scaling laws of single-hop cognitive networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
Hierarchical cooperation in ad hoc networks: optimal clustering and achievable throughput
IEEE Transactions on Information Theory
Information-theoretic operating regimes of large wireless networks
IEEE Transactions on Information Theory
The balanced unicast and multicast capacity regions of large wireless networks
IEEE Transactions on Information Theory
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
Throughput and energy-aware routing for 802.11 based mesh networks
Computer Communications
| Hi-index | 0.24 |
In this correspondence, we study the capacity region of a general wireless network by deriving fundamental upper bounds on a class of linear functionals of the rate tuples at which joint reliable communication can take place. The widely studied transport capacity is a specific linear functional: the coefficient of the rate between a pair of nodes is equal to the Euclidean distance between them. The upper bound on the linear functionals of the capacity region is used to derive upper bounds to scaling laws for generalized transport capacity: the coefficient of the rate between a pair of nodes is equal to some arbitrary function of the Euclidean distance between them, for a class of minimum distance networks. This upper bound to the scaling law meets that achievable by multihop communication over these networks for a wide class of channel conditions; this shows the optimality, in the scaling-law sense, of multihop communication when studying generalized transport capacity of wireless networks.