Abstract
Nowadays, wireless multimedia sensor networks (WMSNs) are used in various applications. An energy-efficient and robust routing protocol is essential for WMSNs because the quality of service is important for traffic-intensive multimedia data, such as images and videos. A WMSN with multiple sinks allows cluster heads (CHs) to deliver the collected data to the nearest sink, thereby mitigating the delivery overhead. In this study, we propose a novel evolutionary-game-based routing (EGR) protocol for WMSNs with multiple sinks, in which the evolutionary game theory is exploited for selecting CHs. In EGR, an algorithm to mitigate data redundancy, based on the overlapping field of views of the multimedia sensor nodes, is also presented. This algorithm decreases the number of redundant transmissions, thereby increasing energy efficiency and network performance. According to the performance evaluation results of this study, the proposed EGR significantly outperforms the state-of-art protocols in terms of energy efficiency, end-to-end delay, packet delivery ratio, cluster formation time, and network lifetime.
Highlights
A wireless multimedia sensor network (WMSN) consists of wirelessly interconnected devices capable of retrieving multimedia contents, such as videos, audios, still images, and scalar sensor data from the environment [1,2,3]
low-energy adaptive clustering hierarchy-centralized (LEACH-C) is a widely used clustering-based protocol for centralized wireless sensor networks (WSNs), which is selected for performance study and for investigating how our proposed protocol performs against a real-time protocol that is commonly used in the industry
We have proposed a new routing protocol for WMSNs, which is based on clustering technique using evolutionary games (EGs)
Summary
A wireless multimedia sensor network (WMSN) consists of wirelessly interconnected devices capable of retrieving multimedia contents, such as videos, audios, still images, and scalar sensor data from the environment [1,2,3]. The overlapping area of the FoV of an object shared by two nearby sensor nodes is calculated, and it is decided if the captured data is redundant This approach decreases the number of redundant transmissions, thereby increasing energy efficiency and network performance. According to the performance evaluation results of this study, the proposed EGR outperforms GEEC, EEREG, QMOR, AB routing, and LEACH-C in terms of energy efficiency, end-to-end delay, packet delivery ratio, cluster formation time, and network lifetime. EG has been used in cluster-based routing protocols for WSNs in the literature; the proposed EGR is the first attempt to use EG for routing in WMSNs. A technique for avoiding data redundancy based on the calculation of the region overlapped by two nearly placed sensors is introduced, which results in a significant increase in the network lifetime.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
