Improvement of Practical Byzantine Fault Tolerance Consensus Algorithm Based on DIANA in Intellectual Property Environment Transactions

Abstract

In response to the shortcomings of the consensus algorithm for intellectual property transactions, such as high communication overhead, random primary node selection, and prolonged consensus time, a Practical Byzantine Fault Tolerance (PBFT) improvement algorithm based on Divisive Analysis (DIANA) D-PBFT algorithm is proposed. Firstly, the algorithm adopts the hierarchical clustering mechanism of DIANA to cluster nodes based on similarity, enhancing node partition accuracy and reducing the number of participating consensus nodes. Secondly, it designs a reward and punishment system based on node ranking, to achieve consistency between node status and permissions, timely evaluation, and feedback on node behaviours, thereby enhancing node enthusiasm. Then, the election method of the primary node is improved by constructing proxy and alternate nodes and adopting a majority voting strategy to achieve the selection and reliability of the primary node. Finally, the consistency protocol is optimised to perform consensus once within the cluster and once between all primary nodes, to ensure the accuracy of the consensus results. Experimental results demonstrate that the D-PBFT algorithm shows a better performance, in terms of communication complexity, throughput, and latency.