Improvement of the PBFT Algorithm Based on Grouping and Reputation Value Voting

An improved practical Byzantine fault tolerance (Practical Byzantine Fault Tolerant consensus algorithm based on reputation, RPBFT) algorithm based on grouping and reputation value voting is proposed for the problems of high communication complexity, poor scalability, and random selection of master nodes of the practical Byzantine fault tolerance (PBFT) consensus algorithm of the consortium chain. First, the consistency process is optimized to take the response speed of nodes to each group leader as the basis of grouping, and the intragroup consensus is performed. The group leader then takes the result of intragroup consensus and participates in extra-group consensus to reduce the frequency and time of internode communication. Second, the reputation model and voting mechanism are proposed, and the group leader is generated by node reputation value voting, which enhances the initiative and reliability of trusted nodes and reduces the abnormal nodes as group leader. Finally, a simulation and performance testing system based on this improved scheme is built to prove the effectiveness as well as the usability of the scheme through simulation experiments. The experimental results show that when the number of network nodes is 36, the throughput of the RPBFT algorithm is six times that of PBFT. Therefore, the consensus delay is reduced by 91.7%, and the communication overhead is reduced by 37.8%.