Research On Lifetime Improvement Algorithm Of Wireless Sensor Networks Based On Game Theory

Due to its low deployment cost,wireless sensor networks have been widely used in recent years,such as environmental monitoring,military detection,medical care,endangered species tracking,disaster relief,etc.Generally,most sensor nodes are powered by batteries,which means their energy supply is limited.When one or some sensor nodes at key locations exhaust their energy,the nodes will stop working,resulting in a network split,resulting in a decrease in the throughput of network nodes,a decrease in the average remaining energy of nodes,and a decrease in network life.This paper mainly studies the goal is to prolong the lifetime of wireless sensor networks.This paper optimizes and improves the LEACH classic clustering protocol,and improves the defects of the LEACH protocol in three aspects:(1)An energy-saving game clustering scheme is designed to select the optimal cluster.While considering the remaining energy of the node,each node aims to improve the overall life of the network.The network allows nodes to carry out their respective activities in a selfish manner.Determine the Nash equilibrium in a set of pure strategies and mixed strategies,and finally determine the expected return of nodes in the Nash equilibrium.(2)By determining the size of the network,calculate the most suitable number of cluster heads(CH)in the network,because an inappropriate number of CHs will easily reduce the overall life of the network.(3)Calculate the candidate CH by introducing the game theory framework and energy factor and distance factor.Then combine the random number to select the real CH to increase the rationality of CH selection.The simulation results show that in small and medium-sized networks,the percentages of network lifetime improvements compared to LEACH,LGCA,and EGCR algorithms are 57.9%,17%,and 6%,respectively,and the throughput percentages are 38%,12.6%,and 3.0%,respectively.Aiming at the problem of network performance degradation due to multi-path fading in the LEACH protocol optimization scheme based on game theory as the network scale increases,multi-hop intra-cluster routing,inter-cluster routing and routing from CH to base station(BS)are designed.The intra-cluster routing sends factors such as the collected basic information of the cluster members(CM)in the cluster to the CH.Inter-cluster routing classifies CHs in different areas through the number of hops to BS,selects CHs between different levels,and finally sends data to BS from the selected CH,which solves the problem that the algorithm increases with the increase of network scale.The remaining energy,throughput,and lifetime performance of the network deteriorate.The simulation results show that in a largescale network,the network lifetime is 118.9%,31.8%,and 12% higher than LEACH,LGCA,and EGCR algorithms,and the throughput is increased by 88.8%,22.8%,and4.4%.