A Hierarchy Byzantine Fault Tolerance Consensus Protocol Based on Node Reputation

被引:11
|
作者
Wang, Xixi [1 ]
Guan, Yepeng [1 ,2 ]
机构
[1] Shanghai Univ, Sch Commun & Informat Engn, Shanghai 200444, Peoples R China
[2] Minist Educ, Key Lab Adv Display & Syst Applicat, Shanghai 200072, Peoples R China
基金
国家重点研发计划;
关键词
consensus protocol; reputation model; hierarchy structure; random selection mechanism; BLOCKCHAIN NETWORKS; SCHEME;
D O I
10.3390/s22155887
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
A blockchain has been applied in many areas, such as cryptocurrency, smart cities and digital finance. The consensus protocol is the core part of the blockchain network, which addresses the problem of transaction consistency among the involved participants. However, the scalability, efficiency and security of the consensus protocol are greatly restricted with the increasing number of nodes. A Hierarchy Byzantine Fault Tolerance consensus protocol (HBFT) based on node reputation has been proposed. The two-layer hierarchy structure is designed to improve the scalability by assigning nodes to different layers. Each node only needs to exchange messages within its group, which deducts the communication complexity between nodes. Specifically, a reputation model is proposed to distinguish normal nodes from malicious ones by a punish and reward mechanism. It is applied to ensure that the malicious node merely existing in the bottom layer and the communication complexity in the high layer can be further lowered. Finally, a random selection mechanism is applied in the selection of the leader node. The mechanism can ensure the security of the blockchain network with the characteristics of unpredictability and randomicity. Some experimental results demonstrated that the proposed consensus protocol has excellent performance in comparison to some state-of-the-art models.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Joint Reputation Based Grouping and Hierarchical Byzantine Fault Tolerance Consensus Protocol
    Qin, Hao
    Guan, Yepeng
    IEEE ACCESS, 2023, 11 : 90335 - 90344
  • [2] Practical Byzantine fault tolerance consensus based on comprehensive reputation
    Qi, Jiamou
    Guan, Yepeng
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2023, 16 (01) : 420 - 430
  • [3] Practical Byzantine fault tolerance consensus based on comprehensive reputation
    Jiamou Qi
    Yepeng Guan
    Peer-to-Peer Networking and Applications, 2023, 16 : 420 - 430
  • [4] Workload-based randomization byzantine fault tolerance consensus protocol
    Huang, Baohua
    Peng, Li
    Zhao, Weihong
    Chen, Ningjiang
    HIGH-CONFIDENCE COMPUTING, 2022, 2 (03):
  • [5] A hierarchical byzantine fault tolerance consensus protocol for the Internet of Things
    Guo, Rongxin
    Guo, Zhenping
    Lin, Zerui
    Jiang, Wenxian
    HIGH-CONFIDENCE COMPUTING, 2024, 4 (03):
  • [6] High-Performance Asynchronous Byzantine Fault Tolerance Consensus Protocol
    Knudsen, Henrik
    Li, Jingyue
    Notland, Jakob Svennevik
    Haro, Peter Halland
    Raeder, Truls Bakkejord
    2021 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN (BLOCKCHAIN 2021), 2021, : 476 - 483
  • [7] Byzantine Fault-Tolerance Consensus Algorithm Based on
    Li, Shuzhi
    Xiong, Weizhi
    Deng, Xiaohong
    Wang, Zhiqiang
    Liu, Hunwen
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2023, 45 (07) : 2484 - 2493
  • [8] DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains
    Zhan, Yu
    Wang, Baocang
    Lu, Rongxing
    Yu, Yong
    INFORMATION SCIENCES, 2021, 559 : 8 - 21
  • [9] LRBFT: Improvement of practical Byzantine fault tolerance consensus protocol for blockchains based on Lagrange interpolation
    Zhen-Fei Wang
    Yong-Wang Ren
    Zhong-Ya Cao
    Li-Ying Zhang
    Peer-to-Peer Networking and Applications, 2023, 16 : 690 - 708
  • [10] LRBFT: Improvement of practical Byzantine fault tolerance consensus protocol for blockchains based on Lagrange interpolation
    Wang, Zhen-Fei
    Ren, Yong-Wang
    Cao, Zhong-Ya
    Zhang, Li-Ying
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2023, 16 (02) : 690 - 708