CoChat

Smoothed -Minimization for Green Cloud-RAN With User Admission Control

Shi, Yuanming, Cheng, Jinkun, Zhang, Jun, Bai, Bo, Chen, Wei, Letaief, Khaled B. · 2016 · IEEE Journal on Selected Areas in Communications

The DOI matches its Crossref record; 56 of the 57 references it cites were found in a registry or an index.

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 (02algorithm is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the relaxed smoothed ℓp-minimization problem from the SDR technique. We…

Overview

Integrity signals

Registry

Crossref · 10.1109/jsac.2016.2544578

Cites

56 of 56 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 56 references

Cited by

Metadata

Authors
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B.
Affiliations
  • ShanghaiTech University (CN)
  • Tsinghua University (CN)
  • Hong Kong University of Science and Technology (HK)
Venue
IEEE Journal on Selected Areas in Communications
Published
2016-04
Volume
34
Issue
4
Pages
1022-1036
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2212194410
Cited by
70
References
57
Citations by year
2026: 2 · 2025: 1 · 2024: 2 · 2023: 6 · 2022: 3 · 2021: 10 · 2020: 10 · 2019: 8 · 2018: 8 · 2017: 14 · 2016: 6
FWCI
5.54
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Journal on Selected Areas in Communications (publishedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
Funders
  • 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)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
Keywords
cloud radio access network, user admission control, green communication, sparse optimization, multicast beamforming, energy efficiency, 5G, Karush-Kuhn-Tucker conditions, semidefinite relaxation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.