RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy.
Saved in:
| Title: | RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy. |
|---|---|
| Authors: | Zhu, Xutong1,2 (AUTHOR) zhuxutong@mail.hfut.edu.cn, Hu, Xiaoxuan1,2,3 (AUTHOR) xiaoxuanhu@hfut.edu.cn, Zhu, Waiming1,3 (AUTHOR) zhuwaiming@hfut.edu.cn |
| Source: | Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ). Aug2025, Vol. 50 Issue 15, p11837-11850. 14p. |
| Subjects: | Scalability, Fault-tolerant computing, Consensus (Social sciences), Network performance, Smart power grids, Internet of things |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ) is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 2193567X |
| DOI: | 10.1007/s13369-024-09614-1 |
