Journal article · 2018 · Open access
Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications
IEEE Access, 6, 12825–12837 · Published 1 January 2018 · DOI 10.1109/access.2018.2800032
In brief
“Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications” is a 2018 journal article by Jianhui Liu and Qi Zhang, published in IEEE Access. OpenAlex counts 234 citations as of 19 November 2026, which puts it in the top 2% of works published in 2018 by citations. It is open access: the full text is free to read at IEEE Access.
- Citations
- 234
- Most cited in
- 2020 (46)
- Field-weighted impact
- 19.98
- References
- 33
- Authors
- 2
Abstract
The ultra-reliable low latency communications (uRLLC) in the fifth generation mobile communication system aims to support diverse emerging applications with strict requirements of latency and reliability. Mobile edge computing (MEC) is considered as a promising solution to reduce the latency of computation-intensive tasks leveraging powerful computing units at short distance. The state-of-art work on task offloading to MEC mainly focuses on the tradeoff between latency and energy consumption, rather than reliability. In this paper, the tradeoff between the latency and reliability in task offloading to MEC is studied. A framework is provided, where user equipment partitions a task into sub-tasks and offloads them to multiple nearby edge nodes (ENs) in sequence. In this framework, we formulate an optimization problem to jointly minimize the latency and offloading failure probability. Since the formulated problem is nonconvex, we design three algorithms based on heuristic search, reformulation linearization technique and semi-definite relaxation, respectively, and solve the problem through optimizing EN candidates selection, offloading ordering and task allocation. Compared with the previous work, the numerical simulation results show that the proposed algorithms strike a good balance between the latency and reliability in uRLLC. Among them, the Heuristic Algorithm achieves the best performance in terms of the latency and reliability with the minimal complexity.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Liu, J., & Zhang, Q. (2018). Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications. IEEE Access, 6, 12825–12837. https://doi.org/10.1109/access.2018.2800032
MLA 9
Liu, Jianhui, and Qi Zhang. “Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications.” IEEE Access, vol. 6, 2018, pp. 12825–12837. https://doi.org/10.1109/access.2018.2800032.
Chicago
Liu, Jianhui and Qi Zhang. 2018. “Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications.” IEEE Access 6: 12825–12837. https://doi.org/10.1109/access.2018.2800032.
Harvard
Liu, J. and Zhang, Q. (2018) ‘Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications’, IEEE Access, 6, pp. 12825–12837. doi:10.1109/access.2018.2800032.
IEEE
J. Liu and Q. Zhang, “Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications,” IEEE Access, vol. 6, pp. 12825–12837, 2018, doi: 10.1109/access.2018.2800032.
BibTeX
@article{liu2018offloading,
title = {{Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications}},
author = {Liu, Jianhui and Zhang, Qi},
journal = {IEEE Access},
year = {2018},
volume = {6},
pages = {12825--12837},
doi = {10.1109/access.2018.2800032},
url = {https://doi.org/10.1109/access.2018.2800032}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 11 | |
| 2019 | 41 | |
| 2020 | 46 | |
| 2021 | 41 | |
| 2022 | 17 | |
| 2023 | 28 | |
| 2024 | 20 | |
| 2025 | 22 | |
| 2026 | 8 |
Its field-weighted citation impact is 19.98: it has been cited 19.98 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
- ultra-reliable low-latency communication
- task offloading
- task decomposition
- edge node selection
- task allocation
- reformulation-linearization technique
- semidefinite relaxation
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?
Liu, J., & Zhang, Q. (2018). Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications. IEEE Access, 6, 12825–12837. https://doi.org/10.1109/access.2018.2800032
How many times has this paper been cited?
234 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 Access: sign in and open the full text from this page.
Who wrote this paper?
Jianhui Liu, Qi Zhang.
What is the DOI of this paper?
10.1109/access.2018.2800032, permanently at https://doi.org/10.1109/access.2018.2800032. 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.