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

作     者：XIA Xu HUANG Jianhua ZHENG Hong TANG Ruicong XIA Xu;HUANG Jianhua;ZHENG Hong;TANG Ruicong

作者机构：East China University of Science and Technology 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2021年第30卷第2期

页      面：367-377页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0804[工学-仪器科学与技术] 080402[工学-测试计量技术及仪器] 0701[理学-数学] 

基　　金：supported by the National Science Foundation of China(No.61472139) the Shanghai Science and Technology Commission (No.11511504403) 

主　　题：Blockchain Consensus algorithm Game theory Directed acyc1ic graph (DAG) 

摘      要：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 Io T blockchain uses the Directed acyc1 ic 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 Io T blockchain.