Power Minimization Based Joint Task Scheduling and Resource Allocation in Downlink C-RAN
Wenchao Xia, Jun Zhang, Tony Q. S. Quek, Shi Jin, and Hongbo Zhu

TL;DR
This paper addresses the complex problem of minimizing power consumption in downlink C-RANs by jointly optimizing task scheduling and resource allocation across different time scales, introducing novel algorithms and analysis methods.
Contribution
It proposes a framework combining large system analysis and hierarchical algorithms to efficiently solve the joint power minimization problem in C-RANs.
Findings
The proposed algorithms effectively reduce power consumption.
The framework accounts for both computational and transmission power.
It demonstrates the impact of execution efficiency on network power use.
Abstract
In this paper, we consider the network power minimization problem in a downlink cloud radio access network (C-RAN), taking into account the power consumed at the baseband unit (BBU) for computation and the power consumed at the remote radio heads and fronthaul links for transmission. The power minimization problem for transmission is a fast time-scale issue whereas the power minimization problem for computation is a slow time-scale issue. Therefore, the joint network power minimization problem is a mixed time-scale problem. To tackle the time-scale challenge, we introduce large system analysis to turn the original fast time-scale problem into a slow time-scale one that only depends on the statistical channel information. In addition, we propose a bound improving branch-and-bound algorithm and a combinational algorithm to find the optimal and suboptimal solutions to the power…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
