Game algorithm based on link quality Wireless sensor network routing game algorithm based on link quality

摘要

Aiming at the problems of low data transmission efficiency and uneven energy consumption caused by unreliable link communication in the routing process of wireless sensor networks, this article designs a routing game algorithm based on link quality. In this article, the index for evaluating link quality is defined first. Then, the link quality, node residual energy, and minimum jump transmission strategy are integrated into the utility function to establish a game model to determine the best next hop transmission node. Finally, the routing optimal transmission path is obtained according to the analysis of the existence of Nash equilibrium in the game. In the simulation experiment, the influence of the change of link quality parameters on the performance of the algorithm is analyzed, and the proposed algorithm is compared with non-linear weight particle swarm optimization (NWPSO) algorithm and Low Energy Adaptive Clustering Hierarchy-Improvement (LEACH-IMPT) algorithm in three aspects: the number of surviving nodes, network lifetime, and network energy consumption. The results show that the network lifetime of this method is 16.8% longer than that of LEACH-IMPT algorithm and 7.5% longer than that of NWPSO algorithm. This shows that the algorithm can effectively balance the network energy consumption and prolong the network life cycle. In addition, according to the routing path obtained in the simulation experiment, the optimality of its link quality is verified in the real experimental environment, and the experimental results prove the feasibility of the method in this article in practice.