Abstract
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.
Highlights
A wireless sensor network (WSN) consists of sensor nodes with the ability to sense, process, and communicate
Theoretical key concepts required to understand the use of game theory in WSN routing are briefly discussed; Routing protocols are examined in relation to their operational principles and key features; Routing protocols are classified based on the game applied; Routing protocols are compared with each other in terms of major characteristics, pros, and cons; Certain challenging problems in the design and implementation of a routing protocol are discussed, in addition to future research directions; Possible applications and future improvements of the protocols are discussed
Game Theory-Based Routing Protocols in WSNs section, the existing game theory-based routing protocols for WSNs are reviewed and discussed in Routing approaches based on game theory vary depending on the types of game used
Summary
A wireless sensor network (WSN) consists of sensor nodes with the ability to sense, process, and communicate. Replacing a wired macrosensor with smaller wireless sensors for the same cost can provide us with a wider range of benefits Another advantage of WSNs is that the failure of one sensor node does not affect the whole network, because there are adjacent nodes collecting a similar kind of data in the target region [1]. Sensor nodes should provide an accurate and precise response if there are any sudden changes in the environment Location awareness is another required feature for WSNs. Data collection is mostly based on location, and nodes are expected to know their positions if required. Even though [41] and [42] are reviewed in [47], we have included them in our survey because they are two of the major papers published in recent years that cover the implementation of the cluster-based WSNs using evolutionary game theory (EGT).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.