Back to Search Start Over

Blockchain efficient Byzantine fault tolerance consensus algorithm for IIoT.

Authors :
LI Fengqi
SONG Qingqing
XU Hui
DU Xuefeng
GAO Jialong
TONG Ning
WANG Deguang
Source :
Journal on Communication / Tongxin Xuebao; May2024, Vol. 45 Issue 5, p165-177, 13p
Publication Year :
2024

Abstract

Considering the malicious risks associated with diverse terminals in the industrial Internet of things (IIoT), a practical Byzantine fault tolerant (PBFT) efficient consensus algorithm based on credit score and dynamic double layer (CD-PBFT) was proposed to meet the requirements of high efficiency and security fault tolerance in the consensus process. The participation of good nodes in the consensus and the removal of faulty nodes were ensured by the credit score model. The parallelism of transaction verification and read write operations was achieved through the implementation of a double layer architecture. Nodes with high credit were randomly selected as the master node by the adaptive master node algorithm, ensuring its security. Experimental results show that CD-PBFT not only can maintain the safety and liveness of the consensus algorithm but also can reduce network delay by 34.8% and increase throughput by 25.2% compared with PBFT, which meets the double requirements of efficiency and security fault tolerance. [ABSTRACT FROM AUTHOR]

Details

Language :
Chinese
ISSN :
1000436X
Volume :
45
Issue :
5
Database :
Complementary Index
Journal :
Journal on Communication / Tongxin Xuebao
Publication Type :
Academic Journal
Accession number :
178325007
Full Text :
https://doi.org/10.11959/j.issn.1000-436x.2024090