Journal article · 2020 · Open access
Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks
IEEE Transactions on Communications, 68(12), 7867–7881 · Published 28 August 2020 · DOI 10.1109/tcomm.2020.3020068
In brief
“Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks” is a 2020 journal article by Fang Fang and 5 co-authors, published in IEEE Transactions on Communications. OpenAlex counts 224 citations as of 19 November 2026, which puts it in the top 3% of works published in 2020 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 224
- Most cited in
- 2022 (57)
- Field-weighted impact
- 13.73
- References
- 44
- Authors
- 6
Abstract
Multi-access edge computing (MEC) can enhance the computing capability of mobile devices, while non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two strategies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task delay minimization in multi-user NOMA-MEC networks, where multiple users can offload their tasks simultaneously through the same frequency band. We adopt the partial offloading policy, in which each user can partition its computation task into offloading and locally computing parts. We aim to minimize the task delay among users by optimizing their tasks partition ratios and offloading transmit power. The delay minimization problem is first formulated, and it is shown that it is a nonconvex one. By carefully investigating its structure, we transform the original problem into an equivalent quasi-convex. In this way, a bisection search iterative algorithm is proposed in order to achieve the minimum task delay. To reduce the complexity of the proposed algorithm and evaluate its optimality, we further derive closed-form expressions for the optimal task partition ratio and offloading power for the case of two-user NOMA-MEC networks. Simulations demonstrate the convergence and optimality of the proposed algorithm and the effectiveness of the closed-form analysis.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Fang, F., Xu, Y., Ding, Z., Shen, C., Peng, M., & Karagiannidis, G. K. (2020). Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks. IEEE Transactions on Communications, 68(12), 7867–7881. https://doi.org/10.1109/tcomm.2020.3020068
MLA 9
Fang, Fang, et al. “Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks.” IEEE Transactions on Communications, vol. 68, no. 12, 2020, pp. 7867–7881. https://doi.org/10.1109/tcomm.2020.3020068.
Chicago
Fang, Fang, Yanqing Xu, Zhiguo Ding, Chao Shen, Mugen Peng, and George K. Karagiannidis. 2020. “Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks.” IEEE Transactions on Communications 68 (12): 7867–7881. https://doi.org/10.1109/tcomm.2020.3020068.
Harvard
Fang, F. et al. (2020) ‘Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks’, IEEE Transactions on Communications, 68(12), pp. 7867–7881. doi:10.1109/tcomm.2020.3020068.
IEEE
F. Fang, Y. Xu, Z. Ding, C. Shen, M. Peng, and G. K. Karagiannidis, “Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks,” IEEE Transactions on Communications, vol. 68, no. 12, pp. 7867–7881, 2020, doi: 10.1109/tcomm.2020.3020068.
BibTeX
@article{fang2020optimal,
title = {{Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks}},
author = {Fang, Fang and Xu, Yanqing and Ding, Zhiguo and Shen, Chao and Peng, Mugen and Karagiannidis, George K.},
journal = {IEEE Transactions on Communications},
year = {2020},
volume = {68},
number = {12},
pages = {7867--7881},
doi = {10.1109/tcomm.2020.3020068},
url = {https://doi.org/10.1109/tcomm.2020.3020068}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2019 | 4 | |
| 2020 | 5 | |
| 2021 | 20 | |
| 2022 | 57 | |
| 2023 | 51 | |
| 2024 | 37 | |
| 2025 | 34 | |
| 2026 | 16 |
Its field-weighted citation impact is 13.73: it has been cited 13.73 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- non-orthogonal multiple access
- mobile edge computing
- task offloading
- task delay minimization
- partial offloading
- resource allocation
- quasi-convex optimization
- analytical solution
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Fang, F., Xu, Y., Ding, Z., Shen, C., Peng, M., & Karagiannidis, G. K. (2020). Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks. IEEE Transactions on Communications, 68(12), 7867–7881. https://doi.org/10.1109/tcomm.2020.3020068
How many times has this paper been cited?
224 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Fang Fang, Yanqing Xu, Zhiguo Ding, Chao Shen, Mugen Peng, George K. Karagiannidis.
What is the DOI of this paper?
10.1109/tcomm.2020.3020068, permanently at https://doi.org/10.1109/tcomm.2020.3020068. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.