Build Intrusion Barriers

Abstract

Intrusion detection is a typical application in wireless sensor networks. When mobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the deployed sensors. A mobile object may enter into the sensor field from any point on the field boundary, and its moving trajectory in the sensor field can take arbitrary shapes. Complete area coverage can guarantee that every point of the moving trajectory within the sensor field can be detected. However, providing complete area coverage normally requires a great number of sensors to be deployed. Sometimes, it might not be necessary to detect a moving object at every point on its trajectory. Instead, it might be enough if the object can be detected at least by k distinct sensors before it penetrates through the sensor field. This requires a sensor network to provide k -barrier coverage over a belt field such that any crossing path intersects with the sensing areas of k distinct sensors. A crossing path is a moving trajectory (a continuous curve with arbitrary shape) with the start point on one side of the sensor field and the end point on the opposite side. This chapter discusses the barrier coverage, and the following questions are addressed in this chapter:

What is k -barrier coverage and how to provide k -barrier coverage?

This chapter first summarizes the definition and properties of k-barrier coverage and then discusses the algorithms to provide k barriers.