TY - JOUR
T1 - On outer bounds to the capacity region of wireless networks
AU - Ahmad, Sahand Haji Ali
AU - Jovičić, Aleksandar
AU - Viswanath, Pramod
N1 - Funding Information:
Manuscript received February 12, 2005; revised April 25, 2005. This work was supported in part by the National Science Foundation by Grant CCR-0312413 and by a Grant from Motorola, Inc., as part of the Motorola Center for Communication. The authors are with the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801 USA (e-mail: [email protected]; jovicicuiuc.edu; [email protected]). Communicated by R. W. Yeung, Guest Editor. Digital Object Identifier 10.1109/TIT.2006.874533
PY - 2006/6
Y1 - 2006/6
N2 - 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.
AB - 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.
KW - Ad hoc wireless networks
KW - Capacity region
KW - Cut-set bounds
KW - Isometric embedding
KW - Multihop
KW - Transport capacity
UR - http://www.scopus.com/inward/record.url?scp=33745119788&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745119788&partnerID=8YFLogxK
U2 - 10.1109/TIT.2006.874533
DO - 10.1109/TIT.2006.874533
M3 - Article
AN - SCOPUS:33745119788
SN - 0018-9448
VL - 52
SP - 2770
EP - 2776
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
ER -