Strong barrier coverage of wireless sensor networks

Abstract

Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to detect intruders moving along restricted crossing paths in rectangular areas. We present a complete solution to this problem for sensors that are distributed according to a Poisson point process. In particular, we present an efficient distributed algorithm to construct sensor barriers on long strip areas of irregular shape without any constraint on crossing paths. Our approach is as follows: We first show that in a rectangular area of width w and length with w = Ω(log ), if the sensor density reaches a certain value, then there exist, with high probability, multiple disjoint sensor barriers across the entire length of the area such that intruders cannot cross the area undetected. On the other hand, if w = o(log ), then with high probability there is a crossing path not covered by any sensor regardless of the sensor density. We then devise, based on this result, an efficient distributed algorithm to construct multiple disjoint barriers in a large sensor network to cover a long boundary area of an irregular shape. Our algorithm approximates the area by dividing it into horizontal rectangular segments interleaved by vertical thin strips. Each segment and vertical strip independently computes the barriers in its own area. Constructing "horizontal" barriers in each segment connected by "vertical" barriers in neighboring vertical strips, we achieve continuous barrier coverage for the whole region. Our approach significantly reduces delay, communication overhead, and computation costs compared to centralized approaches. Finally, we implement our algorithm and carry out a number of experiments to demonstrate the effectiveness of constructing barrier coverage.

On full-view coverage in camera sensor networks

“…In trap coverage, coverage holes are allowed to exist as long as the diameters of the holes are bounded. Sensor density estimation for these coverage requirements are derived [14], [4], [16], [5]. The optimal deterministic deployment pattern for 1-coverage is based on triangle lattices, which has been proved in [13].…”

Area Coverage Redundancy and Node Positioning in Wireless Sensor Networks

“…In this model the coverage operations take place in a way that if the penetration takes place from the width of the under coverage area, the sensors must diagnose them [10]. In barrier coverage the goals are controlled at least by one sensor and all existing goals in that area are under control of that area [11,12].…”

Barrier coverage for underwater sensor networks

“…Examination of an intruder's ability to navigate through a sensor field undetected is a well studied problem [18]- [22]. Determining if within a belt region an intruder would be detected by at least k sensors is known as the k-Barrier Coverage Problem [23], where the authors proposed algorithms to determine if a region is k-barrier covered, established deployment pattern to guarantee k-barrier coverage, and derived conditions of k-barrier coverage in a randomly deployed sensor network.…”