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

Cheol Jeong, Won Yong Shin

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)1133-1144
Number of pages12
JournalWireless Networks
Volume22
Issue number4
DOIs
Publication statusPublished - 2016 May 1

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this