Throughput scaling of wireless networks with random connections

Shengshan Cui; Alexander M. Haimovich; Oren Somekh; H. Vincent Poor; Shlomo Shamai

doi:10.1109/TIT.2010.2051470

Throughput scaling of wireless networks with random connections

Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor, Shlomo Shamai

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an onoff strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n^1/3) for single-hop schemes, and O(n^1/2) for two-hop (and multihop) schemes; the Θ(n^1/2) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ(n) is achievable with Pareto-type fading models.

Original language	English (US)
Article number	5508608
Pages (from-to)	3793-3806
Number of pages	14
Journal	IEEE Transactions on Information Theory
Volume	56
Issue number	8
DOIs	https://doi.org/10.1109/TIT.2010.2051470
State	Published - Aug 2010

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

Ad hoc networks
channel state information (CSI)
multiuser diversity
opportunistic communication
random connections
scaling law
throughput

Access to Document

10.1109/TIT.2010.2051470

Cite this

@article{714c9e59f56c4c4bb7cd5bb08c8457b5,

title = "Throughput scaling of wireless networks with random connections",

abstract = "This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an onoff strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n1/3) for single-hop schemes, and O(n1/2) for two-hop (and multihop) schemes; the Θ(n1/2) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ(n) is achievable with Pareto-type fading models.",

keywords = "Ad hoc networks, channel state information (CSI), multiuser diversity, opportunistic communication, random connections, scaling law, throughput",

author = "Shengshan Cui and Haimovich, {Alexander M.} and Oren Somekh and Poor, {H. Vincent} and Shlomo Shamai",

note = "Funding Information: Manuscript received September 23, 2008; revised October 24, 2009; accepted October 25, 2009. Date of current version July 14, 2010. The work of S. Cui and A. M. Haimovich was supported in part by the National Science Foundation under Grant CNS-0626611. The work of O. Somekh was supported in part by a Marie Curie Outgoing International Fellowship within the 7th European Commission Framework Programme. The work of H. V. Poor was supported in part by the National Science Foundation under Grant CNS-09-05086 and in part by the Air Force Office of Scientific Research under Grant FA9550-08-1-0480. The work of S. Shamai (Shitz) was supported by the European Commission in the framework of the FP7 Network of Excellence in Wireless COMmunications NEWCOM++. The material in this paper was presented in part at the IEEE International Conference on Communications, Dresden, Germany, June 2009.",

year = "2010",

month = aug,

doi = "10.1109/TIT.2010.2051470",

language = "English (US)",

volume = "56",

pages = "3793--3806",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Throughput scaling of wireless networks with random connections

AU - Cui, Shengshan

AU - Haimovich, Alexander M.

AU - Somekh, Oren

AU - Poor, H. Vincent

AU - Shamai, Shlomo

N1 - Funding Information: Manuscript received September 23, 2008; revised October 24, 2009; accepted October 25, 2009. Date of current version July 14, 2010. The work of S. Cui and A. M. Haimovich was supported in part by the National Science Foundation under Grant CNS-0626611. The work of O. Somekh was supported in part by a Marie Curie Outgoing International Fellowship within the 7th European Commission Framework Programme. The work of H. V. Poor was supported in part by the National Science Foundation under Grant CNS-09-05086 and in part by the Air Force Office of Scientific Research under Grant FA9550-08-1-0480. The work of S. Shamai (Shitz) was supported by the European Commission in the framework of the FP7 Network of Excellence in Wireless COMmunications NEWCOM++. The material in this paper was presented in part at the IEEE International Conference on Communications, Dresden, Germany, June 2009.

PY - 2010/8

Y1 - 2010/8

N2 - This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an onoff strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n1/3) for single-hop schemes, and O(n1/2) for two-hop (and multihop) schemes; the Θ(n1/2) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ(n) is achievable with Pareto-type fading models.

AB - This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an onoff strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n1/3) for single-hop schemes, and O(n1/2) for two-hop (and multihop) schemes; the Θ(n1/2) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ(n) is achievable with Pareto-type fading models.

KW - Ad hoc networks

KW - channel state information (CSI)

KW - multiuser diversity

KW - opportunistic communication

KW - random connections

KW - scaling law

KW - throughput

UR - http://www.scopus.com/inward/record.url?scp=77954605356&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954605356&partnerID=8YFLogxK

U2 - 10.1109/TIT.2010.2051470

DO - 10.1109/TIT.2010.2051470

M3 - Article

AN - SCOPUS:77954605356

SN - 0018-9448

VL - 56

SP - 3793

EP - 3806

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

M1 - 5508608

ER -

Throughput scaling of wireless networks with random connections

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this