A hierarchical byzantine fault tolerance consensus protocol for the Internet of Things

• Published in: High-Confidence Computing Vol. 4; no. 3; p. 100196
• Main Authors: Guo, Rongxin, Guo, Zhenping, Lin, Zerui, Jiang, Wenxian
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2024; Elsevier
• Subjects: Clustering; Hierarchical consensus; IoT; Practical byzantine fault tolerance; Reputation evaluation model; Practical byzantine fault tolerance; Reputation evaluation model; Clustering; Hierarchical consensus; IoT
• ISSN: 2667-2952; 2667-2952
• DOI: 10.1016/j.hcc.2023.100196

The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development. To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance (PBFT) in IoT scenarios, a hierarchical consensus protocol called DCBFT is proposed. Above all, we propose an improved k-sums algorithm to build a two-level consensus cluster, achieving an hierarchical management for IoT devices. Next, A scalable two-level consensus protocol is proposed, which uses a multi-primary node mechanism to solve the single-point-of-failure problem. In addition, a data synchronization process is introduced to ensure the consistency of block data after view changes. Finally, A dynamic reputation evaluation model is introduced to update the nodes’ reputation values and complete the rotation of consensus nodes at the end of each consensus round. The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency. Moreover, After running for some time, the performance of DCBFT shows some improvement.