In response to the issues of high communication overhead random primary node selection and the absence of incentive mechanisms in the three-stage process of PBFT consensus algorithm, as well as problems with, this paper introduced a new grouped consensus algorithm named DS-PBFT. Firstly, this paper optimized the consensus protocol simplified of the three-phase communication process, thereby enhancing consensus efficiency. Secondly, this paper proposed a node scoring and grouping mechanism, where nodes received scores based on their historical behavior during the consensus process and fell into consensus and candidate groups, reducing the likelihood of malicious node participation. Lastly, this paper introduced a dynamic process for selecting nodes to participate in consensus, optimized view-change protocols and garbage collection mechanisms to fundamentally reduce the number of participating nodes, resulting in enhanced consensus efficiency. Using Docker containers to simulate multiple nodes, the experimental results show that in a consortium blockchain with network stability and a significant number of trusted nodes, the proposed DS-PBFT consensus algorithm outperforms the PBFT consensus algorithm and other improved algorithms in terms of consensus latency, throughput, fault tolerance, and communication complexity. It can quickly achieve consensus and improve consensus efficiency.

[2023-11-01] Accepted Paper /doc/2023.07.0348/v1

[2024-04-05] Printed Article /doc/2023.07.0348/v2