Practical Byzantine fault-tolerant consensus algorithm based on k-Nearest Neighbor

Abstract

In response to the traditional Byzantine fault-tolerant consensus algorithm, which suffers from performance bottleneck and improper selection of master nodes when the number of nodes increases, this paper proposes a k-Nearest Neighbor based PBFT consensus algorithm, which is called K-PBFT consensus algorithm in this paper. By introducing the k-Nearest Neighbor algorithm, the idea of discarding the master node is adopted to evaluate the behaviour of nodes in consensus, dynamically update the credit value of nodes, classify the node hierarchy and find neighboring nodes for all nodes to communicate so as to complete consensus. Through comparative simulation experimental analysis, the improved algorithm can reduce the time delay and improve the consensus efficiency.