RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy

【Author】 Zhu, Xutong; Hu, Xiaoxuan; Zhu, Waiming

【Source】ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING

【影响因子】2.807

【Abstract】The practical Byzantine fault tolerance (PBFT) algorithm stands out as one of the most frequently employed consensus algorithms in consortium blockchains. However, due to the frequent global communication mechanism, the PBFT's communication overhead increases exponentially with the number of nodes, resulting in poor scalability. Therefore, the PBFT is typically used only in small networks. To improve the PBFT's efficiency in large-scale systems such as massive smart grids and the Internet of Things, we put forward a reputation-based PBFT algorithm with node grouping strategy (RGPBFT). Specifically, we firstly develop an improved consistency subprotocol based on node grouping strategy to improve the consensus efficiency and the scalability of the PBFT. Then, we propose a reputation-based strategy to enhance the reliability of the elected master node. The simulated test results show that the node grouping strategy could significantly improve the consensus efficiency of the PBFT, and the reputation-based strategy could reduce the impact of Byzantine nodes on the throughput and consensus latency. Overall, the test results demonstrate that the RGPBFT outperforms the PBFT in consensus latency, throughput, communication overhead, and fault tolerance. The RGPBFT exhibits high consensus efficiency in large-scale networks.

【Keywords】Practical byzantine fault tolerance; Consensus algorithm; Consortium blockchain; Node grouping; Reputation-based strategy

【发表时间】2024 2024 OCT 12

【收录时间】2024-10-17

【文献类型】实验仿真

【主题类别】

区块链技术-核心技术-共识机制