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.
Highlights
In recent years, wireless sensor networks (WSNs) have attracted intense interests due to their wide applications in military and civilian operations, such as environmental monitoring, battlefield surveillance, and health care [1,2,3]
Different from traditional isotropic sensors with sensing disk, directional sensors may have a limited angle of sensing range due to special applications
We propose the optimal coverage in directional sensor networks (OCDSN) problem to cover maximal area while activating as few sensors as possible
Summary
Wireless sensor networks (WSNs) have attracted intense interests due to their wide applications in military and civilian operations, such as environmental monitoring, battlefield surveillance, and health care [1,2,3]. In [12,13], Tao presents two coverage-enhancing algorithms to minimize the overlapping sensing area of directional sensors, according to the characteristic of adjustable orientations of directional sensors. In [14,15,16], some algorithms are proposed to cover maximal number of targets They limit orientations of a directional sensor, i.e. the sensor they assume cannot rotate its orientation continuously. We mainly address the problem of maximal coverage while activating as few sensors as possible, called optimal coverage in directional sensor networks (OCDSN) problem. For the solution to this problem, we will propose two optimizing coverage algorithms based on the Voronoi diagram.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
