Game-Theoretic Approach based Routing Protocol in Wireless Sensor Networks with Obstacles

摘要

The obstacle problem in geographic forwarding is an important issue of location based routing in wireless sensor networks. An obstacle leads to several problems of geographic routing such as excessive energy consumption and data congestion. Obstacles are hardly avoided in realistic environments. To bypass obstacle, most of the routing protocols tend to forward packet along the boundaries of obstacles. It leads to the result that the nodes at the boundaries exhaust energy rapidly and the obstacle area is diffused. In this report, we introduce a novel routing algorithm based on game-theoretic model to solve the obstacle problem in wireless sensor networks. Our algorithm forms the concave region that cannot forward packets to achieve the aim of improving the transmission successful rate and decreasing the transmission delay of packet. We consider the residual energy, out-degree and forwarding angle to conclude the forwarding probability and payoff function 6f forwarding candidates. It achieves the aim of load balance and saving energy consumption of networks. Simulation results show that our protocol is superior to other traditional schemes on the performances of average delivery delay, energy consumption and packet delivery ratio.