6,034 research outputs found
-Box Optimization for Green Cloud-RAN via Network Adaptation
In this paper, we propose a reformulation for the Mixed Integer Programming
(MIP) problem into an exact and continuous model through using the -box
technique to recast the binary constraints into a box with an sphere
constraint. The reformulated problem can be tackled by a dual ascent algorithm
combined with a Majorization-Minimization (MM) method for the subproblems to
solve the network power consumption problem of the Cloud Radio Access Network
(Cloud-RAN), and which leads to solving a sequence of Difference of Convex (DC)
subproblems handled by an inexact MM algorithm. After obtaining the final
solution, we use it as the initial result of the bi-section Group Sparse
Beamforming (GSBF) algorithm to promote the group-sparsity of beamformers,
rather than using the weighted -norm. Simulation results
indicate that the new method outperforms the bi-section GSBF algorithm by
achieving smaller network power consumption, especially in sparser cases, i.e.,
Cloud-RANs with a lot of Remote Radio Heads (RRHs) but fewer users.Comment: 4 pages, 4 figure
- …