Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks

In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We assume that each sensor can distinguish and select up to L targets in its sensing range to observe and sends all the observed-data back to the sink via single or multiple hop communications. We develop a polynomial-time algorithm which can achieve optimal solution based on the theory of linear programming and integer theorem. We then develop an flexible efficient heuristic algorithm and demonstrate the effectiveness of its performance through extensive simulation results.