Shapley Value-Based Computation Offloading for Edge Computing

Abstract

For wireless communications and the Internet of Things, edge computing has emerged as the potential solution to meet users’ demand of fast communications and effective computation by allocating computing resources closer to users and tasks, and then reducing the process time and avoiding the transmission of huge amount of data. However, to achieve the potential of edge computing, an effective computation offloading scheme is a key issue needed to be addressed, because it determines how efficient the computing resource allocation and the whole network performance are. Toward providing a solution to such an important issue, this paper formulates the offloading problem as a cooperation game problem about how to share the reasonably adjacent computing resource to users to form an efficient coalition network for the best performance, and then proposes a Shapley value-based computation offloading approach. The proposed approach includes three main steps: Firstly, following the principle of edge computing (users to be close to resources) and reducing the complexity, a clustering algorithm is proposed to divide the whole network into clusters and each cluster has one edge node. Then the non-linear programming is implemented in each cluster and neighboring two or three clusters respectively
to obtain the delay values and task allocation results. Finally, to check whether cooperation and coalition among neighboring clusters can bring better network performance, Shapley value is used to evaluate whether combining neighboring clusters in edge computing for the first time. The objective values obtained from
the non-linear programming are used to evaluate the profit of different coalitions, which are used to compute Shapley values to determine the final best coalitions between clusters. The numerical results show the effectiveness of the proposed method.

Index Terms—Edge computing, computation offloading, non-linear programming, Shapley value.