{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:37:36Z","timestamp":1760243856145,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T00:00:00Z","timestamp":1317254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/s111009327","type":"journal-article","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T11:34:46Z","timestamp":1317296086000},"page":"9327-9343","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks"],"prefix":"10.3390","volume":"11","author":[{"given":"Xin","family":"Guan","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Heilongjiang University, Harbin 150080, China"},{"name":"Department of Information and Computer Science, Keio University, Yokohama 223-8522, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Heilongjiang University, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujun","family":"Bi","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Heilongjiang University, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2011,9,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1021841632715","article-title":"Obstacle-free geocasting protocols for single\/multi-destination short message services in Ad Hoc networks","volume":"9","author":"Chang","year":"2003","journal-title":"Wirel. Netw"},{"key":"ref_2","unstructured":"Chang, CY, Shih, KP, Lee, SC, and Chang, SW (, January October). RGP: Active route guiding protocol for wireless sensor networks with obstacles. Vancouver, Canada."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Karp, B, and Kung, HT (2000, January 6\u201311). GPSR: Greedy perimeter stateless routing for wireless networks. Boston, MA, USA.","DOI":"10.1145\/345910.345953"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/TPDS.2005.116","article-title":"A spatiotemporal communication protocol for wireless sensor networks","volume":"16","author":"He","year":"2005","journal-title":"IEEE Trans. Parall. Distrib. Syst"},{"key":"ref_5","unstructured":"Aissani, M, Mellouk, A, Badache, N, and Saidani, B (December, January 30). Oriented void avoidance scheme for real-time routing protocols in wireless sensor networks. New Orleans, LA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Yu, F, Choi, Y, Park, S, Lee, E, Tian, Y, and Kim, SH (2007, January 26\u201330). An edge nodes energy efficient hole modeling in wireless sensor networks. Washington, DC, USA.","DOI":"10.1109\/GLOCOM.2007.896"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yu, FY, Choi, S, Park, E, Lee, Y, Tian, M, and Jin Kim, SH (2008, January 19\u201323). Anchor node based virtual modeling of holes in wireless sensor networks. Beijing, China.","DOI":"10.1109\/ICC.2008.587"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/98.760423","article-title":"A review of current routing protocols for ad-hoc mobile wireless networks","volume":"6","author":"Royer","year":"1999","journal-title":"IEEE Personal Commun"},{"key":"ref_9","unstructured":"Kranakis, E, Singh, H, and Urrutia, J (1999, January 15\u201318). Compass routing on geometric networks. Vancouver, Canada."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kuhn, F, Wattenhofer, R, and Zollinger, A (2003, January 1\u20133). Worst-case optimal and average-case efficient geometric ad-hoc routing. Annapolis, MD, USA.","DOI":"10.1145\/778415.778447"},{"key":"ref_11","unstructured":"Fang, Q, Gao, J, Guibas, LJ, de Silva, V, and Zhang, L (2005, January 13\u201317). Glider: Gradient landmark-based distributed routing for sensor networks. Miami, FL, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Subramanian, S, Shakkottai, S, and Gupta, P (2007, January 6\u201312). On optimal geographic routing for networks with holes and non-uniform traffic. Anchorage, AK, USA.","DOI":"10.1109\/INFCOM.2007.123"},{"key":"ref_13","unstructured":"Douglas, S, De Couto, J, and Morris, R (2001). Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding, MIT Laboratory for Computer Science. Technical Report MIT-LCS-TR-824."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s11036-006-4471-y","article-title":"Locating and bypassing holes in sensor networks","volume":"11","author":"Fang","year":"2006","journal-title":"Mob. Netw. Appl"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1504\/IJAHUC.2006.010498","article-title":"Avoid void in geographic routing for data aggregation in sensor networks","volume":"1","author":"Chen","year":"2006","journal-title":"J. Ad Hoc Ubiquitous Comput"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/71.963415","article-title":"Loop-free hybrid single-path\/flooding routing algorithms with guaranteed delivery for wireless networks","volume":"12","author":"Stojmenovic","year":"2001","journal-title":"IEEE Trans. Parall. Distrib. Syst"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.comcom.2005.01.013","article-title":"A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range","volume":"29","author":"Boukerche","year":"2006","journal-title":"Comput. Commun"},{"key":"ref_18","unstructured":"Nikoletseas, S, and Powell, O (2007, January 6\u20139). Simple and efficient geographic routing around obstacles for wireless sensor networks. Lecture Notes in Computer Science (LNCS), Rome, Italy."},{"key":"ref_19","unstructured":"Miller, D, Tilak, S, and Fountain, T (, January December). Token equilibria in sensor networks with multiple sponsors. San Jose, CA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1109\/JSAC.2004.830937","article-title":"Game-theoretic models for reliable path length and energy-constrained routing with data aggregation in wireless sensor networks","volume":"22","author":"Kannan","year":"2004","journal-title":"IEEE J. Sel. Area Commun"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Crosby, GV, and Pissinou, N (2007, January 15\u201318). Evolution of cooperation in multi-class wireless sensor networks. Dublin, Ireland.","DOI":"10.1109\/LCN.2007.149"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Anderegg, L, and Eidenbenz, S (2003, January 14\u201319). Ad Hoc-VCG: A truthful and cost-efficient routing protocol for mobile Ad Hoc networks with selfish agents. San Diego, CA, USA.","DOI":"10.1145\/938985.939011"},{"key":"ref_23","unstructured":"Zhong, S, Li, L, Liu, Y, and Yang, Y (September, January 28). On designing incentive compatible routing and forwarding protocols in wireless Ad Hoc networks. An integrated approach using game theoretical and cryptographic techniques. Cologne, Germany."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TMC.2007.1069","article-title":"The COMMIT protocol for truthful and cost-efficient routing in ad-hoc networks with selfish nodes","volume":"7","author":"Eidenbens","year":"2008","journal-title":"IEEE Trans. Mob. Comput"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TWC.2002.804190","article-title":"An application-specific protocol architecture for wireless microsensor networks","volume":"1","author":"Heinzelman","year":"2002","journal-title":"IEEE Trans. Wirel. Commun"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/10\/9327\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:57:33Z","timestamp":1760219853000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/10\/9327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,29]]},"references-count":25,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2011,10]]}},"alternative-id":["s111009327"],"URL":"https:\/\/doi.org\/10.3390\/s111009327","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2011,9,29]]}}}