Maximizing full-view target coverage in camera sensor networks.

Traditional target coverage only ensures monitoring of targets. However, as people's security awareness increases, the requirement for target coverage also increases from monitoring to identification. Thus full-view coverage model is proposed to guarantee that any facing direction of a target could be covered. Based on this coverage model, we study the maximum full-view target coverage problem in camera sensor networks, where each camera sensor has P working directions, aiming at maximizing the number of full-view covered targets by scheduling the working directions of camera sensors. To solve this problem, we design a (1 − 1 e) -approximation algorithm based on pipage rounding and an efficient heuristic algorithm. Finally, simulation results are presented to demonstrate the performance of our algorithms. [ABSTRACT FROM AUTHOR]