RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy.

Saved in:
Bibliographic Details
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.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 187091451
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhu%2C+Xutong%22">Zhu, Xutong</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<i> zhuxutong@mail.hfut.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Hu%2C+Xiaoxuan%22">Hu, Xiaoxuan</searchLink><relatesTo>1,2,3</relatesTo> (AUTHOR)<i> xiaoxuanhu@hfut.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Zhu%2C+Waiming%22">Zhu, Waiming</searchLink><relatesTo>1,3</relatesTo> (AUTHOR)<i> zhuwaiming@hfut.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Arabian+Journal+for+Science+%26+Engineering+%28Springer+Science+%26+Business+Media+B%2EV%2E+%29%22">Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. )</searchLink>. Aug2025, Vol. 50 Issue 15, p11837-11850. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Fault-tolerant+computing%22">Fault-tolerant computing</searchLink><br /><searchLink fieldCode="DE" term="%22Consensus+%28Social+sciences%29%22">Consensus (Social sciences)</searchLink><br /><searchLink fieldCode="DE" term="%22Network+performance%22">Network performance</searchLink><br /><searchLink fieldCode="DE" term="%22Smart+power+grids%22">Smart power grids</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+of+things%22">Internet of things</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=187091451
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s13369-024-09614-1
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 11837
    Subjects:
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Fault-tolerant computing
        Type: general
      – SubjectFull: Consensus (Social sciences)
        Type: general
      – SubjectFull: Network performance
        Type: general
      – SubjectFull: Smart power grids
        Type: general
      – SubjectFull: Internet of things
        Type: general
    Titles:
      – TitleFull: RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhu, Xutong
      – PersonEntity:
          Name:
            NameFull: Hu, Xiaoxuan
      – PersonEntity:
          Name:
            NameFull: Zhu, Waiming
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 2193567X
          Numbering:
            – Type: volume
              Value: 50
            – Type: issue
              Value: 15
          Titles:
            – TitleFull: Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. )
              Type: main
ResultId 1