An Optimal Stability Matching Algorithm for DAG Blockchain Based on Matching Theory

• 作者: XIA Xu HUANG Jianhua ZHENG Hong TANG Ruicong
• 来源期刊: 电子学报（英文版）
• 年，卷（期）: 2021,（2）
• 所属期刊栏目: TELECOMMUNICATIONS
• 页码范围: 367-377
• 页数: 11页
• 语种: 英文
• DOI: 10.1049/cje.2021.01.010

摘要

IOTA is a typical blockchain designed for IoT applications. The Markov chain monte carlo algorithm (MCMC) used in IOTA may lead to a large number of unverified blocks, which increases transaction delay to a certain extent. We propose a Stable matching algorithm (SMA) based on matching theory to stimulate nodes to verify blocks, thereby reducing the number of unverified blocks and the consensus delay. The structure of our IoT blockchain uses the Directed acyc1ic graph (DAG) to improve the transaction processing capability. The nodes in the network are abstracted as transaction issuers and transaction verifiers. A verification service scheduling system is used to assign transactions to the verifiers and achieve the optimal matching. We designed a trust evaluation mechanism which offers verifiers references and awards to check transactions. The simulation results show that SMA can significantly reduce the number of orphan blocks and improve the transaction throughput, which helps to improve the reliability of the IoT blockchain.