Journal article · 2019 · Open access

Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing

Guangshun Li, Qingyan Lin, Junhua Wu, Ying Zhang, Jiahe Yan

IEEE Access, 7, 185131–185139 · Published 1 January 2019 · DOI 10.1109/access.2019.2960887

Open PDFView at the publisherCite this paper

In brief

“Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing” is a 2019 journal article by Guangshun Li and 4 co-authors, published in IEEE Access. OpenAlex counts 21 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at IEEE Access.

Citations
21
Most cited in
2022 (5)
Field-weighted impact
1.27
References
34
Authors
5

Abstract

Mobile edge computing is a new cloud computing paradigm that utilizes small-sized edge clouds to provide real-time services to users. These mobile edge clouds (MECs) are located near users, thereby enabling users to seamlessly access applications that are running on MECs and to easily access MECs. Terminal devices can transfer tasks to MEC servers nearby to improve the quality of computing. In this paper, we study multi-user computation offloading problem for mobile-edge computing in a multichannel wireless interference environment. Then, we analyze the overhead of each mobile devices, and we propose strategies for task scheduling and offloading in a multi-user MEC system. For reducing the energy consumption, we propose a server partitioning algorithm that is based on clustering. We formulate the task offloading decision problem as a multi-user game, which always has a Nash equilibrium. The simulation results demonstrate that our scheme outperforms the traditional offloading strategy in terms of energy consumption.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Li, G., Lin, Q., Wu, J., Zhang, Y., & Yan, J. (2019). Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing. IEEE Access, 7, 185131–185139. https://doi.org/10.1109/access.2019.2960887

MLA 9

Li, Guangshun, et al. “Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing.” IEEE Access, vol. 7, 2019, pp. 185131–185139. https://doi.org/10.1109/access.2019.2960887.

Chicago

Li, Guangshun, Qingyan Lin, Junhua Wu, Ying Zhang, and Jiahe Yan. 2019. “Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing.” IEEE Access 7: 185131–185139. https://doi.org/10.1109/access.2019.2960887.

Harvard

Li, G. et al. (2019) ‘Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing’, IEEE Access, 7, pp. 185131–185139. doi:10.1109/access.2019.2960887.

IEEE

G. Li, Q. Lin, J. Wu, Y. Zhang, and J. Yan, “Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing,” IEEE Access, vol. 7, pp. 185131–185139, 2019, doi: 10.1109/access.2019.2960887.

BibTeX

@article{li2019dynamic,
  title     = {{Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing}},
  author    = {Li, Guangshun and Lin, Qingyan and Wu, Junhua and Zhang, Ying and Yan, Jiahe},
  journal   = {IEEE Access},
  year      = {2019},
  volume    = {7},
  pages     = {185131--185139},
  doi       = {10.1109/access.2019.2960887},
  url       = {https://doi.org/10.1109/access.2019.2960887}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202022
202144
202255
202344
202444
202511
202611

Its field-weighted citation impact is 1.27: it has been cited 1.27 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

  • computation offloading
  • mobile edge computing
  • graph partitioning
  • clustering
  • task scheduling
  • multiplayer games
  • Nash equilibrium
  • energy consumption

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Li, G., Lin, Q., Wu, J., Zhang, Y., & Yan, J. (2019). Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing. IEEE Access, 7, 185131–185139. https://doi.org/10.1109/access.2019.2960887

How many times has this paper been cited?

21 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 PDF from this page.

Who wrote this paper?

Guangshun Li, Qingyan Lin, Junhua Wu, Ying Zhang, Jiahe Yan.

What is the DOI of this paper?

10.1109/access.2019.2960887, permanently at https://doi.org/10.1109/access.2019.2960887. 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.