Computationally Efficient Energy Optimization for Cloud Radio Access Networks With CSI Uncertainty

被引:8
作者
Wang, Yong [1 ]
Ma, Lin [1 ]
Xu, Yubin [1 ]
Xiang, Wei [2 ]
机构
[1] Harbin Inst Technol, Dept Elect & Informat Engn, Harbin 150001, Heilongjiang, Peoples R China
[2] James Cook Univ, Coll Sci & Engn, Townsville, Qld 4811, Australia
基金
中国国家自然科学基金;
关键词
C-RAN; green communications; CSI uncertainty; semi-definite relaxation; convex programming; COOPERATIVE NETWORKS; DOWNLINK; MIMO; TRANSMISSION; CHANNEL; DESIGN;
D O I
10.1109/TCOMM.2017.2737014
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies robust energy optimization for the cloud radio access network (C-RAN). The objective of this paper is to jointly minimize network power consumption through optimizing the base station (BS) mode, multi-user (MU)-BS association, and beamforming vectors given imperfect channel state information (CSI). To solve this non-trivial problem, we first transform the problem to a semi-definite programming (SDP) one using the S-lemma with the aid of the semi-definite relaxation technique, and then propose a SDP-based group sparse beamforming approach to solve it iteratively. Since the computational complexity of solving SDP problems is intractable, we propose to translate the uncertainty in the CSI to the uncertainty in its covariance matrix, and then recast the original problem as a mixed-integer second-order cone programming problem. We further propose a two-stage rank selection framework to determine the BS mode and MU-BS association separately and successively. Simulation results demonstrate the convergence of our proposed algorithms, and validate the effectiveness of the proposed algorithms in minimizing the network power consumption of the C-RAN.
引用
收藏
页码:5499 / 5513
页数:15
相关论文
共 50 条
  • [41] Efficient Algorithm for Baseband Unit Pool Planning in Cloud Radio Access Networks
    Xu, Sheng
    Wang, Shaowei
    2016 IEEE 83RD VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2016,
  • [42] Sparse Joint Transmission for Cloud Radio Access Networks With Limited Fronthaul Capacity
    Han, Deokhwan
    Park, Jeonghun
    Park, Seok-Hwan
    Lee, Namyoon
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (05) : 3395 - 3408
  • [43] Joint Optimization of Communication Latency and Resource Allocation in Cloud Radio Access Networks
    Mharsi, Niezi
    Hadji, Makhlouf
    2018 INTERNATIONAL CONFERENCE ON SMART COMMUNICATIONS IN NETWORK TECHNOLOGIES (SACONET), 2018, : 13 - 18
  • [44] eDSA: Energy-Efficient Dynamic Spectrum Access Protocols for Cognitive Radio Networks
    Agarwal, Satyam
    De, Swades
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2016, 15 (12) : 3057 - 3071
  • [45] Resource Allocation Optimization for Delay-Sensitive Traffic in Fronthaul Constrained Cloud Radio Access Networks
    Li, Jian
    Peng, Mugen
    Cheng, Aolin
    Yu, Yuling
    Wang, Chonggang
    IEEE SYSTEMS JOURNAL, 2017, 11 (04): : 2267 - 2278
  • [46] An Energy-Aware Data Offloading Scheme in Cloud Radio Access Networks
    Chen, Yuh-Shyan
    Hsu, Chih-Shun
    Juang, Tong-Ying
    Lin, Hsin-Han
    2015 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2015, : 1984 - 1989
  • [47] Throughput reliability analysis of cloud-radio access networks
    Ghods, Fatemeh
    Fapojuwo, Abraham
    Ghannouchi, Fadhel
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2016, 16 (17) : 2824 - 2838
  • [48] A Dynamic Resource Sharing Mechanism for Cloud Radio Access Networks
    Niu, Binglai
    Zhou, Yong
    Shah-Mansouri, Hamed
    Wong, Vincent W. S.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (12) : 8325 - 8338
  • [49] On efficient radio resource calendaring in cloud radio access network
    Morcos, Mira
    Elias, Jocelyne
    Martignon, Fabio
    Chahed, Tijani
    Chen, Lin
    COMPUTER NETWORKS, 2019, 162
  • [50] Channel-Aware Resource Allocation for Energy-Efficient Cloud Radio Access Networks Under Outage Specifications
    Li, Pei-Rong
    Feng, Kai-Ten
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (11) : 7389 - 7403