TY - GEN
T1 - Cooperative transmission meets computation provisioning in downlink C-RAN
AU - Guo, Kun
AU - Sheng, Min
AU - Tang, Jianhua
AU - Quek, Tony Q.S.
AU - Wang, Xijun
AU - Qiu, Zhiliang
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/12
Y1 - 2016/7/12
N2 - Cloud radio access network (C-RAN), regarded as a promising green network architecture, facilitates cooperative transmission among remote radio heads (RRHs) while enabling flexible computation provisioning in the virtualized baseband unit pool. By jointly optimizing cooperative transmission, i.e., transmit power allocation with zero-forcing precoding adopted, and computation provisioning, i.e., virtual machine assignment, this paper minimizes the system power consumption comprised of transmit power and processing power in downlink C-RAN. Specifically, subject to per-RRH power constraint (PRPC) and per-MU quality of service constraint, the system power consumption minimization problem is formulated as a mixed integer nonlinear programming (MINLP) problem. To solve the challenging MINLP, we reformulate the MINLP as a minimum weight perfect matching problem to get the initial solution without considering the PRPC. On this basis, a power-aware greedy algorithm is further devised to modify the solution such that the PRPC is satisfied. Finally, extensive simulations show the superiority of the proposed scheme on system power saving and the tradeoff between transmit power and processing power.
AB - Cloud radio access network (C-RAN), regarded as a promising green network architecture, facilitates cooperative transmission among remote radio heads (RRHs) while enabling flexible computation provisioning in the virtualized baseband unit pool. By jointly optimizing cooperative transmission, i.e., transmit power allocation with zero-forcing precoding adopted, and computation provisioning, i.e., virtual machine assignment, this paper minimizes the system power consumption comprised of transmit power and processing power in downlink C-RAN. Specifically, subject to per-RRH power constraint (PRPC) and per-MU quality of service constraint, the system power consumption minimization problem is formulated as a mixed integer nonlinear programming (MINLP) problem. To solve the challenging MINLP, we reformulate the MINLP as a minimum weight perfect matching problem to get the initial solution without considering the PRPC. On this basis, a power-aware greedy algorithm is further devised to modify the solution such that the PRPC is satisfied. Finally, extensive simulations show the superiority of the proposed scheme on system power saving and the tradeoff between transmit power and processing power.
UR - https://www.scopus.com/pages/publications/84981332502
U2 - 10.1109/ICC.2016.7511262
DO - 10.1109/ICC.2016.7511262
M3 - 会议稿件
AN - SCOPUS:84981332502
T3 - 2016 IEEE International Conference on Communications, ICC 2016
BT - 2016 IEEE International Conference on Communications, ICC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Conference on Communications, ICC 2016
Y2 - 22 May 2016 through 27 May 2016
ER -