Abstract
In recent years, barrier coverage problem in directional sensor networks has been an interesting research issue. Most of the existing solutions to this problem aim to find as many barrier sets as possible to enhance coverage for the target area, which did not consider the power conservation. In this paper, we address the efficient sensor deployment (ESD) problem and energy-efficient barrier coverage (EEBC) problem for directional sensor networks. First, we describe a deployment model for the distribution of sensor locations to analyze whether a target area can be barrier covered. By this model, we examine the relationship between the probability of barrier coverage and network deployment parameters. Moreover, we model the EEBC as an optimization problem. An efficient scheduling algorithm is proposed to prolong the network lifetime when the target area is barrier covered. Simulation results are presented to demonstrate the performance of this algorithm.
Highlights
Directional sensors, such as image sensors [1], video sensors [2] and infrared sensors [3], have been widely used to improve the performance of wireless sensor networks
Directional sensor has a limited angle of sensing range due to the technical constraints or cost considerations, which is different from omnidirectional sensor
We study the energy-efficient barrier coverage problem for directional sensor networks
Summary
Directional sensors, such as image sensors [1], video sensors [2] and infrared sensors [3], have been widely used to improve the performance of wireless sensor networks. Barrier coverage depends on the distribution of sensor locations Network parameters, such as the number of nodes, the sensing radius of each sensor, and the number of directions per sensor, have important effects on the probability of barrier coverage. We study the energy-efficient barrier coverage problem for directional sensor networks. The relationships between the probability of the barrier coverage and network parameters are studied in different deployment scenarios. We propose an energy-efficient scheduling algorithm to prolong the network lifetime when the target area is barrier covered. By solving the optimization problem, we get the optimal solutions, the barrier sets, and their work times. These barrier sets work continuously with their work times to maximize the network lifetime.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
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 call