Wireless Sensor Network Research Based On Game Theory

As a new information acquisition and processing technology, the wireless sensornetwork (WSN) is the current domestic and foreign researching focus and has a wideapplication prospect. In the WSN, the sensor node’s energy distributed in the observationenvironment is limited. Therefore, the primary target of WSN routing protocol designing is toreduce the energy consumption of sensor nodes and extend the life of sensor network throughefficient routing design algorithm in the premise of ensuring normal data acquisition. Basedon network logical structure, WSN routing protocol can be divided into plane routing protocoland hierarchical routing protocol. In hierarchical routing protocol, sensor nodes are dividedinto equal or unequal cluster according to the clustering algorithm. Cluster member nodes willcollect the data and sent to the cluster head who charge of the data fusion and forwarding. Thelayered structure can greatly reduce the volume of network traffic and has good scalability, itis suitable for large-scale WSN and WSN of which topology changed easy.In this paper, the classic WSN hierarchical routing protocol LEACH is studied first.Then in the light of unreasonable cluster-head distribution and unequal energy consumption,we design a new hierarchical routing protocol GEEC based on game theory. The clusteringalgorithm considers the energy of sensor nodes, the distance to base station and the status ofneighbor sensor nodes and selects cluster head using the sealed first-degree price auctionmodel in game theory. The simulation results show that, the proposed algorithm performsoutstanding in nodes-distribution rationality and energy-consumption balancing, caneffectively prolong the survival time of network.