a game theory-based obstacle avoidance routing protocol for wireless sensor networks一个游戏基于理论的避障对无线传感器网络路由协议.pdfVIP

Sensors 2011, 11, 9327-9343; doi:10.3390/s111009327 OPEN ACCESS sensors ISSN 1424-8220 /journal/sensors Article A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks Xin Guan 1,2,*, Huayang Wu 1 and Shujun Bi 1 1 School of Information Science and Technology, Heilongjiang University, Harbin 150080, China; E-Mails: wuhy_2000@ (H.W.); bishujun@163.com (S.B.) 2 Department of Information and Computer Science, Keio University, Yokohama 223-8522, Japan * Author to whom correspondence should be addressed; E-Mail: guan@. Received: 10 August 2011; in revised form: 10 September 2011 / Accepted: 28 September 2011 / Published: 29 September 2011 Abstract: The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission su