Distributed Task Offloading Game in Multiserver Mobile Edge Computing Networks

Shuang Chen, Ying Chen, Xin Chen and Yuemei Hu

Complexity, 2020, vol. 2020, 1-14

Abstract:

With the explosion of data traffic, mobile edge computing (MEC) has emerged to solve the problem of high time delay and energy consumption. In order to cope with a large number of computing tasks, the deployment of edge servers is increasingly intensive. Thus, server service areas overlap. We focus on mobile users in overlapping service areas and study the problem of computation offloading for these users. In this paper, we consider a multiuser offloading scenario with intensive deployment of edge servers. In addition, we divide the offloading process into two stages, namely, data transmission and computation execution, in which channel interference and resource preemption are considered, respectively. We apply the noncooperative game method to model and prove the existence of Nash equilibrium (NE). The real-time update computation offloading algorithm (RUCO) is proposed to obtain equilibrium offloading strategies. Due to the high complexity of the RUCO algorithm, the multiuser probabilistic offloading decision (MPOD) algorithm is proposed to improve this problem. We evaluate the performance of the MPOD algorithm through experiments. The experimental results show that the MPOD algorithm can converge after a limited number of iterations and can obtain the offloading strategy with lower cost.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/7016307.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/7016307.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:7016307

DOI: 10.1155/2020/7016307

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().