Dynamic Computation Offloading in Ultra-Dense Networks Based on Mean Field Games

Renjun Zheng, Haibo Wang, Matthieu De Mari, Miao Cui, Xiaoli Chu, Tony Q.S. Quek

研究成果: Article同行評審

摘要

In ultra-dense networks, the increasing popularity of computation intensive applications imposes challenges to the resource-constrained smart mobile devices (SMDs), which may be solved by offloading these computation tasks to the nearby mobile edge computing centers. However, when massive SMDs offload computation tasks in a dynamic wireless environment simultaneously, the joint optimization of their offloading decisions becomes prohibitively complex. In this paper, we firstly model the joint optimization problem as a multi-user non-cooperative dynamic stochastic game, then propose a mean field game based algorithm to solve it with a drastically reduced complexity. We derive the two partial differential equations ruling the optimal strategies of the mean field game, namely the Hamilton-Jacobi-Bellman and Fokker-Planck-Kolmogorov equations, which are solved in an iterative manner in our proposed algorithm. Numerical results demonstrate that the proposed mean field game-based offloading algorithm requires a lower cumulated cost than the conventional strategies under the latency constraints of computation tasks, with perfect prediction of future channel states. It also appears that the performance of the mean field game-based offloading strategy depends on the accuracy of the future channel knowledge provided to the system, as the uncertainty may compromise its cumulated cost performance.

原文English
頁(從 - 到)6551-6565
頁數15
期刊IEEE Transactions on Wireless Communications
20
發行號10
DOIs
出版狀態Published - 2021 十月 1

All Science Journal Classification (ASJC) codes

  • 電腦科學應用
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「Dynamic Computation Offloading in Ultra-Dense Networks Based on Mean Field Games」主題。共同形成了獨特的指紋。

引用此