An Online Zero-Forcing Precoder for Weighted Sum-Rate Maximization in Green CoMP Systems

被引:9
作者
Dong, Yanjie [1 ]
Zhang, Haijun [2 ]
Li, Jianqiang [1 ]
Yu, F. Richard [1 ,3 ]
Guo, Song [4 ]
Leung, Victor C. M. [1 ,5 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Univ Sci & Technol Beijing, Beijing Adv Innovat Ctr Mat Genome Engn, Beijing Engn & Technol Res Ctr Convergence Networ, Inst Artificial Intelligence, Beijing 100083, Peoples R China
[3] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
[4] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[5] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
关键词
Adaptive precoder; CoMP; green communications; online learning algorithm; EFFICIENT RESOURCE-ALLOCATION; CELLULAR NETWORKS; OPTIMIZATION APPROACH; ACHIEVABLE RATES; OFDMA SYSTEMS; ENERGY; MANAGEMENT; ACCESS; SECURE; COMMUNICATION;
D O I
10.1109/TWC.2022.3159779
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Following the roadmap of carbon neutrality, wireless communication systems are upgrading to use green energy that comes from renewable sources, e.g., sun, tide, and wind. Due to the volatile arrival of green energy, the on-grid energy is used as a backup for a green coordinated multiple point system. In this work, a weighted sum-rate maximization problem in the green coordinated multiple point system is investigated by expecting non-positive consumption of the on-grid energy in the long term. Motivated by the capacity-achieving property and simple implementation, an online zero-forcing dirty paper precixler is proposed to update the preceding matrices by combining statistical learning with the Lyapunov learning technique. A tradeoff relation is theoretically established to show that the long-term weighted sum rate approaches the O(V)-neighbor of optimal value while the long-term on-grid energy increases at a rate of O(log(2) (v)/root V), where V is an introduced control parameter. Numerical results are used to verify the performance of the proposed online adaptive precoder.
引用
收藏
页码:7566 / 7581
页数:16
相关论文
共 63 条
[1]  
[Anonymous], 2018, Springer Optim. Appl.
[2]  
[Anonymous], MATRIX COMPUTATIONS, DOI DOI 10.1529/biophysj.107.126995
[3]   A Collision Resolution Protocol for Random Access in Massive MIMO [J].
Bai, Lin ;
Liu, Jiexun ;
Yu, Quan ;
Choi, Jinho ;
Zhang, Wei .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (03) :686-699
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION
[5]   Learn-and-Adapt Stochastic Dual Gradients for Network Resource Allocation [J].
Chen, Tianyi ;
Ling, Qing ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2018, 5 (04) :1941-1951
[6]   An Online Convex Optimization Approach to Proactive Network Resource Allocation [J].
Chen, Tianyi ;
Ling, Qing ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (24) :6350-6364
[7]   Stochastic Averaging for Constrained Optimization With Application to Online Resource Allocation [J].
Chen, Tianyi ;
Mokhtari, Aryan ;
Wang, Xin ;
Ribeiro, Alejandro ;
Giannakis, Georgios B. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (12) :3078-3093
[8]   Massive Access for 5G and Beyond [J].
Chen, Xiaoming ;
Ng, Derrick Wing Kwan ;
Yu, Wei ;
Larsson, Erik G. ;
Al-Dhahir, Naofal ;
Schober, Robert .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (03) :615-637
[9]   Precoding for multiple antenna Gaussian broadcast channels with successive, zero-forcing [J].
Dabbagh, Arnir D. ;
Love, David J. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (07) :3837-3850
[10]  
Dong Y., 2022, P IEEE ICASSP