A Novel Meta-heuristic Differential Evolution Algorithm for Optimal Target Coverage in Wireless Sensor Networks

Abstract

A wireless sensor network (WSN) faces various issues one of which includes coverage of the given set of targets under limited energy. There is a need to monitor different targets in the sensor field for effective information transmission to the base station from each sensor node which covers the target. The problem of maximizing the network lifetime while satisfying the coverage and energy parameters or connectivity constraints is known as the Target Coverage Problem in WSN. As the sensor nodes are battery driven and have limited energy, the primary challenge is to maximize the coverage in order to prolong network lifetime. The problem of assigning a subset of sensors, such that all targets are monitored is proved to be NP-complete. The Objective of this paper is to assign an optimal number of sensors to targets to extend the lifetime of the network. In the last few decades, many meta-heuristic algorithms have been proposed to solve clustering problems in WSN. In this paper, we have introduced a novel meta-heuristic based differential evolution algorithm to solve target coverage in WSN. The simulation result shows that the proposed meta-heuristic method outperforms the random assignment technique.