.png){kind=icon}
.png){kind=icon}
Return
Dynamic Computation Offloading Based on Graph Partitioning in Mobile Edge Computing
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2960887.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Mobile edge computing
offloading decision
node clustering
optimal strategy
Nash equilibrium
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.