Abstract

Blockchain, an emerging decentralized but trusted system, has been applied in many applications, such as the Internet of Things (IoT), supply chains, and smart grid. However, due to the large amount of computing and storage resources blockchain typically demands, its wide deployment is faced with the sustainability issue. To resolve this issue, a viable solution is to empower the IoT system with fog computing that can offload the computation-demanding tasks. Due to varieties of mining tasks and heterogeneous resource capabilities at fog nodes (FNs), it is not an easy task to schedule mining tasks and manages resource allocation among FNs of conflicting interests and independent IoT devices in a distributed manner. In this article, under the framework of matching theory, we design a distributed matching mechanism to maximize the social welfare of resource-restricted FNs while guaranteeing various mining requirements of FNs. Besides, we also provide formal proof regarding the convergence and computational complexity of a distributed matching algorithm (DMA). Finally, we verify that DMA not only improves the social welfare of FNs but also reduces the mining latency compared with the existing algorithms through extensive simulations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call