An Improved PBFT Consensus Algorithm Based on a Comprehensive Efficiency Model
With the continuous development of blockchain technology, it plays an increasingly important role in providing secure and reliable data storage, enhancing data security and transparency, which makes it applicable in areas such as port data security. Among these, consensus algorithms are key to ensuring data consistency in blockchain networks. Currently, one of the most widely used consensus algorithms is Practical Byzan- tine Fault Tolerance (PBFT). However, PBFT faces challenges such as high communication complexity, low consensus efficiency, and performance bottlenecks. To address these issues, this paper proposes an improved PBFT consensus algorithm based on a comprehensive efficiency model (MBFT). First, the traditional single-leader node model is replaced by a multiagent node model, optimizing the consensus process, improving fault tolerance, and reducing communication complexity. Second, the comprehensive efficiency model is introduced, utilizing the TOPSIS algorithm to select efficient consensus nodes and the K-medoids algorithm to provide optimized sharding solutions for these nodes. Finally, theoretical analysis and experimental results demonstrate that the MBFT algorithm achieves substantial performance improve- ments.
Authors
- Junwei Yan
- Hu Zhang (ORCID: https://orcid.org/0000-0002-6894-0926)
- Jianjun Bai (ORCID: https://orcid.org/0000-0002-2418-9683)
Institutions
- Wuhan University of Technology (CN)
Publication Details
- Published
- 2024-11-20
- DOI
- https://doi.org/10.1109/dsins64146.2024.10992216
- Primary Topic
- Service-Oriented Architecture and Web Services
- Type
- article
- Field-Weighted Citation Impact
- 0.00