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

超稠密网络拓扑合作的广义低秩优化

Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks

Kai Yang, Yuanming Shi, Zhi Ding

摘要:

网络密集化是在超低延迟、超高数据率和大量连接设备等严格要求下支持密集移动应用的自然方式。超密集网络中的严重干扰是一个关键瓶颈。跨发射机共享信道状态信息(CSI)和消息可以潜在地减轻干扰并提高系统性能。大多数现有的干扰协调工作需要大量的CSI信令开销,并且在超密集网络中是不切实际的。本文研究了基于网络连通性信息的消息共享中的拓扑协作干扰管理问题。特别是,我们提出了一种广义的低秩优化方法,以最大限度地提高可实现的自由度(DoF)。为了解决结构不良和非凸秩函数的挑战,我们开发了黎曼优化算法,通过秩增长策略来解决一系列复杂的固定秩子问题。利用由复满列秩矩阵构成的非紧Stiefel流形,利用半定提升技术和Burer-Monteiro分解方法,提出了求解复定秩优化问题的黎曼优化算法.数值结果表明,所提出的算法的计算效率和更高的自由度实现。

英文摘要:

Network densification is a natural way to support dense mobile applications under stringent requirements, such as ultra-low latency, ultra-high data rate, and massive connecting devices. Severe interference in ultra-dense networks poses a key bottleneck. Sharing channel state information (CSI) and messages across transmitters can potentially alleviate interferences and improve system performance. Most existing works on interference coordination require significant CSI signaling overhead and are impractical in ultra-dense networks. This paper investigate topological cooperation to manage interferences in message sharing based only on network connectivity information. In particular, we propose a generalized low-rank optimization approach to maximize achievable degrees-of-freedom (DoFs). To tackle the challenges of poor structure and non-convex rank function, we develop Riemannian optimization algorithms to solve a sequence of complex fixed rank subproblems through a rank growth strategy. By exploiting the non-compact Stiefel manifold formed by the set of complex full column rank matrices, we develop Riemannian optimization algorithms to solve the complex fixed-rank optimization problem by applying the semidefinite lifting technique and Burer-Monteiro factorization approach. Numerical results demonstrate the computational efficiency and higher DoFs achieved by the proposed algorithms.

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

↑