A novel insert heuristic algorithm for Sweep Coverage problem

As a new improvement of coverage technologies of wireless sensor networks,sweep coverage can satisfy surveillance requirements with less number of sensor nodes than conventional static coverage for some particular applications.To improve the performance of existing Sweep Coverage approaches in the scenarioes where POIs may have varying coverage interval,in this paper,a novel insert heuristic scheme is proposed.In this proposed scheme,path increment and difference of coverage interval are introduced as the metrics for route building.Experimental results show that the proposed scheme has better performance than the exsiting approaches.