ShanghaiTech University Knowledge Management System
Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks | |
2019-05 | |
发表期刊 | IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS |
ISSN | 1536-1276 |
卷号 | 18期号:5页码:2539-2552 |
发表状态 | 已发表 |
DOI | 10.1109/TWC.2019.2904570 |
摘要 | 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 the interferences and improve the system performance. Most existing works on interference coordination require significant CSI signaling overhead and are impractical in the ultra-dense networks. This paper investigates the topological cooperation to manage interferences in message sharing based only on the network connectivity information. In particular, we propose a generalized low-rank optimization approach in a complex field to maximize the achievable degrees of freedom (DoFs) by establishing interference alignment conditions for the topological cooperation. To tackle the challenges of poor structure and non-convex rank function, we develop the 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 the Riemannian optimization algorithms to solve the complex fixed-rank optimization problem by applying the semi-definite lifting technique and the Burer-Monteiro factorization approach. The numerical results demonstrate the computational efficiency and higher DoFs achieved by the proposed algorithms. |
关键词 | Low-rank models topological interference alignment transmitter cooperation degrees-of-freedom Riemannian optimization in complex field |
URL | 查看原文 |
收录类别 | SCI ; SCIE ; EI |
语种 | 英语 |
资助项目 | National Science Foundation[CNS-1702752] ; National Science Foundation[ECCS1711823] |
WOS研究方向 | Engineering ; Telecommunications |
WOS类目 | Engineering, Electrical & Electronic ; Telecommunications |
WOS记录号 | WOS:000467579800007 |
出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
EI入藏号 | 20192006929626 |
EI主题词 | Channel state information ; Computational efficiency ; Degrees of freedom (mechanics) ; Information management ; Optimization ; Topology ; Transmitters |
EI分类号 | Computer Systems and Equipment:722 ; Combinatorial Mathematics, Includes Graph Theory, Set Theory:921.4 ; Optimization Techniques:921.5 ; Mechanics:931.1 |
WOS关键词 | INTERFERENCE ALIGNMENT ; MANAGEMENT ; FREEDOM ; CHANNEL ; DESIGN |
原始文献类型 | Article |
来源库 | IEEE |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/34155 |
专题 | 信息科学与技术学院 信息科学与技术学院_PI研究组_石远明组 |
作者单位 | 1.University of Chinese Academy of Sciences, Beijing, China 2.School of Information Science and Technology, ShanghaiTech University, Shanghai, China 3.Department of Electrical and Computer Engineering, University of California at Davis, Davis, CA, USA |
推荐引用方式 GB/T 7714 | Kai Yang,Yuanming Shi,Zhi Ding. Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks[J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS,2019,18(5):2539-2552. |
APA | Kai Yang,Yuanming Shi,&Zhi Ding.(2019).Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks.IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS,18(5),2539-2552. |
MLA | Kai Yang,et al."Generalized Low-Rank Optimization for Topological Cooperation in Ultra-Dense Networks".IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 18.5(2019):2539-2552. |
条目包含的文件 | 下载所有文件 | |||||
文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 |
个性服务 |
查看访问统计 |
谷歌学术 |
谷歌学术中相似的文章 |
[Kai Yang]的文章 |
[Yuanming Shi]的文章 |
[Zhi Ding]的文章 |
百度学术 |
百度学术中相似的文章 |
[Kai Yang]的文章 |
[Yuanming Shi]的文章 |
[Zhi Ding]的文章 |
必应学术 |
必应学术中相似的文章 |
[Kai Yang]的文章 |
[Yuanming Shi]的文章 |
[Zhi Ding]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
修改评论
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。