Journal article · 2022 · Open access
Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph
IEEE Transactions on Wireless Communications, 22(2), 761–777 · Published 25 August 2022 · DOI 10.1109/twc.2022.3198092
In brief
“Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph” is a 2022 journal article by Mohammed S. Al-Abiad and 2 co-authors, published in IEEE Transactions on Wireless Communications. OpenAlex counts 17 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 17
- Most cited in
- 2023 (8)
- Field-weighted impact
- 1.49
- References
- 50
- Authors
- 3
Abstract
Resource allocation is investigated for offloading computational-intensive tasks in dual-hop mobile edge computing (MEC) system. The envisioned system has both the cooperative access points (APs) with the computing capability and the MEC servers. A user-device (UD), therefore, first uploads a computing task to the nearest AP, and the AP can either locally process the received task or offload to MEC server. To utilize the radio resource blocks (RRBs) in the APs efficiently, we exploit the non-orthogonal multiple access (NOMA) for offloading the tasks from the UDs to the AP(s). In order to investigate the trade-off between latency and energy consumption, this work considers minimizing a weighted-sum that consists of latency and energy consumption, subject to UDs’ rate threshold, tasks’ time-delay, computational frequency scaling, and transmit power allocation constraints. With a joint consideration of all such factors, the problem is NP-hard and its global optimal solution is computationally intractable. A graph-theoretical approach is employed to solve the problem efficiently. Specifically, a novel joint MEC graph-based approach is devised, which solves the scheduling among the UDs, APs, and RRBs, the transmit power control, and the local computational frequency scaling problem(s) jointly. The joint MEC approach achieves near-optimal performance with high computational complexity. To strike a suitable balance between the performance and computational complexity of the resource allocation, a low complexity, yet efficient, pruning graph approach is also devised. The efficiency of the proposed graph-based approaches over several benchmark schemes is verified via extensive simulations.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Al-Abiad, M. S., Hassan, M. Z., & Hossain, M. J. (2022). Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph. IEEE Transactions on Wireless Communications, 22(2), 761–777. https://doi.org/10.1109/twc.2022.3198092
MLA 9
Al-Abiad, Mohammed S., et al. “Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph.” IEEE Transactions on Wireless Communications, vol. 22, no. 2, 2022, pp. 761–777. https://doi.org/10.1109/twc.2022.3198092.
Chicago
Al-Abiad, Mohammed S., Md. Zoheb Hassan, and Md. Jahangir Hossain. 2022. “Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph.” IEEE Transactions on Wireless Communications 22 (2): 761–777. https://doi.org/10.1109/twc.2022.3198092.
Harvard
Al-Abiad, M. S., Hassan, M. Z. and Hossain, M. J. (2022) ‘Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph’, IEEE Transactions on Wireless Communications, 22(2), pp. 761–777. doi:10.1109/twc.2022.3198092.
IEEE
M. S. Al-Abiad, M. Z. Hassan, and M. J. Hossain, “Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph,” IEEE Transactions on Wireless Communications, vol. 22, no. 2, pp. 761–777, 2022, doi: 10.1109/twc.2022.3198092.
BibTeX
@article{alabiad2022task,
title = {{Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph}},
author = {Al-Abiad, Mohammed S. and Hassan, Md. Zoheb and Hossain, Md. Jahangir},
journal = {IEEE Transactions on Wireless Communications},
year = {2022},
volume = {22},
number = {2},
pages = {761--777},
doi = {10.1109/twc.2022.3198092},
url = {https://doi.org/10.1109/twc.2022.3198092}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2022 | 1 | |
| 2023 | 8 | |
| 2024 | 5 | |
| 2025 | 2 | |
| 2026 | 1 |
Its field-weighted citation impact is 1.49: it has been cited 1.49 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
- task offloading
- mobile edge computing
- non-orthogonal multiple access
- dual-hop relay
- conflict graph
- transmission power control
- energy-delay tradeoff
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?
Al-Abiad, M. S., Hassan, M. Z., & Hossain, M. J. (2022). Task Offloading Optimization in NOMA-Enabled Dual-Hop Mobile Edge Computing System Using Conflict Graph. IEEE Transactions on Wireless Communications, 22(2), 761–777. https://doi.org/10.1109/twc.2022.3198092
How many times has this paper been cited?
17 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?
Mohammed S. Al-Abiad, Md. Zoheb Hassan, Md. Jahangir Hossain.
What is the DOI of this paper?
10.1109/twc.2022.3198092, permanently at https://doi.org/10.1109/twc.2022.3198092. 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.