Adaptive practical Byzantine fault tolerance consensus algorithm in permission blockchain network
by G. Indra Navaroj; E. Golden Julie; Y. Harold Robinson
International Journal of Web and Grid Services (IJWGS), Vol. 18, No. 1, 2022

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.

Online publication date: Tue, 30-Nov-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com