Joint Computing and Radio Resource Allocation in Cloud Radio Access Networks

被引:1
|
作者
Shirzad, Fatemeh [1 ]
Ghaderi, Majid [1 ]
机构
[1] Univ Calgary, Dept Comp Sci, Calgary, AB, Canada
关键词
Cloud Radio Access Networks; Joint Resource Allocation; BBU-RRH Mapping; Joint Transmission;
D O I
10.1109/MASS52906.2021.00070
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers the problem of joint radio and computing resource allocation in Cloud Radio Access Network (C-RAN) architecture. We develop a resource allocation scheme to maximize weighted sum-rate of the system, while minimizing total power consumption. For power consumption, we consider both static and dynamic power consumption in Remote Radio Heads (RRHs), fronthaul links, and Base Band processing Units (BBUs). Our model considers quality of service requirements, fronthaul capacity, maximum transmission power, and computing capacity constraints in a comprehensive formulation. The joint resource allocation problem is non-convex, which is shown to be NP-hard, and thus we apply a number of techniques to convexify the problem. Then, using the Karush-Kuhn-Tucker (KKT) conditions, we show that the problem can be decomposed into two sub-problems that can be efficiently solved using an iterative Quadratically Constrained Quadratic Program (QCQP) and a bin packing algorithm, respectively. The performance of the proposed scheme is evaluated through simulation studies, which shows the proposed scheme outperforms the existing approaches in BBU minimization, total power consumption, and system utility which is defined as the weighted sum-rate minus power consumption.
引用
收藏
页码:518 / 526
页数:9
相关论文
共 50 条
  • [1] Optimal Cloud Computing Resource Allocation For Centralized Radio Access Networks
    Kim, Taewoon
    Choi, Wooyeol
    [J]. 2019 INTERNATIONAL CONFERENCE ON ELECTRONICS, INFORMATION, AND COMMUNICATION (ICEIC), 2019, : 341 - 342
  • [2] Joint Communication and Computing Resource Allocation in 5G Cloud Radio Access Networks
    Ferdouse, Lilatul
    Anpalagan, Alagan
    Erkucuk, Serhat
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (09) : 9122 - 9135
  • [3] Efficient Joint User Association and Resource Allocation for Cloud Radio Access Networks
    Awais, Muhammad
    Ahmed, Ashfaq
    Naeem, Muhammad
    Iqbal, Muhammad
    Ejaz, Waleed
    Anpalagan, Alagan
    Kim, Hyung Seok
    [J]. IEEE ACCESS, 2017, 5 : 1439 - 1448
  • [4] Joint Resource Allocation and User Association for Heterogeneous Cloud Radio Access Networks
    Lee, Ying Loong
    Wang, Li-Chun
    Chuah, Teong Chee
    Loo, Jonathan
    [J]. 2016 28TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC 28), VOL 1, 2016, : 87 - 93
  • [5] Joint Optimization of Communication Latency and Resource Allocation in Cloud Radio Access Networks
    Mharsi, Niezi
    Hadji, Makhlouf
    [J]. 2018 INTERNATIONAL CONFERENCE ON SMART COMMUNICATIONS IN NETWORK TECHNOLOGIES (SACONET), 2018, : 13 - 18
  • [6] An Efficient and Balanced BBU Computing Resource Allocation Algorithm for Cloud Radio Access Networks
    Zhang, Fan
    Zheng, Jun
    Zhang, Yuan
    Chu, Liangyu
    [J]. 2017 IEEE 85TH VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2017,
  • [7] Joint Uplink-Downlink Resource Allocation in OFDMA Cloud Radio Access Networks
    Lin, Zehong
    Liu, Yuan
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [8] Multi-Resource Allocation in Cloud Radio Access Networks
    Yu, Nuo
    Song, Zhaohui
    Du, Hongwei
    Huang, Hejiao
    Jia, Xiaohua
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [9] Joint Clusterization and Power Allocation for Cloud Radio Access Networks
    Tsou, Yao-Chun
    Li, Pei-Rong
    Chu, Jui-Hung
    Feng, Kai-Ten
    [J]. 2015 IEEE 82ND VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2015,
  • [10] Joint Interference Cancellation and Resource Allocation for Full-Duplex Cloud Radio Access Networks
    Fang, Chun-Hao
    Li, Pei-Rong
    Feng, Kai-Ten
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (06) : 3019 - 3033