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 | |
| Publication status | Published - 2016 May 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
}
HierHybNET : Cut-set upper bound of ad hoc networks with cost-effective infrastructure. / Jeong, Cheol; Shin, Won-Yong.
In: Wireless Networks, Vol. 22, No. 4, 01.05.2016, p. 1133-1144.Research output: Contribution to journal › Article
TY - JOUR
T1 - HierHybNET
T2 - Cut-set upper bound of ad hoc networks with cost-effective infrastructure
AU - Jeong, Cheol
AU - Shin, Won-Yong
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
VL - 22
SP - 1133
EP - 1144
JO - Wireless Networks
JF - Wireless Networks
SN - 1022-0038
IS - 4
ER -