On outer bounds to the capacity region of wireless networks

Sahand Haji Ali Ahmad, Aleksandar Jovičić, Pramod Viswanath

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)2770-2776
Number of pages7
JournalIEEE Transactions on Information Theory
Volume52
Issue number6
DOIs
StatePublished - Jun 1 2006

Fingerprint

Scaling laws
Wireless networks
scaling
Communication
Distance education
Law
communication

Keywords

  • Ad hoc wireless networks
  • Capacity region
  • Cut-set bounds
  • Isometric embedding
  • Multihop
  • Transport capacity

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On outer bounds to the capacity region of wireless networks. / Ahmad, Sahand Haji Ali; Jovičić, Aleksandar; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 52, No. 6, 01.06.2006, p. 2770-2776.

Research output: Contribution to journalArticle

Ahmad, Sahand Haji Ali ; Jovičić, Aleksandar ; Viswanath, Pramod. / On outer bounds to the capacity region of wireless networks. In: IEEE Transactions on Information Theory. 2006 ; Vol. 52, No. 6. pp. 2770-2776.
@article{9d6ccccc9a344669a34e2fe873ab1aeb,
title = "On outer bounds to the capacity region of wireless networks",
abstract = "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.",
keywords = "Ad hoc wireless networks, Capacity region, Cut-set bounds, Isometric embedding, Multihop, Transport capacity",
author = "Ahmad, {Sahand Haji Ali} and Aleksandar Jovičić and Pramod Viswanath",
year = "2006",
month = "6",
day = "1",
doi = "10.1109/TIT.2006.874533",
language = "English (US)",
volume = "52",
pages = "2770--2776",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

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

PY - 2006/6/1

Y1 - 2006/6/1

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

VL - 52

SP - 2770

EP - 2776

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -