Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve

Sarthak Jain; Soheil Mohajer; Martina Cardone

doi:10.1109/twc.2021.3066527

Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

This paper considers Gaussian half-duplex diamond n-relay networks, where a source communicates with a destination by hopping information through one layer of n non-communicating relays that operate in half-duplex. The main focus consists of investigating the following question: What is the contribution of a single relay on the approximate capacity of the entire network? In particular, approximate capacity refers to a quantity that approximates the Shannon capacity within an additive gap which only depends on n, and is independent of the channel parameters. This paper answers the above question by providing a fundamental bound on the ratio between the approximate capacity of the highest-performing single relay and the approximate capacity of the entire network, for any number n. Surprisingly, it is shown that such a ratio guarantee is f = 1/(2+2 (2\pil/(n+2))), that is a sinusoidal function of n, which decreases as n increases. It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond n-relay networks, where the highest-performing relay has an approximate capacity equal to an f fraction of the approximate capacity of the entire network.

Original language	English (US)
Article number	9384304
Pages (from-to)	5273-5287
Number of pages	15
Journal	IEEE Transactions on Wireless Communications
Volume	20
Issue number	8
DOIs	https://doi.org/10.1109/twc.2021.3066527
State	Published - Aug 2021

Bibliographical note

Funding Information:
Manuscript received January 20, 2020; revised August 2, 2020 and December 18, 2020; accepted February 28, 2021. Date of publication March 23, 2021; date of current version August 12, 2021. This work was supported by NSF under Award 1907785. This article was presented in part at the 2020 IEEE International Symposium on Information Theory. The associate editor coordinating the review of this article and approving it for publication was R. Tandon. (Corresponding author: Sarthak Jain.) The authors are with the Electrical and Computer Engineering Department, University of Minnesota, Twin Cities, Minneapolis, MN 55455 USA (e-mail: [email protected]; [email protected]; [email protected]).

Publisher Copyright:
© 2002-2012 IEEE.

Keywords

Half-duplex
approximate capacity
diamond network
relay selection

Publisher link

10.1109/twc.2021.3066527

Find It

Find It at U of M Libraries

Cite this

@article{6251188f871e436297d3ea556b77aa50,

title = "Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve",

abstract = "This paper considers Gaussian half-duplex diamond n-relay networks, where a source communicates with a destination by hopping information through one layer of n non-communicating relays that operate in half-duplex. The main focus consists of investigating the following question: What is the contribution of a single relay on the approximate capacity of the entire network? In particular, approximate capacity refers to a quantity that approximates the Shannon capacity within an additive gap which only depends on n, and is independent of the channel parameters. This paper answers the above question by providing a fundamental bound on the ratio between the approximate capacity of the highest-performing single relay and the approximate capacity of the entire network, for any number n. Surprisingly, it is shown that such a ratio guarantee is f = 1/(2+2 (2\textbackslash{}pil/(n+2))), that is a sinusoidal function of n, which decreases as n increases. It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond n-relay networks, where the highest-performing relay has an approximate capacity equal to an f fraction of the approximate capacity of the entire network.",

keywords = "Half-duplex, approximate capacity, diamond network, relay selection",

author = "Sarthak Jain and Soheil Mohajer and Martina Cardone",

note = "Funding Information: Manuscript received January 20, 2020; revised August 2, 2020 and December 18, 2020; accepted February 28, 2021. Date of publication March 23, 2021; date of current version August 12, 2021. This work was supported by NSF under Award 1907785. This article was presented in part at the 2020 IEEE International Symposium on Information Theory. The associate editor coordinating the review of this article and approving it for publication was R. Tandon. (Corresponding author: Sarthak Jain.) The authors are with the Electrical and Computer Engineering Department, University of Minnesota, Twin Cities, Minneapolis, MN 55455 USA (e-mail: [email protected]; [email protected]; [email protected]). Publisher Copyright: {\textcopyright} 2002-2012 IEEE.",

year = "2021",

month = aug,

doi = "10.1109/twc.2021.3066527",

language = "English (US)",

volume = "20",

pages = "5273--5287",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Gaussian Half-Duplex Diamond Networks

T2 - Ratio of Capacity the Best Relay Can Achieve

AU - Jain, Sarthak

AU - Mohajer, Soheil

AU - Cardone, Martina

N1 - Funding Information: Manuscript received January 20, 2020; revised August 2, 2020 and December 18, 2020; accepted February 28, 2021. Date of publication March 23, 2021; date of current version August 12, 2021. This work was supported by NSF under Award 1907785. This article was presented in part at the 2020 IEEE International Symposium on Information Theory. The associate editor coordinating the review of this article and approving it for publication was R. Tandon. (Corresponding author: Sarthak Jain.) The authors are with the Electrical and Computer Engineering Department, University of Minnesota, Twin Cities, Minneapolis, MN 55455 USA (e-mail: [email protected]; [email protected]; [email protected]). Publisher Copyright: © 2002-2012 IEEE.

PY - 2021/8

Y1 - 2021/8

N2 - This paper considers Gaussian half-duplex diamond n-relay networks, where a source communicates with a destination by hopping information through one layer of n non-communicating relays that operate in half-duplex. The main focus consists of investigating the following question: What is the contribution of a single relay on the approximate capacity of the entire network? In particular, approximate capacity refers to a quantity that approximates the Shannon capacity within an additive gap which only depends on n, and is independent of the channel parameters. This paper answers the above question by providing a fundamental bound on the ratio between the approximate capacity of the highest-performing single relay and the approximate capacity of the entire network, for any number n. Surprisingly, it is shown that such a ratio guarantee is f = 1/(2+2 (2\pil/(n+2))), that is a sinusoidal function of n, which decreases as n increases. It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond n-relay networks, where the highest-performing relay has an approximate capacity equal to an f fraction of the approximate capacity of the entire network.

AB - This paper considers Gaussian half-duplex diamond n-relay networks, where a source communicates with a destination by hopping information through one layer of n non-communicating relays that operate in half-duplex. The main focus consists of investigating the following question: What is the contribution of a single relay on the approximate capacity of the entire network? In particular, approximate capacity refers to a quantity that approximates the Shannon capacity within an additive gap which only depends on n, and is independent of the channel parameters. This paper answers the above question by providing a fundamental bound on the ratio between the approximate capacity of the highest-performing single relay and the approximate capacity of the entire network, for any number n. Surprisingly, it is shown that such a ratio guarantee is f = 1/(2+2 (2\pil/(n+2))), that is a sinusoidal function of n, which decreases as n increases. It is also shown that the aforementioned ratio guarantee is tight, i.e., there exist Gaussian half-duplex diamond n-relay networks, where the highest-performing relay has an approximate capacity equal to an f fraction of the approximate capacity of the entire network.

KW - Half-duplex

KW - approximate capacity

KW - diamond network

KW - relay selection

UR - https://www.scopus.com/pages/publications/85103296851

UR - https://www.scopus.com/pages/publications/85103296851#tab=citedBy

U2 - 10.1109/twc.2021.3066527

DO - 10.1109/twc.2021.3066527

M3 - Article

AN - SCOPUS:85103296851

SN - 1536-1276

VL - 20

SP - 5273

EP - 5287

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 8

M1 - 9384304

ER -

Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this