A Greedy Virtual Force Algorithm for Target Coverage in Distributed Sensor Networks

Coverage maximization is an important goal of sensing deployment in Distributed Sensor Networks (DSN). In target coverage problem, given a predefined number of sensors and potential target locations, the objective is to find an optimal deployment of sensors that maximizes the number of monitoring targets. In this article, a greedy Virtual Force Algorithm (VFA) is employed to solve target coverage problem. The proposed VF-based scheme uses a judicious combination of attractive and repulsive forces from potential target locations and neighboring sensors to determine new sensor locations that improve the target coverage. Simulation results are presented to demonstrate the effectiveness of the proposed approach.