This paper presents a dynamic Byzantine fault-tolerant consensus algorithm based on reputation and clustering. The existing practical algorithms lack a response mechanism for joining or exiting nodes, leading to decreased consensus efficiency with a large number of nodes. To address this issue, the proposed algorithm utilizes a clustering algorithm to divide nodes into K consensus regions, improving efficiency when more nodes participate in consensus. Additionally, K reliable proxy nodes are selected based on high reputation, while low reputation nodes are eliminated to reduce the probability of Byzantine nodes becoming main nodes. The node classification process combines the reputation evaluation algorithm to select K proxy nodes, enhancing system stability and security. Simulation results demonstrate that compared to PBFT, the proposed algorithm supports dynamic node joining and exiting, with lower communication cost, transaction delay, and higher throughput. It also exhibits better fault tolerance and scalability.
WU Guangfu, YANG Zi, HUANG Baozhu
. Dynamic Byzantine Fault Tolerance Algorithm Based on Reputation and Clustering[J]. Journal of Applied Sciences, 2023
, 41(6)
: 1046
-1057
.
DOI: 10.3969/j.issn.0255-8297.2023.06.011
[1] Lamport L, Shostak R, Pease M. The Byzantine generals problem[J]. ACM Transactions on Programming Languages and Systems, 1982, 4(3):382-401.
[2] Castro M, Liskov B. Practical Byzantine fault tolerance[C]//1999 Third Symposium on Operating Systems Design and Implementation, 1999:173-186.
[3] Bodkhe U, Tanwar S, Parekh K, et al. Blockchain for industry 4.0:a comprehensive review[J]. IEEE Access, 2020, 8:79764-79800.
[4] Meng Y L, Cao Z, Qu D C. A committee-based Byzantine consensus protocol for blockchain[C]//2018 IEEE 9th International Conference on Software Engineering and Service Science (ICSESS), 2019:1-6.
[5] Pass R, Shi E. Hybrid consensus:efficient consensus in the permissionless model[C]//201731st International Symposium Distributed Computing (DISC), 2017, 39:1-39:16.
[6] 刘肖飞. 基于动态授权的拜占庭容错共识算法的区块链性能改进研究[D]. 杭州:浙江大学, 2017.
[7] Jalalzai M M, Busch C, Richard G G. Consistent BFT performance for blockchains[C]//201949th Annual IEEE/IFIP International Conference on Dependable Systems and Networks-Supplemental Volume (DSN-S), 2019:17-18.
[8] Golan Gueta G, Abraham I, Grossman S, et al. SBFT:a scalable and decentralized trust infrastructure[C]//201949th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2019:568-580.
[9] Kiayias A, Russell A. Ouroboros-BFT:a simple Byzantine fault tolerant consensus protocol[J]. IACR Cryptology ePrint Archive, 2018:1049.
[10] 李剑锋. 基于拜占庭容错机制的区块链共识算法研究与应用[D]. 郑州:郑州大学, 2018.
[11] Nakamoto S. Bitcoin:a peer-to-peer electronic cash system[EB/OL].[2022-04-07]. https://bitcoin.org/en/bitcoin-paper.
[12] Nofer M, Gomber P, Hinz O, et al. Blockchain[J]. Business & Information Systems Engineering, 2017, 59(3):183-187.
[13] Zheng Z, Xie S, Dai H N, et al. An overview on smart contracts:challenges, advances and platforms[J]. Future Generation Computer Systems, 2020, 105:475-491.
[14] Bach L M, Mihaljevic B, Zagar M. Comparative analysis of blockchain consensus algorithms[C]//201841st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 2018:1545-1550.
[15] Lepore C, Ceria M, Visconti A, et al. A survey on blockchain consensus with a performance comparison of PoW, PoS and pure PoS[J]. Mathematics, 2020, 8(10):1782.
[16] Saleh F. Blockchain without waste:proof-of-stake[J]. The Review of Financial Studies, 2021, 34(3):1156-1190.
[17] Zhao W B, Yang S K, Luo X, et al. On PeerCoin proof of stake for blockchain consensus[C]//2021 The 3rd International Conference on Blockchain Technology, 2021:129-134.
[18] Liu J, Xie M, Chen S, et al. An improved DPoS consensus mechanism in blockchain based on PLTS for the smart autonomous multi-robot system[J]. Information Sciences, 2021, 575:528-541.
[19] Fu W, Wei X F, Tong S H. An improved blockchain consensus algorithm based on raft[J]. Arabian Journal for Science and Engineering, 2021, 46(9):8137-8149.
[20] Pattabiraman V, Parvathi R, Nedunchezian R, et al. A novel spatial clustering with obstacles and facilitators constraint based on edge detection and K-medoids[C]//2009 International Conference on Computer Technology and Development. IEEE, 2009:402-406.
