Maximizing target-temporal coverage of mission-driven camera sensor networks

Research paper by Yi Hong, Deying Li, Donghyun Kim, Wenping Chen, Jiguo Yu, Alade O. Tokuta

Indexed on: 25 Aug '16Published on: 25 Aug '16Published in: Journal of Combinatorial Optimization


In camera sensor networks (CSNs), the target coverage problem is of special importance since a sensor with different viewing directions captures distinct views for the same target. Furthermore, mission-driven monitoring applications in CSNs usually have special network lifetime requirements in which the limited battery lifetime of sensors probably can not sustain for full coverage. In this paper, based on effective-sensing model, we address three new coverage problems in mission-driven camera sensor networks, namely the target-temporal effective-sensing coverage with non-adjustable cameras (TEC-NC) problem, the target-temporal effective-sensing coverage with adjustable cameras (TEC-AC) problem, and the target-temporal effective-sensing coverage with fully-adjustable cameras (TEC-FAC) problem. Given a mission period, the common objective of the problems is to find a sleep-wakeup schedule such that the overall target-temporal coverage is maximized. For TEC-NC, we propose a 2-approximation algorithm and two new heuristics. We also design two greedy strategies, each of which can be combined with our solutions for TEC-NC to deal with TEC-AC and TEC-FAC, respectively. We finally conduct extensive experiments to evaluate the performance of the proposed algorithms, whose results indicate the proposed algorithms outperform the existing alternatives as well as are close to the theoretical optimum on average under certain conditions.