arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.05161cs.ITmath.IT
收藏

高斯半双工菱形网络的网络化简

On Network Simplification for Gaussian Half-Duplex Diamond Networks

Martina Cardone, Christina Fragouli, Daniela Tuninetti

摘要:

研究高斯半双工菱形网络的简化问题。目标是回答以下问题:通过从$N$可能的中继中智能地选择$k$中继的子集,总HD容量的最小(最坏情况)分数是多少?我们在$k=1$和$k=2$的这个问题上取得了进展,并且表明对于$N=k+1, \ k \in \{1,2\}$,总HD容量的至少$\frac{k}{k+1}$总是{近似(即,直到恒定间隙)}。有趣的是,与全双工(FD)情况不同,HD中的比率取决于$N$,并且随着$N$增加而减小。对于$N$和$k$的所有值,我们推导出最坏情况的分数,我们也表明这些是{近似}紧的。这是通过呈现$N$ -中继高斯HD菱形网络来实现的,对于该网络,最佳$k$ -中继子网络具有等于总HD容量的最差情况分数的HD容量。此外,我们提供了额外的性能之间的比较,这个简化问题的HD和FD网络,突出了它们的不同性质。

英文摘要:

This paper investigates the simplification problem in Gaussian Half-Duplex (HD) diamond networks. The goal is to answer the following question: what is the minimum (worst-case) fraction of the total HD capacity that one can always achieve by smartly selecting a subset of $k$ relays, out of the $N$ possible ones? We make progress on this problem for $k=1$ and $k=2$ and show that for $N=k+1, \ k \in \{1,2\}$ at least $\frac{k}{k+1}$ of the total HD capacity is always {approximately (i.e., up to a constant gap)} achieved. Interestingly, and differently from the Full-Duplex (FD) case, the ratio in HD depends on $N$, and decreases as $N$ increases. For all values of $N$ and $k$ for which we derive worst case fractions, we also show these to be {approximately} tight. This is accomplished by presenting $N$-relay Gaussian HD diamond networks for which the best $k$-relay subnetwork has {an approximate} HD capacity equal to the worst-case fraction of the total {approximate} HD capacity. Moreover, we provide additional comparisons between the performance of this simplification problem for HD and FD networks, which highlight their different natures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑