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

在高斯半双工中继线网络中有效地寻找简单调度

Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks

Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti

摘要:

由于需要考虑的收听/发送网络状态的指数数量,最优地操作高斯半双工(HD)中继网络的问题是具有挑战性的。最近的结果表明,对于具有N个中继的高斯HD网络类,总是存在一个简单的调度,即,具有至多N +1个活动状态,这对于近似(即,直到恒定间隙)容量表征。本文研究如何有效地找到这样一个简单的时间表线网络。为此,多项式时间算法的设计和证明输出一个简单的时间表,达到近似的能力。该算法的关键成分是利用HD中的网络状态和图中的边着色之间的相似性。它还表明,该算法允许导出一个封闭形式的表达的近似能力的高斯线网络,可以评估分配和线性时间。此外,它是使用这种封闭形式,半双工路由问题是NP-难。

英文摘要:

The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of Gaussian HD networks with N relays, there always exists a simple schedule, i.e., with at most N +1 active states, that is sufficient for approximate (i.e., up to a constant gap) capacity characterization. This paper investigates how to efficiently find such a simple schedule over line networks. Towards this end, a polynomial-time algorithm is designed and proved to output a simple schedule that achieves the approximate capacity. The key ingredient of the algorithm is to leverage similarities between network states in HD and edge coloring in a graph. It is also shown that the algorithm allows to derive a closed-form expression for the approximate capacity of the Gaussian line network that can be evaluated distributively and in linear time. Additionally, it is shown using this closed-form that the problem of Half-Duplex routing is NP-Hard.

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

↑