Improved Scheme of Practical Byzantine Fault Tolerance Algorithm based on Voting Mechanism
Zhongxian Chen, Minsheng Tan, Peiliang Lei · 2022 IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA) · 2022
With the continuous development of cryptocurrencies, blockchain technology has received extensive attention, and the performance of blockchain systems is constrained by consensus algorithms. In view of the problems of high communication complexity and complex consensus process in PBFT algorithm, this paper An improvement scheme of the PBFT algorithm based on the voting mechanism is proposed. Before running the consensus protocol, the nodes in the network vote to generate a set of consensus nodes, and the remaining nodes are used as accounting nodes. At the same time, the consensus process of the traditional PBFT consensus algorithm is optimized. In the improvement scheme, the master node sends a Commit message to the consensus node and the accounting node to enter the Commit state. When the master node down, the consensus node with the highest number of votes is selected as the new master node, which reduces the probability of malicious nodes becoming master nodes and improves the system stability. The experimental results show that the improved scheme proposed in this paper reduces the communication overhead in the consensus process to a certain extent, also improves the consensus delay and throughput.