This paper considers a diamond network with n interconnected relays, namely a network where a source communicates with a destination by hopping information through n communicating/interconnected relays. Specifically, the main focus of the paper is on characterizing sufficient conditions under which the n + 1 states (out of the 2n possible ones) in which at most one relay is transmitting suffice to characterize the approximate capacity, that is the Shannon capacity up to an additive gap that only depends on n. Furthermore, under these sufficient conditions, closed form expressions for the approximate capacity and scheduling (that is, the fraction of time each relay should receive and transmit) are provided. A similar result is presented for the dual case, where in each state at most one relay is in receive mode.
|Original language||English (US)|
|Title of host publication||2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - Jul 12 2021|
|Event||2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia|
Duration: Jul 12 2021 → Jul 20 2021
|Name||2021 IEEE International Symposium on Information Theory (ISIT)|
|Conference||2021 IEEE International Symposium on Information Theory, ISIT 2021|
|Period||7/12/21 → 7/20/21|
Bibliographical noteFunding Information:
This research was supported in part by NSF under Award #1907785.
© 2021 IEEE.