Algorithm for partial sweep coverage on a line.

Sweep cover is a basic issue in wireless sensor networks, which uses mobile sensors to inspect points of interest (PoIs) periodically. There are many studies on the problem assuming that all mobile sensors have a uniform velocity, while some literature shows that using heterogeneous velocities may greatly increase the difficulty of research. In this paper, we study a minimum energy partial sweep cover (MinEPSC) problem on a line, the goal of which is to minimize energy consumption to sweep-cover at least K PoIs, where the energy consumption of a mobile sensor is related with its velocity in somewhat arbitrary but monotone manner. We design algorithms with theoretically guaranteed approximation ratios under different assumptions on the candidate velocity sets. [ABSTRACT FROM AUTHOR]