Joint sensing duty cycle scheduling for heterogeneous coverage guarantee
Abstract
In this paper we study the following problem: given a set of m sensors that collectively cover a set of n target points with heterogeneous coverage requirements (target j needs to be covered every fj slots), how to schedule the sensor duty cycles such that all coverage requirements are satisfied and the maximum number of sensors turned on at any time slot is minimized. The problem models varied real-world applications in which sensing tasks exhibit high discrepancy in coverage requirements - critical locations often need to be covered much more frequently. We provide multiple algorithms with best approximation ratio of O (log n + log m) for the maximum number of sensors to turn on, and bi-criteria algorithm with (α, β)-approximation factors with high probability, where the number of sensors turned on is an α = O(δ(log (n) + log(m))/β)-approximation of the optimal (satisfying all requirements) and the coverage requirement is a β-approximation; δ is the approximation ratio achievable in an appropriate instance of set multi-cover. When the sensor coverage exhibits extra geometric properties, the approximation ratios can be further improved. We also evaluated our algorithms via simulations and experiments on a camera testbed. The performance improvement (energy saving) is substantial compared to turning on all sensors all the time, or a random scheduling baseline.
Publication Title
Proceedings - IEEE INFOCOM
Recommended Citation
Liu, K., Mayer, T., Yang, H., Arkin, E., Gao, J., & Goswami, M. (2017). Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. Proceedings - IEEE INFOCOM https://doi.org/10.1109/INFOCOM.2017.8056961
