Journal of Xidian University ›› 2024, Vol. 51 ›› Issue (6): 132-148.doi: 10.19665/j.issn1001-2400.20240902

• Computer Science and Technology & Cyberspace Security • Previous Articles     Next Articles

Algorithm for byzantine fault-tolerant consensus to support dynamic feedback decision-making

ZHAI Sheping1,2(), CAO Yongqiang1(), YANG Rui1(), ZHANG Ruiting1()   

  1. 1. School of Computer Science and Technology,Xi’an University of Posts and Telecommunications,Xi’an 710121,China
    2. Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing,Xi’an University of Posts and Telecommunications,Xi’an 710121,China
  • Received:2024-03-15 Online:2024-12-20 Published:2024-09-10
  • Contact: CAO Yongqiang E-mail:zhaisheping@xupt.edu.cn;cyq0408up@163.com;290934920@qq.com;18691729079@163.com

Abstract:

The blockchain is popular as a distributed ledger that can record encryptions,ensuring the consistency of transactions in the ledger through consensus algorithms across a network of untrusted nodes.The broadcasting process of voting-based consensus protocols requires a large number of network forwards,with a huge communication overhead that severely affects the on-chain performance.With the increase in the number of nodes,the performance deteriorates dramatically,and the scalability of large-scale nodes is severely constrained.To address the above problems,the consensus process is treated as an optimization problem,and a Byzantine fault-tolerant consensus algorithm using learning automata for voting decision is proposed.Learning automata are embedded into blockchain nodes instead of nodes to complete consensus voting-related operations,reducing the impact of malicious operations of nodes on the system.The consensus decision is made by the master node and its neighboring learning nodes,the master node gives feedback to the learning nodes based on the criterion function and the overall voting result,the learning nodes adjust their voting strategy based on the feedback,and the consensus is reached when the criterion function of the master node converges.The proposed strategy accelerates the convergence of consensus,adjusts the rules of learning automata to reduce the influence of faulty nodes,and uses the reward and punishment mechanism to improve the enthusiasm of normal nodes to participate in the consensus process and reduce the consensus delay.Experimental results show that the consensus algorithm proposed in this paper has a lower complexity compared to the existing algorithms in large-scale node scenarios,and also shows a better fault tolerance in the face of Byzantine nodes,which reduces the impact of the faulty nodes while maintaining the fast transactions and ensures the scalability and fault tolerance of large-scale node networks.

Key words: blockchain, consensus algorithm, learning automata, convergence strategy

CLC Number: 

  • TP311.1