Research On Wireless Sensor Network Routing Based On Game Theory

In recent years, wireless sensor networks (WSNs) are much concerned by the researchers. The improvement on sensor technology, modern networks, and wireless communications has enabled the development of wireless sensor networks, which own many low energy consumption and multifunctional sensors. An infrastructure network which owns the function of sensing data, processing data and wireless communications is consisted by a large number of tiny sensors. With the development and maturation of wireless sensor networks, they have a wide application in military, environment science, health care and space exploration.In WSNs, routing selection and control technology are critical to wireless sensor networks, how to protect the path reliability of data transmission and energy efficiency are key issues in researching WSNs. WSNs are composed of a large number of random deployed sensor nodes, which means sensor networks must possess self-organizing capabilities. On the other hand, because of the limited transmission range and energy resources, they should have the cooperative effort to satisfy the network performance. The protocols or algorithms of wireless sensor networks should make the nodes have self-organizing and cooperative capabilities to control or manage the network resources of the nodes efficiently. Therfore, this paper applies game theory to research the routing problems in WSNs.In this paper, new methods for wireless sensor network routing based on game theory are proposed:Firstly, a packet forwarding model based on repeated game is proposed owing to the limited energy resource and route path selection in wireless sensor networks, this model considers two-hop path connectivity and improves path reliability, it can promote nodes cooperation and optimize network performance by the punishment mechanism. The simulation results validate the influence on network performance and nodes'payoff through different strategies.Secondly, a repeated game model based on energy consumption is proposed, it improved the above model for considering energy consumption. Then the paper analyses that this repeated game model can achieve sub-game perfect Nash Equilibrium, we also verified the rationality and validity of the model compared to classical packet forwarding strategy.Finally, considering the variety of parameters on network routing, an auction mechanism for relay node selection is proposed, which is combined with the auction game. Through the simulations and theoritical analysis, the results show that the proposed algorithm is more preferable in both of balancing energy and prolonging network life time, and the number of overhead packets is also decreased.