In order to decrease the sweep cycle and the number of mobile sensors required, we propose a route scheduling problem in this paper which is the first to consider the effect of sensing range.

We prove that the Distance-Sensitive-Route Scheduling(DSRS) problem is NP-hard, and consider two different scenarios: the single kissing-point case and the general case. For different cases, We propose three corresponding approximation algorithms ROSE, G-ROSE, D-ROSE.