UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Delay-limited Computation Offloading for MEC-assisted Mobile Blockchain Networks

Zuo, Y; Jin, S; Zhang, S; Han, Y; Wong, KK; (2021) Delay-limited Computation Offloading for MEC-assisted Mobile Blockchain Networks. IEEE Transactions on Communications 10.1109/TCOMM.2021.3113390. Green open access

[thumbnail of Delay-limited Computation Offloading_v4.0.pdf]
Preview
Text
Delay-limited Computation Offloading_v4.0.pdf - Accepted Version

Download (819kB) | Preview

Abstract

The proof-of-work (PoW) mining process requires a large amount of intensive computing, which leads to some plights such as heavy equipment and fixed access nodes in traditional blockchain networks. A novel mobile blockchain network with the help of a mobile edge computing (MEC) server is presented, where all mobile users participate in the PoW mining process. The traditional Bitcoin network adjusts the target difficulty value to ensure a stable block time. However, for MEC-assisted mobile blockchain networks, the adjusted difficulty value needs to be broadcast to all mobile users, which results in expensive communication costs. To maintain a stable block time of mobile blockchain networks, we formulate the delay-limited computation offloading strategy of the PoW-based mining task as a non-cooperative game that maximizes an individual revenue in the MEC-assisted mobile blockchain network. Specifically, the non-cooperative game problem can be divided into multiple sub-game optimization problems to obtain final solutions for all users. We analyze the sub-game optimization problem and prove the existence of Nash equilibrium (NE) of the non-cooperative game. Moreover, we design an alternating iterative algorithm based on the continuous relaxation and greedy rounding (CRGR) to achieve the NE of this game. Given the sub-optimal delay-limited computation offloading results, we also derive the optimal transmit power for an individual user within the maximum mining delay range. From the analytical results, we can see that the proposed CRGR-based alternating iterative algorithm can efficiently attain the sub-optimal delay-limited computation offloading strategies of all mobile users in the polynomial time. The individual transmit power increases accordingly with the delay-limited computation offloading strategies of all users. Numerical results demonstrate that the proposed CRGR-based alternating iterative algorithm has fast convergence and good stability.

Type: Article
Title: Delay-limited Computation Offloading for MEC-assisted Mobile Blockchain Networks
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/TCOMM.2021.3113390
Publisher version: http://dx.doi.org/10.1109/TCOMM.2021.3113390
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Blockchains , Delays, Task analysis, Servers, Games, Resource management, Iterative methods
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng
URI: https://discovery.ucl.ac.uk/id/eprint/10135331
Downloads since deposit
209Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item