HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

Cheol Jeong; Won Yong Shin

doi:10.1007/s11276-015-1017-x

HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

Cheol Jeong, Won Yong Shin

Department of Computational Science and Engineering

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

1 Citation (Scopus)

Abstract

This paper introduces an information-theoretic upper bound on the capacity scaling law for a 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 through BSs in a hierarchical way. We deal with a general scenario where m, l, and the backhaul link rate scale at arbitrary rates relative to n. Then, a generalized cut-set upper bound under the HierHybNET model is derived by cutting not only the wireless connections but also the wired connections. In addition, the corresponding infrastructure-limited regime is identified.

Original language	English
Pages (from-to)	1133-1144
Number of pages	12
Journal	Wireless Networks
Volume	22
Issue number	4
DOIs	https://doi.org/10.1007/s11276-015-1017-x
Publication status	Published - 2016 May 1

Bibliographical note

Funding Information:
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2014R1A1A2054577) and by the research fund of Dankook University(BK21 Plus) in 2014. This paper was presented in part at the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, June/July 2014.

Publisher Copyright:
© 2015, Springer Science+Business Media New York.

All Science Journal Classification (ASJC) codes

Information Systems
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1007/s11276-015-1017-x

Cite this

@article{d8355acf8d3643638b854c11e38b54c0,

title = "HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure",

abstract = "This paper introduces an information-theoretic upper bound on the capacity scaling law for a 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 through BSs in a hierarchical way. We deal with a general scenario where m, l, and the backhaul link rate scale at arbitrary rates relative to n. Then, a generalized cut-set upper bound under the HierHybNET model is derived by cutting not only the wireless connections but also the wired connections. In addition, the corresponding infrastructure-limited regime is identified.",

author = "Cheol Jeong and Shin, {Won Yong}",

note = "Funding Information: This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2014R1A1A2054577) and by the research fund of Dankook University(BK21 Plus) in 2014. This paper was presented in part at the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, June/July 2014. Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2016",

month = may,

day = "1",

doi = "10.1007/s11276-015-1017-x",

language = "English",

volume = "22",

pages = "1133--1144",

journal = "Wireless Networks",

issn = "1022-0038",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - HierHybNET

T2 - Cut-set upper bound of ad hoc networks with cost-effective infrastructure

AU - Jeong, Cheol

AU - Shin, Won Yong

N1 - Funding Information: This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2014R1A1A2054577) and by the research fund of Dankook University(BK21 Plus) in 2014. This paper was presented in part at the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, June/July 2014. Publisher Copyright: © 2015, Springer Science+Business Media New York.

PY - 2016/5/1

Y1 - 2016/5/1

N2 - This paper introduces an information-theoretic upper bound on the capacity scaling law for a 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 through BSs in a hierarchical way. We deal with a general scenario where m, l, and the backhaul link rate scale at arbitrary rates relative to n. Then, a generalized cut-set upper bound under the HierHybNET model is derived by cutting not only the wireless connections but also the wired connections. In addition, the corresponding infrastructure-limited regime is identified.

AB - This paper introduces an information-theoretic upper bound on the capacity scaling law for a 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 through BSs in a hierarchical way. We deal with a general scenario where m, l, and the backhaul link rate scale at arbitrary rates relative to n. Then, a generalized cut-set upper bound under the HierHybNET model is derived by cutting not only the wireless connections but also the wired connections. In addition, the corresponding infrastructure-limited regime is identified.

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

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

U2 - 10.1007/s11276-015-1017-x

DO - 10.1007/s11276-015-1017-x

M3 - Article

AN - SCOPUS:84937683100

SN - 1022-0038

VL - 22

SP - 1133

EP - 1144

JO - Wireless Networks

JF - Wireless Networks

IS - 4

ER -

HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this