Abstract

Due to the limited computing and storage capabilities of IoT devices, it is difficult to meet the computing needs of the Practical Byzantine Fault Tolerance (PBFT) algorithm. And the traditional PBFT algorithm is difficult to meet the throughput required by this system due to the prolonged consensus time. In order to solve the above problems, this paper proposes an improved PBFT algorithm, First, the node roles are divided, and only the consensus node role participates in the consensus, which reduces the communication overhead in the consensus process and makes enterprises of various strengths suitable for joining the system. Secondly, a scoring mechanism is added to improve the node selection and replacement method according to the points obtained by the nodes, and effectively eliminate Byzantine nodes, select a reliable node as the master node to the greatest extent, reduce the frequency of view change, and improve the speed of node change. Finally, the execution process of the consensus protocol is optimized, the communication complexity is reduced from O(N^2) to O(N), and the overall efficiency of the system is improved.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.