Three‐stage auction scheme for computation offloading on mobile blockchain with edge computing. (7th August 2022)

• Record Type: Journal Article
• Authors: Xia, Chengpeng; Wu, Yalan; Chen, Long; Chen, Yawen; Wu, Jigang
• Is Part Of: Concurrency and computation. Volume 34:Number 25(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2022-08-07
• Subjects: auction -- edge computing -- mobile blockchain -- resource allocation; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.7253
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Blockchain has been applied in wide range of fields to guarantee security. However, it has been very challenging for blockchain to flourish in mobile environment with limited resources. Existing studies mainly assume that single mobile user can buy the whole resources from edge servers in mobile blockchain. This paper formulates the problem of maximizing the social welfare for computation offloading in mobile blockchain. A three‐stage auction scheme with approximation ratio of ( 1 − ϵ ) $$ \left(1-\epsilon \right) $$ based on group‐buying mechanism is proposed to allocate edge server resources for mobile blockchain applications. In the first stage, the miners are divided into groups, and a Vickrey–Clarke–Groves based auction is proposed to determine the bid of each group for each edge server. In the second stage, a matching algorithm is proposed to match edge servers and Access Points for maximizing the profit of edge servers. In the third stage, the edge server resources are allocated to mobile users for mining base on the results in the above stages. We prove that our auction scheme guarantees truthfulness, individual rationality and budget balance. Simulation results show that, the social welfare of our scheme is improved by 33.78%, 21.84%, 19.69%, and 6.69% for 1000 miners, compared with the existing works.