Abstract
Barrier coverage is an important coverage model for intrusion detection. Clearly energy consumption of sensors is a critical issue to the design of a sensor deployment scheme. In mobile sensor network, it costs the sensors much energy to move. In this paper, we study how to optimize the sensor movement while scheduling the mobile sensors to achieve barrier coverage. Given a line barrier and $n$ sink stations that can supply a required number of mobile sensors, we study how to find the mobile sensors’ final positions on the line barrier so that the barrier is covered and the total sensor movement is minimized. We first propose a fast algorithm for determining the nearest sink for the given point on the barrier. We then propose a greedy algorithm and an optimal polynomial-time algorithm for calculating the optimal sensor movement. To obtain an optimal algorithm, we first introduce a notion of the virtual-cluster which represents a subset of sensors covering a specified line segment of the barrier and their sensor movements are minimized. Then we construct a weighted barrier graph with the virtual-clusters modeled as vertexes and the weight of each vertex as the total sensor movements of the virtual-cluster. We also prove that the minimum total sensor movements for achieving barrier coverage is the minimum total weights of the path between the two endpoints of the line barrier in this graph. We also solve this barrier coverage problem for the case when the barrier is a cycle by extending the techniques used for the line barrier. Finally, we demonstrate the effectiveness and efficiency of our algorithms by simulations.
Highlights
Wireless sensor network has received a great interest in applications such as border surveillance, battlefield surveillance and critical infrastructure security
Given a line barrier and n sink stations that can supply a required number of sensors, we study the barrier coverage problem which aims to find the mobile sensors’ final positions on the line barrier so that the barrier is covered and the total sensor movement is minimized
We find that the barrier coverage problem under the sink-based deployment model can be solved by a polynomial-time algorithm
Summary
Wireless sensor network has received a great interest in applications such as border surveillance, battlefield surveillance and critical infrastructure security. Li et al.: Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network communicate with other sensors In some applications such as the battlefield surveillance and nuclear leakage monitoring, it is impossible that the airplane is flying at a low altitude and a new deployment model should be explored. This model was first studied in the target coverage problem in the work [5] It assumed that initially all the sensors are located at k sink stations and proposed a polynomial-time approximation scheme to minimize the moving distance of sensors to cover all targets in the surveillance region.
Sign-in/Register to view highlights & summary 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.
