Minimizing sensor movement in target coverage problem: A hybrid approach using Voronoi partition and swarm intelligence

Abstract

This paper addresses the major challenges that reside on target coverage problem, which is one among the two primary sub-problems of node deployment problem. In order to accomplish a cost-efficient target coverage, a Voronoi partition-based, velocity added artificial bee colony algorithm (V-VABC) is introduced. The V-VABC is an advancement over the traditional, target-based Voronoi greedy algorithm (TVgreedy). Moreover, the VABC component of V-VABC is a hybrid, heuristic search algorithm developed from the context of ABC and particle swarm optimization (PSO). The V-VABC is an attempt to solve the network, which has an equal number of both sensors and targets, which is a special case of TCOV. Simulation results show that V-VABC performs better than TV-greedy and the classical and base algorithms of V-VABC such as ABC and PSO.