Improvement of PBFT Consensus Algorithm Based on Affinity Propagation Clustering in Intellectual Property Transaction Scenarios

Electronics(2024)

引用 0|浏览2
暂无评分
摘要
In response to the problems of random selection of primary nodes, high communication complexity, and low consensus efficiency in the current consensus mechanism for intellectual property transactions, a Practical Byzantine Fault Tolerance (PBFT) consensus algorithm based on the Affinity-Propagation (AP) clustering algorithm, termed AP-PBFT, is proposed. Firstly, the election strategy of the leader node is constructed based on the reputation mechanism; the reward and punishment mechanism is designed to achieve the dynamic adjustment of the reputation value of the nodes in the PBFT consensus process, and the number of votes among the nodes is introduced to determine the node’s reputation value in collaboration with the reward and punishment mechanism to guarantee the precise ordering of the nodes. Secondly, nodes with high reputation values are selected as cluster centers to run the AP clustering algorithm, and clustering groups of knowledge property transaction nodes are constructed based on responsibility and availability. Finally, the three-stage consensus process of the PBFT consensus algorithm is optimized, and the consensus task is decomposed into two layers: the intra-consensus group and the inter-leader node group, reducing the communication complexity of transaction data in the blockchain. Experimental findings indicate a significant performance improvement of the algorithm over the PBFT consensus algorithm in communication complexity, throughput, and consensus efficiency in the simulation environment of multiple types of transactions in intellectual property transactions, including different types of large-scale transaction scenarios, such as purchases, sales, licenses, and transfers.
更多
查看译文
关键词
consortium blockchain,consensus algorithm,PBFT algorithm,intellectual property transactions,AP clustering algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要