Neighborhood node selection strategy for blockchain networks based on Boltzmann method

In view of the low block propagation efficiency in the blockchain network, which leads to the low throughput and high acknowledgement delay of the blockchain system, a dynamic node neighbor selection strategy is designed. According to the node elimination rate, neighbor nodes are divided into reserved nodes and replacement nodes. First, all possible combinations of neighbor node replacement are found by using the combination rule. Then, when determining the strategy of each round, the neighbor node with good transmission timeliness is selected as the reserved node to improve the block transmission efficiency. The selection process of reserved nodes is regarded as a multi arm bandit problem, and a mathematical model is established by using Boltzmann selection strategy. The parameters of the strategy, such as node elimination rate and average propagation delay, are analyzed and verified by simulation experiments. The experimental results show that this strategy can optimize the topology of the blockchain network and effectively reduce the average propagation delay of the blockchain network.