The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

DOI10.1109/TIT.2010.2043979MaRDI QIDQ5281493zbMATH OpenOpenAlexFDO

Authors Urs Niesen, Piyush Gupta, Devavrat Shah

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.1344

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Abstract: We consider the question of determining the scaling of the $n^2$-dimensional balanced unicast and the $n{2}^n$-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 $Theta(n)$, out of $2^n$ 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.

Cited in

(2)

• Continuous data aggregation and capacity in probabilistic wireless sensor networks
• Bridging the gap between information theory and wireless networking

This page was built for publication: The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281493)