The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Energy Efficiency of Downlink Transmission Strategies for Cloud Radio Access Networks
Open accessAbstract
This paper studies the energy efficiency of the cloud radio access network (C-RAN), specifically focusing on two fundamental and different downlink transmission strategies, namely the data-sharing strategy and the compression strategy. In the data-sharing strategy, the backhaul links connecting the central processor (CP) and the base-stations (BSs) are used to carry user messages-each user's messages are sent to multiple BSs; the BSs locally form the beamforming vectors then cooperatively transmit the messages to the user. In the compression strategy, the user messages are precoded centrally at the CP, which forwards a compressed version of the analog beamformed signals to the BSs for cooperative transmission. This paper compares the energy efficiencies of the two strategies by formulating an optimization problem of minimizing the total network power consumption subject to user target rate constraints, where the total network power includes the BS transmission power, BS activation power, and load-dependent backhaul power. To tackle the discrete and nonconvex nature of the optimization problems, we utilize the techniques of reweighted ℓ1minimization and successive convex approximation to devise provably convergent algorithms. Our main finding is that both the optimized data-sharing and compression strategies in C-RAN achieve much higher energy efficiency as compared to the nonoptimized coordinated multipoint transmission, but their comparative effectiveness in energy saving depends on the user target rate. At low user target rate, data-sharing consumes less total power than compression; however, as the user target rate increases, the backhaul power consumption for data-sharing increases significantly leading to better energy efficiency of compression at the high user rate regime.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
Cited by
On the Total Energy Efficiency of Cell-Free Massive MIMO
Ngo, H. Q., Tran, L.-N., Duong, T. Q., Matthaiou, M., & Larsson, E. G. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2770215 · Cited by 863
A Survey of Energy-Efficient Techniques for 5G Networks and Challenges Ahead
Buzzi, S., I, C.-L., Klein, T. E., Poor, H. V., Yang, C., & Zappone, A. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2550338 · Cited by 721
User-Centric Cell-Free Massive MIMO Networks: A Survey of Opportunities, Challenges and Solutions
Ammar, H. A., Adve, R., Shahbazpanahi, S., Boudreau, G., & Srinivas, K. V. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3135119 · Cited by 460
Energy Efficient Resource Allocation in UAV-Enabled Mobile Edge Computing Networks
Yang, Z., Pan, C., Wang, K., & Shikh-Bahaei, M. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2927313 · Cited by 451
A deep reinforcement learning based framework for power-efficient resource allocation in cloud RANs
Xu, Z., Wang, Y., Tang, J., Wang, J., & Gursoy, M. C. (2017) · 2017 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2017.7997286 · Cited by 262
Metadata
- Authors
- Dai, B., & Yu, W.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2016-04
- Volume
- 34
- Issue
- 4
- Pages
- 1037-1050
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2226827734
- Cited by
- 244
- References
- 1
- FWCI
- 19.21
- Type
- journal article
- Language
- en
- Open access
- green
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.