Paper ID | I.6.1 | ||
Paper Title | On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks | ||
Authors | Sarthak Jain, Soheil Mohajer, Martina Cardone, University of Minnesota, Twin Cities, United States | ||
Session | I.6: Relay Channel | ||
Presentation | Lecture | ||
Track | Network Information Theory | ||
Manuscript | Click here to download the manuscript | ||
Virtual Presentation | Click here to watch in the Virtual Symposium | ||
Abstract | This paper considers the Gaussian half-duplex diamond $n$-relay networks, which consist of a broadcast hop between the source and $n$ relays, and of a multiple access hop between the relays and the destination. The $n$ relays do not communicate with each other and operate in half-duplex mode. The main focus of the paper is in answering the following question: What fraction of the {\em approximate capacity} of the entire network can be retained by only operating the highest-performing single relay? It is shown that a fraction $f=1/(2+2 \cos(\frac{2 \pi}{n+2}))$ of the {\em approximate capacity} of the entire network can always be guaranteed. This fraction is also shown to be tight, that is, there exist Gaussian half-duplex diamond $n$-relay networks for which exactly an $f$ fraction of the {\em approximate capacity} of the entire network can be achieved by using only the highest-performing relay. |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia