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

Bulletin of the Polish Academy of Sciences. Technical Sciences

Dr. SR Technical University, Chennai 600 062, IndiaEmailOther articles by this author:De Gruyter OnlineGoogle Scholar¹  Dr. SR Technical University, Chennai 600 062, IndiaOther articles by this author:De Gruyter OnlineGoogle Scholar¹  A. M. JagtapCorresponding authorVEL-TECH Dr. RR &²  N. GomathiVEL-TECH Dr. RR &² 

[1] Dr. SR Technical University, Chennai 600 062, India;VEL-TECH Dr. RR &

关键词: Keywords: sensor;    target;    Voronoi;    heuristic;    ABC;    PSO;    VABC;   

DOI  :  10.1515/bpasts-2017-0030

学科分类：工程和技术（综合）

来源: Polska Akademia Nauk * Centrum Upowszechniania Nauki / Polish Academy of Sciences, Center for the Advancement of Science

【 摘 要 】

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.

【 授权许可】

Unknown