Coverage Quality Based Target-Oriented Scheduling in Directional Sensor Networks

In this paper, we study a novel coverage problem where each target has differentiated coverage quality requirement in directional sensor network. Since extending network lifetime is a very important issue in directional sensor network, we address the Maximal Network Lifetime Scheduling Problem (MNLS) which organizes the directions of sensors into a group of non-disjoint cover sets. One cover set which can cover all the targets satisfying their coverage quality requirement is activated at one time. Firstly, we prove the MNLS problem is NP-Hard and get an upper bound of the optimal solution for the problem. Secondly, we formulate the problem as an exact Integer Programming. Then we propose two efficient heuristic algorithms (MNLS-H and MNLS-H-T) for the problem. Finally, Extensive experiments have been conducted to demonstrate the performance of these algorithms through comparing the two heuristics with the upper bound.