Voronoi-Based Coverage Optimization for Directional Sensor Networks

  • LI J
  • WANG R
  • HUANG H
  • et al.
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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 orien-tation 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 Vo-ronoi-based distributed approximation (VDA) algorithm of the solution to the OCDSN problem. Finally, ex-tensive simulation is executed to demonstrate the performance of the proposed algorithms.

Cite

CITATION STYLE

APA

LI, J., WANG, R., HUANG, H., & SUN, L. (2009). Voronoi-Based Coverage Optimization for Directional Sensor Networks. Wireless Sensor Network, 01(05), 417–424. https://doi.org/10.4236/wsn.2009.15050

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free