Voronoi Based Area Coverage Optimization for Directional Sensor Networks

Sensing coverage is a fundamental problem in sensors networks. Different from traditional isotropic sensors with sensing disk, directional sensors may have a limited angle of sensing range due to special applications. In this paper, we study the area coverage problem in directional sensor networks with the rotatable orientation for each sensor. We propose the optimal coverage in directional sensor networks (OCDSN) problem to cover maximal area while activating as few sensors as possible. Then we prove the OCDSN to be NP-complete and propose the greedy approximation algorithm of the solution to the OCDSN problem, based on the boundary Voronoi diagram. Finally, extensive simulation is executed to demonstrate the performance of the proposed algorithm.