A Graph Theoretic Approach for Maximizing Target Coverage using Minimum Directional Sensors in Randomly Deployed Wireless Sensor Networks

The coverage maximization by activating minimum number of sensors is one of the most fundamental problems in wireless sensor networks. The use of directional sensors adds new dimension to it. It has great applications in security, tracking, monitoring and surveillance systems. As the problem is known to be NP-hard, most of the previous works attempt different greedy heuristics for achieving a near optimal solution. Unlike other traditional research works, we tackle the problem in a graph theoretic approach and provide novel solutions using different polynomial order graph algorithms. Use of graph models significantly reduces the run time complexity and also provides better approximation.