Adaptive practical Byzantine fault tolerance consensus algorithm in permission blockchain network. (25th October 2021)

• Record Type: Journal Article
• Authors: Navaroj, G. Indra; Julie, E. Golden; Robinson, Y. Harold
• Is Part Of: International journal of web and grid services. Volume 18:Number 1(2022)
• Page Start: 62
• Page End: 82
• Publication Date: 2021-10-25
• Subjects: blockchain trust node -- fault node -- Byzantine -- practical Byzantine; Web services -- Periodicals; Computational grids (Computer systems) -- Periodicals; 006.78
• Languages: English
• ISSNs: 1741-1106

Abstract

Blockchain is a distributed ledger or data structure. Combined with many other technologies, it uses the internet of things, cloud computing, artificial intelligence, big data, and machine learning. Several industries, especially governments, have employed blockchain technology to overcome a variety of security challenges. Blockchain focuses on double-spending and distributed consensus. However, blockchain networks are inefficient and scalable. Communication overhead occurs due to many replications. This paper proposes an adaptive practical Byzantine fault tolerance algorithm in permission blockchains. This method divides the node into trust nodes and faulty nodes. The nodes with faulty reputations are excluded from voting. Also, the identified trust node has a high reputation in the consensus process. A majority of voting values select the master node. This adaptive PBFT algorithm is excellent for long-term periodicity and increased scalability, and lower overall communication costs. Finally, the performance of adaptive PBFT is compared to other algorithms.