arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.02123cs.ITmath.IT
收藏

最优集中式动态时分双工

Optimal Centralized Dynamic-Time-Division-Duplex

Mohsen Mohammadkhani Razlighi, Nikola Zlatanov, Shiva Raj Pokhrel, Petar Popovski

摘要:

在本文中,我们推导出最佳的集中式动态时分双工(D-TDD)的无线网络由$K$全双工节点受到自干扰和加性高斯白噪声。作为一个特殊的情况下,我们还提供了最佳的集中式D-TDD方案时,节点是半双工的,以及当无线网络是由半双工和全双工节点。由此,我们推导出最佳的自适应调度的接收,发送,同时接收和发送,并在网络中的每个节点在每个时隙的沉默,使网络的速率区域最大化。最佳集中式D-TDD的性能可以用作任何其他TDD方案的上限,这在限定TDD方案的相对性能方面是有用的。数值结果表明,所提出的集中式D-TDD方案实现了显着的速率增益比现有的集中式D-TDD方案。

英文摘要:

In this paper, we derive the optimal centralized dynamic-time-division-duplex (D-TDD) scheme for a wireless network comprised of $K$ full-duplex nodes impaired by self-interference and additive white Gaussian noise. As a special case, we also provide the optimal centralized D-TDD scheme when the nodes are half-duplex as well as when the wireless network is comprised of both half-duplex and full-duplex nodes. Thereby, we derive the optimal adaptive scheduling of the reception, transmission, simultaneous reception and transmission, and silence at every node in the network in each time slot such that the rate region of the network is maximized. The performance of the optimal centralized D-TDD can serve as an upper-bound to any other TDD scheme, which is useful in qualifying the relative performance of TDD schemes. The numerical results show that the proposed centralized D-TDD scheme achieves significant rate gains over existing centralized D-TDD schemes.

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

↑