基于分片DAG区块链的拜占庭容错共识改进算法  

Improved Byzantine Fault Tolerant Consensus Algorithm Based on Sharded DAG Blockchain

作　　者：李晓辉[1] 刘晓炜 吕思婷 LI Xiaohui;LIU Xiaowei;LYU Siting(School of Telecommunication Engineering,Xidian University,Xi'an 710071,China;Guangzhou Institute of Technology,Xidian University,Guanzhou 510555,China)

机构地区：[1]西安电子科技大学通信工程学院,西安710071 [2]西安电子科技大学广州研究院,广州510555

出　　处：《北京邮电大学学报》2024年第4期105-110,共6页Journal of Beijing University of Posts and Telecommunications

摘　　要：物联网场景下,传统区块链存在扩展性不足、开销大、出块效率低等问题,引入有向无环图(DAG)的结构能够有效地提高区块链系统的并发程度,但也带来了网络负载严重和一致性难以达成等问题。针对以上问题,设计了一种结合网络分片方案的DAG区块链模型,基于此,提出了一种改进的拜占庭容错共识算法。所提算法通过社区机制发现将网络中的节点划分为多个小组,每个小组中由信任积分机制筛选出候选节点,然后使用可验证随机函数筛选出主节点,并根据聚合签名方案改进共识流程。仿真实验结果表明,所提算法能够缩短交易延迟并有效地提高系统的吞吐量。In the context of the Internet of things,traditional blockchain faces challenges such as insufficient scalability,high costs,and low block generation efficiency.The introduction of the structure of directed acyclic graph(DAG)can effectively enhance the concurrency of the blockchain system,but it also brings about problems such as heavy network load and difficult to achieve consistency.To address these issues,a DAG blockchain model combined with a network sharding scheme is designed.Based on this,an improved Byzantine fault tolerance consensus algorithm is proposed.The nodes in the network are divided into several groups through community mechanism discovery by the proposed algorithm.In each group,candidate nodes are selected through a trust scoring mechanism.Subsequently,a verifiable random function is employed to select primary nodes,followed by an enhancement of the consensus process based on an aggregated signature scheme.Simulation results demonstrate that the proposed algorithm can reduce transaction latency and effectively increase system throughput.

关 键 词：区块链 有向无环图 网络分片 拜占庭容错共识 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]