Voronoi-Based Coverage Optimization for Directional Sensor Networks

HTML  Download Download as PDF (Size: 291KB)  PP. 417-424  
DOI: 10.4236/wsn.2009.15050    6,061 Downloads   11,620 Views  Citations

Affiliation(s)

.

ABSTRACT

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 coverage problem in directional sensor networks (DSNs) 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 Voronoi-based centralized approximation (VCA) algorithm and the Voronoi-based distributed approximation (VDA) algorithm of the solution to the OCDSN problem. Finally, extensive simulation is executed to demonstrate the performance of the proposed algorithms.

Share and Cite:

J. LI, R. WANG, H. HUANG and L. SUN, "Voronoi-Based Coverage Optimization for Directional Sensor Networks," Wireless Sensor Network, Vol. 1 No. 5, 2009, pp. 417-424. doi: 10.4236/wsn.2009.15050.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.