Toward Optimal Orientation Scheduling for Full-View Coverage in Camera Sensor Networks

In this paper, we study full-view coverage in camera sensor networks, by exploiting their limited mobility of orientation rotation. We focus on the fairness based coverage maximization problem, i.e., how to schedule the orientations of the camera sensors to maximize the minimum accumulated full-view coverage time of target points. To solve this problem, we first try to reduce the space dimension of orientation search by dividing the orientation space into a set of discrete regions. We select the minimum number of sensing regions that camera sensors should rotate to in order to ensure the full-view coverage of all target points. Next, we attempt to understand the relationship of full-view coverage among the target points, which are spatially coupled. Based on results in these two steps, we devise an algorithm to solve the problem based on "largest demand first serve" principle. We provide extensive simulations to demonstrate the desired performance of the proposed algorithms.