HierHybNET: Capacity scaling of ad hoc networks with cost-effective infrastructure

Cheol Jeong, Won Yong Shin

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we introduce a large-scale hierarchical hybrid network (HierHybNET) consisting of both n wireless ad hoc nodes and m base stations (BSs) equipped with l multiple antennas per BS, where the communication takes place from wireless nodes to a remote central processor (RCP) through BSs in a hierarchical way. To understand a relationship between capacity and cost, we deal with a general scenario where m, l, and the backhaul link rate can scale at arbitrary rates relative to n (i.e., we introduce three scaling parameters). In order to provide a cost-effective solution for the deployment of backhaul links connecting BSs and the RCP, we first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed. Moreover, three-dimensional information-theoretic operating regimes are explicitly identified according to the three scaling parameters. We also characterize an infrastructure-limited regime where the throughput is limited by the backhaul link rate.

Original languageEnglish
Pages (from-to)543-552
Number of pages10
JournalAd Hoc Networks
Volume37
DOIs
Publication statusPublished - 2016 Feb 1

Fingerprint

Ad hoc networks
Base stations
Scaling laws
Costs
Throughput
Antennas
Communication

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{315342d81c8447a6b36d55a7452ce097,
title = "HierHybNET: Capacity scaling of ad hoc networks with cost-effective infrastructure",
abstract = "In this paper, we introduce a large-scale hierarchical hybrid network (HierHybNET) consisting of both n wireless ad hoc nodes and m base stations (BSs) equipped with l multiple antennas per BS, where the communication takes place from wireless nodes to a remote central processor (RCP) through BSs in a hierarchical way. To understand a relationship between capacity and cost, we deal with a general scenario where m, l, and the backhaul link rate can scale at arbitrary rates relative to n (i.e., we introduce three scaling parameters). In order to provide a cost-effective solution for the deployment of backhaul links connecting BSs and the RCP, we first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed. Moreover, three-dimensional information-theoretic operating regimes are explicitly identified according to the three scaling parameters. We also characterize an infrastructure-limited regime where the throughput is limited by the backhaul link rate.",
author = "Cheol Jeong and Shin, {Won Yong}",
year = "2016",
month = "2",
day = "1",
doi = "10.1016/j.adhoc.2015.10.006",
language = "English",
volume = "37",
pages = "543--552",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",

}

HierHybNET : Capacity scaling of ad hoc networks with cost-effective infrastructure. / Jeong, Cheol; Shin, Won Yong.

In: Ad Hoc Networks, Vol. 37, 01.02.2016, p. 543-552.

Research output: Contribution to journalArticle

TY - JOUR

T1 - HierHybNET

T2 - Capacity scaling of ad hoc networks with cost-effective infrastructure

AU - Jeong, Cheol

AU - Shin, Won Yong

PY - 2016/2/1

Y1 - 2016/2/1

N2 - In this paper, we introduce a large-scale hierarchical hybrid network (HierHybNET) consisting of both n wireless ad hoc nodes and m base stations (BSs) equipped with l multiple antennas per BS, where the communication takes place from wireless nodes to a remote central processor (RCP) through BSs in a hierarchical way. To understand a relationship between capacity and cost, we deal with a general scenario where m, l, and the backhaul link rate can scale at arbitrary rates relative to n (i.e., we introduce three scaling parameters). In order to provide a cost-effective solution for the deployment of backhaul links connecting BSs and the RCP, we first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed. Moreover, three-dimensional information-theoretic operating regimes are explicitly identified according to the three scaling parameters. We also characterize an infrastructure-limited regime where the throughput is limited by the backhaul link rate.

AB - In this paper, we introduce a large-scale hierarchical hybrid network (HierHybNET) consisting of both n wireless ad hoc nodes and m base stations (BSs) equipped with l multiple antennas per BS, where the communication takes place from wireless nodes to a remote central processor (RCP) through BSs in a hierarchical way. To understand a relationship between capacity and cost, we deal with a general scenario where m, l, and the backhaul link rate can scale at arbitrary rates relative to n (i.e., we introduce three scaling parameters). In order to provide a cost-effective solution for the deployment of backhaul links connecting BSs and the RCP, we first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed. Moreover, three-dimensional information-theoretic operating regimes are explicitly identified according to the three scaling parameters. We also characterize an infrastructure-limited regime where the throughput is limited by the backhaul link rate.

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

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

U2 - 10.1016/j.adhoc.2015.10.006

DO - 10.1016/j.adhoc.2015.10.006

M3 - Article

AN - SCOPUS:84955279319

VL - 37

SP - 543

EP - 552

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

ER -