文献类型：期刊文献

英文题名：An Optimal Stability Matching Algorithm for DAG Blockchain Based on Matching Theory

作者：Xu Xia[1];Jianhua Huang[1];Hong Zheng[1];Ruicong Tang[2]

机构：[1]East China Univ Sci & Technol, Shanghai 200237, Peoples R China;[2]Hong Kong DAEX Blockchain Ltd, Hong Kong 999077, Peoples R China

年份：2021

卷号：30

期号：2

起止页码：367

外文期刊名：CHINESE JOURNAL OF ELECTRONICS

收录：;EI(收录号：20213010678486);WOS:【SCI-EXPANDED(收录号:WOS:000639915000020)】；

基金：This work is supported by the National Science Foundation of China (No.61472139) and 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 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.