Abstract
Aiming at the problems of PBFT algorithm of consortium blockchain, such as high communication overhead, low consensus efficiency, and random selection of leader nodes, an optimized algorithm of PBFT is proposed. Firstly, the algorithm improves C4.5 and introduces weighted average information gain to overcome the mutual influence between conditional attributes and improve the classification accuracy. Then classify the nodes with improved C4.5, and select the ones with a high trust level to form the main consensus group. Finally, the integral voting mechanism is introduced to determine the leader node. Experimental results show that compared with traditional PBFT algorithm, the communication times of the improved PBFT algorithm are reduced greatly, which effectively alleviates the problem that the number of nodes in traditional PBFT algorithm increases and the traffic volume is too large, and significantly reduces the probability of the leader node doing evil and improves the consensus efficiency.
Highlights
Blockchain technology was first proposed by Satoshi Nakamoto in the literature [1] in 2008
In view of the problems of the Byzantine fault-tolerant algorithm mentioned above, in [10,11,12], the leader node of the PBFT algorithm is tried to improve in two ways; in [10], the reputation module is introduced; and in [11, 12], credit mechanism and credit reward and punishment scheme are introduced. [13] adopts the separation of negotiation and execution to improve the problem of view change
We design a PBFT-optimized algorithm based on improved C4.5, aiming to solve the problems of excessive communication times and low consensus efficiency among large-scale nodes
Summary
Blockchain technology was first proposed by Satoshi Nakamoto in the literature [1] in 2008. Combined with the specific application scenario of blockchain consensus mechanism, when the trust level is classified according to the node attribute values, the node condition attributes influence each other, and the classification accuracy will decrease. E optimization of PBFT algorithm mainly reduces communication times and improves consensus efficiency by grouping consensus nodes after being classified by the C4.5 algorithm. En, the block attached to the digital signature set of the main consensus group is packaged into a submission message and broadcast to all the slave nodes in the subgroup to which it belongs, indicating that the block can be uplink. (4) Execution stage: after receiving the submission message from the leader node, the slave node verifies the digital signature set attached to the block and can judge whether the block has passed the consensus verification of the main group. If the system finds that the node has committed evil acts, the deposit will be confiscated to punish the node
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
