Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Wireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consu...

Full description

Bibliographic Details
Main Authors: Md Arafat Habib, Sangman Moh
Format: Article
Language:English
Published: MDPI AG 2019-07-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/9/14/2896
id doaj-39881bc50830423486654298b8b74607
record_format Article
spelling doaj-39881bc50830423486654298b8b746072020-11-24T20:44:10ZengMDPI AGApplied Sciences2076-34172019-07-01914289610.3390/app9142896app9142896Game theory-based Routing for Wireless Sensor Networks: A Comparative SurveyMd Arafat Habib0Sangman Moh1Department of Computer Engineering, Chosun University, Gwangju 61452, KoreaDepartment of Computer Engineering, Chosun University, Gwangju 61452, KoreaWireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consumption, and packet delivery ratio. Furthermore, as these applications are used in critical operations with limited irreplaceable batteries, routing protocols are required to be flawless as well as energy efficient. The dynamic environment also requires intelligent and adaptive routing. Game theory is widely used for designing routing protocols in WSNs to achieve not only reduced energy consumption but also increased packet delivery ratio. The core features of efficiently designed game theory-based routing protocols include optimal cluster head selection in hierarchical routing, energy-efficient and delay-aware route discovery, fault-tolerant data delivery, and coalition forming and grouping among nodes for stringent data transfer. In this paper, different routing protocols based on various types of games are extensively reviewed, which have been reported so far for improving energy consumption, delay, route establishment time, packet delivery ratio, and network lifetime. The different game theory-based routing protocols are qualitatively compared with each other in terms of major features, advantages, limitations, and key characteristics. For each protocol, possible applications and future improvements are summarized. Certain important open concerns and challenges are also discussed, along with future research directions.https://www.mdpi.com/2076-3417/9/14/2896energy consumptiongame theorynetwork lifetimepacket delivery ratiorouting protocolwireless sensor networks
collection DOAJ
language English
format Article
sources DOAJ
author Md Arafat Habib
Sangman Moh
spellingShingle Md Arafat Habib
Sangman Moh
Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
Applied Sciences
energy consumption
game theory
network lifetime
packet delivery ratio
routing protocol
wireless sensor networks
author_facet Md Arafat Habib
Sangman Moh
author_sort Md Arafat Habib
title Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
title_short Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
title_full Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
title_fullStr Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
title_full_unstemmed Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey
title_sort game theory-based routing for wireless sensor networks: a comparative survey
publisher MDPI AG
series Applied Sciences
issn 2076-3417
publishDate 2019-07-01
description Wireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consumption, and packet delivery ratio. Furthermore, as these applications are used in critical operations with limited irreplaceable batteries, routing protocols are required to be flawless as well as energy efficient. The dynamic environment also requires intelligent and adaptive routing. Game theory is widely used for designing routing protocols in WSNs to achieve not only reduced energy consumption but also increased packet delivery ratio. The core features of efficiently designed game theory-based routing protocols include optimal cluster head selection in hierarchical routing, energy-efficient and delay-aware route discovery, fault-tolerant data delivery, and coalition forming and grouping among nodes for stringent data transfer. In this paper, different routing protocols based on various types of games are extensively reviewed, which have been reported so far for improving energy consumption, delay, route establishment time, packet delivery ratio, and network lifetime. The different game theory-based routing protocols are qualitatively compared with each other in terms of major features, advantages, limitations, and key characteristics. For each protocol, possible applications and future improvements are summarized. Certain important open concerns and challenges are also discussed, along with future research directions.
topic energy consumption
game theory
network lifetime
packet delivery ratio
routing protocol
wireless sensor networks
url https://www.mdpi.com/2076-3417/9/14/2896
work_keys_str_mv AT mdarafathabib gametheorybasedroutingforwirelesssensornetworksacomparativesurvey
AT sangmanmoh gametheorybasedroutingforwirelesssensornetworksacomparativesurvey
_version_ 1716818213475450880