A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

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 success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

[1]  H. S. Wolff,et al.  iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression , 2022, Sensors.

[2]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[3]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[4]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[5]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[6]  Robert Morris,et al.  Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding , 2001 .

[7]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[8]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[9]  Chih-Yung Chang,et al.  Obstacle-Free Geocasting Protocols for Single/Multi-Destination Short Message Services in Ad Hoc Networks , 2003, Wirel. Networks.

[10]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[11]  Azzedine Boukerche,et al.  A new energy efficient and fault-tolerant protocol for data propagation in Smart Dust networks using varying transmission range , 2004 .

[12]  S. Sitharama Iyengar,et al.  Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Azzedine Boukerche,et al.  A new energy efficient and fault-tolerant protocol for data propagation in Smart Dust networks using varying transmission range , 2004, 37th Annual Simulation Symposium, 2004. Proceedings..

[14]  Chenyang Lu,et al.  A spatiotemporal communication protocol for wireless sensor networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[15]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Tony Fountain,et al.  "Token" equilibria in sensor networks with multiple sponsors , 2005, 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[17]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[18]  Chih-Yung Chang,et al.  RGP: Active Route Guiding Protocol for Wireless Sensor Networks with Obstacles , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[19]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[20]  Guangbin Fan,et al.  Avoid 'void' in geographic routing for data aggregation in sensor networks , 2006, Int. J. Ad Hoc Ubiquitous Comput..

[21]  Niki Pissinou,et al.  Evolution of Cooperation in Multi-Class Wireless Sensor Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[22]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks , 2006, Wirel. Networks.

[23]  Ye Tian,et al.  An Edge Nodes Energy Efficient Hole Modeling in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[24]  Sotiris E. Nikoletseas,et al.  Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks , 2007, WEA.

[25]  Ye Tian,et al.  Anchor Node Based Virtual Modeling of Holes in Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Communications.

[26]  Paolo Santi,et al.  The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes , 2008, IEEE Transactions on Mobile Computing.

[27]  Abdelhamid Mellouk,et al.  Oriented Void Avoidance Scheme for Real-Time Routing Protocols in Wireless Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.