Improved capacity scaling in wireless networks with infrastructure

Won Yong Shin, Sang Woon Jeon, Natasha Devroye, Mai H. Vu, Sae Young Chung, Yong H. Lee, Vahid Tarokh

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of n randomly located wireless nodes. The infrastructure uses multiantenna base stations (BSs), in which the number of BSs and the number of antennas at each BS can scale at arbitrary rates relative to n. Under the model, capacity scaling laws are analyzed for both dense and extended networks. Two BS-based routing schemes are first introduced in this study: an infrastructure-supported single-hop (ISH) routing protocol with multiple-access uplink and broadcast downlink and an infrastructure- supported multihop (IMH) routing protocol. Then, their achievable throughput scalings are analyzed. These schemes are compared against two conventional schemes without BSs: the multihop (MH) transmission and hierarchical cooperation (HC) schemes. It is shown that a linear throughput scaling is achieved in dense networks, as in the case without help of BSs. In contrast, the proposed BS-based routing schemes can, under realistic network conditions, improve the throughput scaling significantly in extended networks. The gain comes from the following advantages of these BS-based protocols. First, more nodes can transmit simultaneously in the proposed scheme than in the MH scheme if the number of BSs and the number of antennas are large enough. Second, by improving the long-distance signal-to-noise ratio (SNR), the received signal power can be larger than that of the HC, enabling a better throughput scaling under extended networks. Furthermore, by deriving the corresponding information-theoretic cut-set upper bounds, it is shown under extended networks that a combination of four schemes IMH, ISH, MH, and HC is order-optimal in all operating regimes.

Original languageEnglish
Article number5961816
Pages (from-to)5088-5102
Number of pages15
JournalIEEE Transactions on Information Theory
Volume57
Issue number8
DOIs
Publication statusPublished - 2011 Aug 1

Fingerprint

scaling
Base stations
Wireless networks
infrastructure
Throughput
Routing protocols
Antennas
broadcast
Scaling laws
regime
Signal to noise ratio
Law
Network protocols

All Science Journal Classification (ASJC) codes

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

Cite this

Shin, W. Y., Jeon, S. W., Devroye, N., Vu, M. H., Chung, S. Y., Lee, Y. H., & Tarokh, V. (2011). Improved capacity scaling in wireless networks with infrastructure. IEEE Transactions on Information Theory, 57(8), 5088-5102. [5961816]. https://doi.org/10.1109/TIT.2011.2158881
Shin, Won Yong ; Jeon, Sang Woon ; Devroye, Natasha ; Vu, Mai H. ; Chung, Sae Young ; Lee, Yong H. ; Tarokh, Vahid. / Improved capacity scaling in wireless networks with infrastructure. In: IEEE Transactions on Information Theory. 2011 ; Vol. 57, No. 8. pp. 5088-5102.
@article{dcda3eca2ee8412387a5e2388c6efc07,
title = "Improved capacity scaling in wireless networks with infrastructure",
abstract = "This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of n randomly located wireless nodes. The infrastructure uses multiantenna base stations (BSs), in which the number of BSs and the number of antennas at each BS can scale at arbitrary rates relative to n. Under the model, capacity scaling laws are analyzed for both dense and extended networks. Two BS-based routing schemes are first introduced in this study: an infrastructure-supported single-hop (ISH) routing protocol with multiple-access uplink and broadcast downlink and an infrastructure- supported multihop (IMH) routing protocol. Then, their achievable throughput scalings are analyzed. These schemes are compared against two conventional schemes without BSs: the multihop (MH) transmission and hierarchical cooperation (HC) schemes. It is shown that a linear throughput scaling is achieved in dense networks, as in the case without help of BSs. In contrast, the proposed BS-based routing schemes can, under realistic network conditions, improve the throughput scaling significantly in extended networks. The gain comes from the following advantages of these BS-based protocols. First, more nodes can transmit simultaneously in the proposed scheme than in the MH scheme if the number of BSs and the number of antennas are large enough. Second, by improving the long-distance signal-to-noise ratio (SNR), the received signal power can be larger than that of the HC, enabling a better throughput scaling under extended networks. Furthermore, by deriving the corresponding information-theoretic cut-set upper bounds, it is shown under extended networks that a combination of four schemes IMH, ISH, MH, and HC is order-optimal in all operating regimes.",
author = "Shin, {Won Yong} and Jeon, {Sang Woon} and Natasha Devroye and Vu, {Mai H.} and Chung, {Sae Young} and Lee, {Yong H.} and Vahid Tarokh",
year = "2011",
month = "8",
day = "1",
doi = "10.1109/TIT.2011.2158881",
language = "English",
volume = "57",
pages = "5088--5102",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

Shin, WY, Jeon, SW, Devroye, N, Vu, MH, Chung, SY, Lee, YH & Tarokh, V 2011, 'Improved capacity scaling in wireless networks with infrastructure', IEEE Transactions on Information Theory, vol. 57, no. 8, 5961816, pp. 5088-5102. https://doi.org/10.1109/TIT.2011.2158881

Improved capacity scaling in wireless networks with infrastructure. / Shin, Won Yong; Jeon, Sang Woon; Devroye, Natasha; Vu, Mai H.; Chung, Sae Young; Lee, Yong H.; Tarokh, Vahid.

In: IEEE Transactions on Information Theory, Vol. 57, No. 8, 5961816, 01.08.2011, p. 5088-5102.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Improved capacity scaling in wireless networks with infrastructure

AU - Shin, Won Yong

AU - Jeon, Sang Woon

AU - Devroye, Natasha

AU - Vu, Mai H.

AU - Chung, Sae Young

AU - Lee, Yong H.

AU - Tarokh, Vahid

PY - 2011/8/1

Y1 - 2011/8/1

N2 - This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of n randomly located wireless nodes. The infrastructure uses multiantenna base stations (BSs), in which the number of BSs and the number of antennas at each BS can scale at arbitrary rates relative to n. Under the model, capacity scaling laws are analyzed for both dense and extended networks. Two BS-based routing schemes are first introduced in this study: an infrastructure-supported single-hop (ISH) routing protocol with multiple-access uplink and broadcast downlink and an infrastructure- supported multihop (IMH) routing protocol. Then, their achievable throughput scalings are analyzed. These schemes are compared against two conventional schemes without BSs: the multihop (MH) transmission and hierarchical cooperation (HC) schemes. It is shown that a linear throughput scaling is achieved in dense networks, as in the case without help of BSs. In contrast, the proposed BS-based routing schemes can, under realistic network conditions, improve the throughput scaling significantly in extended networks. The gain comes from the following advantages of these BS-based protocols. First, more nodes can transmit simultaneously in the proposed scheme than in the MH scheme if the number of BSs and the number of antennas are large enough. Second, by improving the long-distance signal-to-noise ratio (SNR), the received signal power can be larger than that of the HC, enabling a better throughput scaling under extended networks. Furthermore, by deriving the corresponding information-theoretic cut-set upper bounds, it is shown under extended networks that a combination of four schemes IMH, ISH, MH, and HC is order-optimal in all operating regimes.

AB - This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of n randomly located wireless nodes. The infrastructure uses multiantenna base stations (BSs), in which the number of BSs and the number of antennas at each BS can scale at arbitrary rates relative to n. Under the model, capacity scaling laws are analyzed for both dense and extended networks. Two BS-based routing schemes are first introduced in this study: an infrastructure-supported single-hop (ISH) routing protocol with multiple-access uplink and broadcast downlink and an infrastructure- supported multihop (IMH) routing protocol. Then, their achievable throughput scalings are analyzed. These schemes are compared against two conventional schemes without BSs: the multihop (MH) transmission and hierarchical cooperation (HC) schemes. It is shown that a linear throughput scaling is achieved in dense networks, as in the case without help of BSs. In contrast, the proposed BS-based routing schemes can, under realistic network conditions, improve the throughput scaling significantly in extended networks. The gain comes from the following advantages of these BS-based protocols. First, more nodes can transmit simultaneously in the proposed scheme than in the MH scheme if the number of BSs and the number of antennas are large enough. Second, by improving the long-distance signal-to-noise ratio (SNR), the received signal power can be larger than that of the HC, enabling a better throughput scaling under extended networks. Furthermore, by deriving the corresponding information-theoretic cut-set upper bounds, it is shown under extended networks that a combination of four schemes IMH, ISH, MH, and HC is order-optimal in all operating regimes.

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

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

U2 - 10.1109/TIT.2011.2158881

DO - 10.1109/TIT.2011.2158881

M3 - Article

AN - SCOPUS:79960979732

VL - 57

SP - 5088

EP - 5102

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 8

M1 - 5961816

ER -