Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain. (20th May 2022)

• Record Type: Journal Article
• Authors: Almakki, Riyad; AlSuwaidan, Lulwah; Khan, Shakir; Baig, Abdul Rauf; Baseer, Samad; Singh, Manmohan
• Other Names: Soni Mukesh Academic Editor.
• Is Part Of: Security and communication networks. Volume 2022(2022)
• Publication Date: 2022-05-20
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1155/2022/1855238
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract : A new algorithm for practical Byzantine fault tolerance (PBFT), called score-PBFT or S-PBFT, is proposed to solve the problems of high communication overhead and low algorithm efficiency. This algorithm is based on the characteristics of the consortium chain. The scoring mechanism for nodes is added. All the nodes are broken up into consensus nodes, candidate nodes, and early nodes. To make sure the consensus nodes are as reliable as possible, the nodes are changed dynamically based on how each node is behaving. Improved: the election method for the controller node has been changed. The node's score and behaviour are used as the election basis to make the algorithm more stable. In this paper, we want to improve the consensus protocol's execution process, cut down on how many nodes are involved in the consensus process, simplify it, and make it more efficient. Results show that, when compared with the PBFT algorithm, the S-PBFT algorithm has a shorter consensus delay, less communication overhead and throughput, and better consensus node reliability.