Smoothed -Minimization for Green Cloud-RAN With User Admission Control
Authors:
- 24 March 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 34 (4) , 1022-1036
Abstract
The cloud radio access network (Cloud-RAN) has recently been proposed as one of the cost-effective and energy-efficient techniques for 5G wireless networks. By moving the signal processing functionality to a single baseband unit (BBU) pool, centralized signal processing and resource allocation are enabled in cloud-RAN, thereby providing the promise of improving the energy efficiency via effective network adaptation and interference management. In this paper, we propose a holistic sparse optimization framework to design green cloud-RAN by taking into consideration the power consumption of the fronthaul links, multicast services, as well as user admission control. Specifically, we first identify the sparsity structures in the solutions of both the network power minimization and user admission control problems, which call for adaptive remote radio head (RRH) selection and user admission. However, finding the optimal sparsity structures turns out to be NP-hard, with the coupled challenges of the ℓ 0 -norm-based objective functions and the nonconvex quadratic QoS constraints due to multicast beamforming. In contrast to the previous works on convex but nonsmooth sparsity inducing approaches, e.g., the group sparse beamforming algorithm based on the mixed ℓ 1 /ℓ 2 -norm relaxation, we adopt the nonconvex but smoothed ℓ p -minimization (0 <; p ≤ 1) approach to promote sparsity in the multicast setting, thereby enabling efficient algorithm design based on the principle of the majorization-minimization (MM) algorithm and the semidefinite relaxation (SDR) technique. In particular, an iterative reweighted-ℓ 2 algorithm is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the relaxed smoothed ℓ p -minimization problem from the SDR technique. We illustrate the effectiveness of the proposed algorithms with extensive simulations for network power minimization and user admission control in multicast cloud-RAN.Keywords
All Related Versions
Funding Information
- Hong Kong Research (16200214)
- National Basic Research Program of China (2013CB336600)
- NSFC Excellent Young Investigator (61322111)
- Openning Research Funding of State Key Laboratory of Networking and Switching Technology, National Nature Science Foundation of China (NSFC) (61401249)
- Specialized Research Fund for the Doctoral Program of Higher Education (SRFDP) (20130002120001)
This publication has 46 references indexed in Scilit:
- Energy Efficient Downlink Cooperative Transmission With BS and Antenna Switching offIEEE Transactions on Wireless Communications, 2014
- Convergence and Stability of Iteratively Re-weighted Least Squares AlgorithmsIEEE Transactions on Signal Processing, 2013
- Energy Efficiency in TDMA-Based Next-Generation Passive Optical Access NetworksIEEE/ACM Transactions on Networking, 2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- A note on the complexity of L p minimizationMathematical Programming, 2011
- Lectures on Stochastic Programming2009
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Restricted isometry properties and nonconvex compressive sensingInverse Problems, 2008
- Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast GroupsIEEE Transactions on Signal Processing, 2008
- Normal/Independent Distributions and Their Applications in Robust RegressionJournal of Computational and Graphical Statistics, 1993