The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Resource Allocation for Ultra-Dense Networks: A Survey, Some Research Issues and Challenges
Abstract
Driven by the explosive data traffic and new quality of service requirement of mobile users, the communication industry has been experiencing a new evolution by means of network infrastructure densification. With the increase of the density as well as the variety of access points (APs), the network benefits from proximal transmissions and increased spatial reuse of system resources, thus introducing a new paradigm named ultra-dense networks (UDNs). Since the limited available resources are shared by ubiquitous APs in UDNs, the demand for efficient resource allocation schemes becomes even more compelling. However, the large scale of UDNs impedes the exploration of effective resource allocation approaches particularly on the computational complexity and significance overhead or feedback. In this paper, we provide a survey-style introduction to resource allocation approaches in UDNs. Specifically, we first present some common scenarios of UDNs with the relevant special issues. Second, we provide a taxonomy to classify the resource allocation methods in the existing literatures. Then, to alleviate the main difficulties of UDNs, some prevailing and feasible solutions are elaborated. Next, we present some emerging technologies thriving UDNs with special RA features discussed. Additionally, the challenges and open research directions are outlined in this field.
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
Dynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
Exploiting Massive D2D Collaboration for Energy-Efficient Mobile Edge Computing
Chen, X., Pu, L., Gao, L., Wu, W., & Wu, D. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600321 · Cited by 239
Spectral and energy efficiency of ultra-dense networks under different deployment strategies
Yunas, S., Valkama, M., & Niemelä, J. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7010521 · Cited by 209
Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
Shi, Y., Zhang, J., O'Donoghue, B., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2443731 · Cited by 118
Cited by
Pham, Q.-V., Fang, F., Ha, V. N., Piran, M. J., Le, M., Le, L. B., Hwang, W.-J., & Ding, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3001277 · Cited by 870
A Survey on Space-Air-Ground-Sea Integrated Network Security in 6G
Guo, H., Li, J., Liu, J., Tian, N., & Kato, N. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3131332 · Cited by 529
Whale Optimization Algorithm With Applications to Resource Allocation in Wireless Networks
Pham, Q.-V., Mirjalili, S., Kumar, N., Alazab, M., & Hwang, W.-J. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2973294 · Cited by 345
Agarwal, B., Togou, M. A., Ruffini, M., & Muntean, G.-M. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3207967 · Cited by 123
Sharma, N., & Kumar, K. (2021) · Physical Communication · doi:10.1016/j.phycom.2021.101415 · Cited by 75
Metadata
- Authors
- Teng, Y., Liu, M., Yu, F. R., Leung, V. C. M., Song, M., & Zhang, Y.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2019
- Volume
- 21
- Issue
- 3
- Pages
- 2134-2168
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W2888982783
- Cited by
- 190
- References
- 5
- FWCI
- 8.00
- Type
- journal article
- Language
- en
- Open access
- closed
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.