Journal article · 2017 · Open access
An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing
IEEE Access, 5, 5609–5622 · Published 1 January 2017 · DOI 10.1109/access.2017.2678102
In brief
“An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing” is a 2017 journal article by Tianze Li and 3 co-authors, published in IEEE Access. OpenAlex counts 43 citations as of 19 November 2026. It is open access: the full text is free to read at IEEE Access.
- Citations
- 43
- Most cited in
- 2020 (12)
- Field-weighted impact
- 4.16
- References
- 30
- Authors
- 4
Abstract
In this paper, an overhead-optimizing multi-device task scheduling strategy for ad-hoc-based mobile edge computing system is proposed. This task scheduling strategy takes the opportunity consumption, time delay, energy consumption, and monetary cost into account, aiming at minimizing the overhead of each mobile device. First, a system model for ad-hoc-based mobile edge computing is presented and the overhead of mobile device is analyzed. Second, the task scheduling problem is formulated as a distributed multi-device task scheduling game. Then, by constructing a potential function, the task scheduling game is proved to be a potential game, which possesses a property of finite improvement and always owns a Nash equilibrium. Next, an overhead-optimizing multi-device task scheduling algorithm is designed and the computational complexity is analyzed. Finally, simulations are conducted to evaluate the effectiveness of the proposed strategy. The results show that the proposed task scheduling strategy can effectively minimize the overhead of the mobile device and successfully complete the tasks.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Li, T., Wu, M., Zhao, M., & Wenxing, L. (2017). An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing. IEEE Access, 5, 5609–5622. https://doi.org/10.1109/access.2017.2678102
MLA 9
Li, Tianze, et al. “An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing.” IEEE Access, vol. 5, 2017, pp. 5609–5622. https://doi.org/10.1109/access.2017.2678102.
Chicago
Li, Tianze, Muqing Wu, Min Zhao, and Liao Wenxing. 2017. “An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing.” IEEE Access 5: 5609–5622. https://doi.org/10.1109/access.2017.2678102.
Harvard
Li, T. et al. (2017) ‘An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing’, IEEE Access, 5, pp. 5609–5622. doi:10.1109/access.2017.2678102.
IEEE
T. Li, M. Wu, M. Zhao, and L. Wenxing, “An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing,” IEEE Access, vol. 5, pp. 5609–5622, 2017, doi: 10.1109/access.2017.2678102.
BibTeX
@article{li2017overhead,
title = {{An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing}},
author = {Li, Tianze and Wu, Muqing and Zhao, Min and Wenxing, Liao},
journal = {IEEE Access},
year = {2017},
volume = {5},
pages = {5609--5622},
doi = {10.1109/access.2017.2678102},
url = {https://doi.org/10.1109/access.2017.2678102}
}
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 | 6 | |
| 2019 | 8 | |
| 2020 | 12 | |
| 2021 | 5 | |
| 2022 | 9 | |
| 2023 | 1 | |
| 2025 | 2 |
Its field-weighted citation impact is 4.16: it has been cited 4.16 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 scheduling
- mobile edge computing
- ad hoc networks
- potential games
- Nash equilibrium
- distributed scheduling
- energy consumption
- time delay
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?
Li, T., Wu, M., Zhao, M., & Wenxing, L. (2017). An Overhead-Optimizing Task Scheduling Strategy for Ad-hoc Based Mobile Edge Computing. IEEE Access, 5, 5609–5622. https://doi.org/10.1109/access.2017.2678102
How many times has this paper been cited?
43 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?
Tianze Li, Muqing Wu, Min Zhao, Liao Wenxing.
What is the DOI of this paper?
10.1109/access.2017.2678102, permanently at https://doi.org/10.1109/access.2017.2678102. 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.