Journal article · 2023 · Open access
A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access
IEEE Transactions on Vehicular Technology, 72(9), 12332–12337 · Published 1 September 2023 · DOI 10.1109/tvt.2023.3263791
In brief
“A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access” is a 2023 journal article by Vaibhav Kumar and 3 co-authors, published in IEEE Transactions on Vehicular Technology. OpenAlex counts 25 citations as of 19 November 2026, which puts it in the top 2% of works published in 2023 by citations. It is open access under a CC BY licence: the full text is free to read at IEEE Transactions on Vehicular Technology.
- Citations
- 25
- Most cited in
- 2025 (11)
- Field-weighted impact
- 2.15
- References
- 29
- Authors
- 4
Abstract
To mitigate the computational power gap between the network core and edges, mobile edge computing (MEC) is poised to play a fundamental role in future generations of wireless networks. In this correspondence, we consider a non-orthogonal multiple access (NOMA) transmission model to maximize the worst task to be offloaded among all users to the network edge server. A provably convergent and efficient algorithm is developed to solve the considered non-convex optimization problem for maximizing the minimum number of offloaded bits in a multi-user NOMA-MEC system. Compared to the approach of optimized orthogonal multiple access (OMA), for given MEC delay, power and energy limits, the NOMA-based system considerably outperforms its OMA-based counterpart in MEC settings. Numerical results demonstrate that the proposed algorithm for NOMA-based MEC is particularly useful for delay sensitive applications.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kumar, V., Hanif, M. F., Juntti, M. J., & Tran, L. (2023). A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access. IEEE Transactions on Vehicular Technology, 72(9), 12332–12337. https://doi.org/10.1109/tvt.2023.3263791
MLA 9
Kumar, Vaibhav, et al. “A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access.” IEEE Transactions on Vehicular Technology, vol. 72, no. 9, 2023, pp. 12332–12337. https://doi.org/10.1109/tvt.2023.3263791.
Chicago
Kumar, Vaibhav, Muhammad Fainan Hanif, Markku J. Juntti, and Le‐Nam Tran. 2023. “A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access.” IEEE Transactions on Vehicular Technology 72 (9): 12332–12337. https://doi.org/10.1109/tvt.2023.3263791.
Harvard
Kumar, V. et al. (2023) ‘A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access’, IEEE Transactions on Vehicular Technology, 72(9), pp. 12332–12337. doi:10.1109/tvt.2023.3263791.
IEEE
V. Kumar, M. F. Hanif, M. J. Juntti, and L. Tran, “A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access,” IEEE Transactions on Vehicular Technology, vol. 72, no. 9, pp. 12332–12337, 2023, doi: 10.1109/tvt.2023.3263791.
BibTeX
@article{kumar2023task,
title = {{A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access}},
author = {Kumar, Vaibhav and Hanif, Muhammad Fainan and Juntti, Markku J. and Tran, Le‐Nam},
journal = {IEEE Transactions on Vehicular Technology},
year = {2023},
volume = {72},
number = {9},
pages = {12332--12337},
doi = {10.1109/tvt.2023.3263791},
url = {https://doi.org/10.1109/tvt.2023.3263791}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 9 | |
| 2025 | 11 | |
| 2026 | 5 |
Its field-weighted citation impact is 2.15: it has been cited 2.15 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
- mobile edge computing
- non-orthogonal multiple access
- task offloading
- minimax optimization
- non-convex optimization
- convergence algorithm
- delay-sensitive applications
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?
Kumar, V., Hanif, M. F., Juntti, M. J., & Tran, L. (2023). A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access. IEEE Transactions on Vehicular Technology, 72(9), 12332–12337. https://doi.org/10.1109/tvt.2023.3263791
How many times has this paper been cited?
25 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 IEEE Transactions on Vehicular Technology: sign in and open the PDF from this page.
Who wrote this paper?
Vaibhav Kumar, Muhammad Fainan Hanif, Markku J. Juntti, Le‐Nam Tran.
What is the DOI of this paper?
10.1109/tvt.2023.3263791, permanently at https://doi.org/10.1109/tvt.2023.3263791. 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.