Double Barrier Coverage in Dense Sensor Networks

When a sensor network is deployed to detect objects penetrating aprotected region, it is not necessary to have every point in thedeployment region covered by a sensor. It is enough if the penetratingobjects are detected at some point in their trajectory. If a sensornetwork guarantees that every penetrating object will be detected by twodistinct sensors at the same time somewhere in this area, we say thatthe network provides double barrier coverage (DBC). In this paper, wepropose a new planar structure of Sparse DelaunayTriangulation (SparseDT), and prove some elaborate attributes of it. Wedevelop theoretical foundations for double barrier coverage, and proposeefficient algorithms with NS2 simulator using which one can activate thenecessary sensors to guarantee double barrier coverage while the othersensors go to sleep. The upper and lower bounds of number of activenodes are determined, and we show that high-speed target will bedetected efficiently with this configuration.