You can view the full text of this article for free using the link below.

Title: Adaptive practical Byzantine fault tolerance consensus algorithm in permission blockchain network

Authors: G. Indra Navaroj; E. Golden Julie; Y. Harold Robinson

Addresses: Department of Information Technology, Jayaraj Annapackiam CSI College of Engineering, India ' Department of Computer Science and Engineering, Anna University Regional Campus, Tirunelveli, India ' School of Information Technology and Engineering, Vellore Institute of Technology, Vellore, India

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.

Keywords: blockchain trust node; fault node; Byzantine; practical Byzantine.

DOI: 10.1504/IJWGS.2022.10042203

International Journal of Web and Grid Services, 2022 Vol.18 No.1, pp.62 - 82

Received: 27 Jan 2021
Accepted: 21 Mar 2021

Published online: 30 Nov 2021 *

Full-text access for editors Access for subscribers Free access Comment on this article