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

详细信息    查看全文

• 作者：Cheol Jeong ; Won-Yong Shin
• 刊名：Wireless Networks
• 出版年：2016
• 出版时间：May 2016
• 年：2016
• 卷：22
• 期：4
• 页码：1133-1144
• 全文大小：919 KB
• 刊物类别：Computer Science
• 刊物主题：Computer Communication Networks
  Electronic and Computer Engineering
  Business Information Systems
  
• 出版者：Springer Netherlands
• ISSN：1572-8196
• 卷排序：22

文摘

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.KeywordsAd hoc networkBackhaulBase station (BS)Capacity scalingCostInfrastructureRemote central processor (RCP)