A Greedy Algorithm for Maximizing Target Q-Coverage in Directional Sensor Networks

Target coverage maximization with minimum number of directional sensors is a challenging research issue in directional sensor networks. This paper studies the target Q-coverage problem in directional sensor networks. Greedy algorithms existing in the literature activate all the sensors whenever a target fails to achieve the required coverage. We propose a frequency based greedy algorithm which improves the overall target coverage of the network without activating unnecessary sensors.