论文标题
高斯半双链钻石网络中的最佳接力选择
Best Relay Selection in Gaussian Half-Duplex Diamond Networks
论文作者
论文摘要
本文考虑了高斯半双链钻石$ n $ -relay网络，其中源通过通过一层$ n $ n $非交流的继电器来与目的地进行通信，以半完整的方式运行。主要重点包括调查以下问题：单个继电器对整个网络的近似能力的贡献是什么？特别是，近似能力是指近似于添加差距内的香农容量的数量，仅取决于$ n $，并且独立于通道参数。本文通过提供表现最高的单继电器的近似能力与整个网络的近似能力之间的比率（对于任何数字$ n $）之间的比率来回答上述问题。令人惊讶的是，这表明这种比率保证为$ f = 1/（2+2 \ cos（2π/（n+2）））$，这是$ n $的正弦函数，随着$ n $的增加而降低。还表明，上述比率保证是紧密的，即存在高斯半双链钻石$ n $ -relay网络，其中表现最高的继电器的容量近似于整个网络的近似能力的$ f $分数。
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\cos(2π/(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.
