An evolution strategy based approach for cover scheduling problem in wireless sensor networks

Cover scheduling problem in wireless sensor networks (WSN-CSP) aims to find a schedule of covers which minimizes the longest continuous duration of time for which no sensor in the network is able to monitor a target. This problem arises in those sensing environments which permit the coverage breach, i.e., at any instant of time, all targets need not be monitored. The coverage breach may occur owing to either technical restrictions or intentionally. It is an $$\mathcal {NP}$$-hard problem. This paper presents a $$(1 + 1)$$-evolution strategy based approach to address WSN-CSP problem. We have compared our approach with the state-of-art approaches available in literature. Computational results show that our approach is significantly superior in comparison to the existing approaches for WSN-CSP.