Wireless network simplification: The Gaussian N-relay diamond network
Wireless network simplification: The Gaussian N-relay diamond network
复制标题
无线网络简化：高斯 N 中继钻石网络
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
C. Fragouli
中科院分区：
文献类型：
--
作者：
Caner Nazaroglu;Ayfer Özgür;C. Fragouli
我们考虑高斯N-中继菱形网络，其中源想要通过N-中继节点层与目的节点通信。我们调查了以下问题：我们可以通过使用N个可用继电器中的仅K个来维持容量的哪一部分？我们发现，在每一个高斯N-中继钻石网络，存在一个子集的k个中继，单独提供约k超过k+1的总容量。该结果独立于可用中继节点的数量N、信道配置和工作SNR。结果是紧的，在这个意义上，存在N-中继菱形网络的信道配置，其中k个中继的每个子集可以提供最多k超过k+1的总容量。近似值在3 logN +3 k bits/s/Hz的容量范围内。这一结果也提供了一个新的近似的高斯N-中继钻石网络的容量，这是一个乘法的间隙1超过k+1和3 logN +3 k的加法间隙。目前的近似结果在文献中的目的是通过不允许乘法间隙或反之亦然，以表征在一个加性间隙内的容量。我们的结果提出了一种新的近似方法，其中同时允许乘法和加法间隙，并通过辅助参数进行交易。
We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the N available relays? We show that in every Gaussian N-relay diamond network, there exists a subset of k relays which alone provide approximately k over k+1 of the total capacity. The result holds independent of the number of available relay nodes N, the channel configurations and the operating SNR. The result is tight in the sense that there exists channel configurations for N-relay diamond networks, where every subset of k relays can provide at most k over k+1 of the total capacity. The approximation is within 3 logN + 3k bits/s/Hz to the capacity. This result also provides a new approximation to the capacity of the Gaussian N-relay diamond network which is up to a multiplicative gap of 1 over k+1 and additive gap of 3 logN + 3k. The current approximation results in the literature either aim to characterize the capacity within an additive gap by allowing no multiplicative gap or vice a versa. Our result suggests a new approximation approach where multiplicative and additive gaps are allowed simultaneously and are traded through an auxiliary parameter.1