Home // ICSNC 2016, The Eleventh International Conference on Systems and Networks Communications // View article

In Defense of Stint for Breach-Free Sensor Barriers

Authors:
Jorge Cobb

Keywords: barrier coverage; sensor networks; security breaches

Abstract:
A sensor barrier consists of a subset of sensors that divide an area of interest into two regions so that no intruder can move from one region to another without being detected by at least one sensor. The length of time over which the sensors protect the area can be maximized if the sensors are divided into disjoint barriers, and only one barrier is active at a time. Dividing the sensors into a maximum number of disjoint barriers can be done with the well-known Stint algorithm. However, recently, a new security problem was discovered, known as a barrier-breach, that allows an intruder to cross the area undetected by taking advantage of the time when one barrier is replaced by the next. This is dependent not on the structure of an individual sensor barrier, but on the relative shape of two consecutive sensor barriers. There have been several heuristics proposed in the literature that attempt to maximize the number of breach-free barriers. In recent work, we proposed a heuristic that outperforms earlier heuristics. In this paper, we refine our previous heuristic to deliver even better performance than before by the careful elimination of redundant nodes. In addition, me present a simple modification of the Stint algorithm that results in a method that outperforms all others when the density of sensors nodes is very high.

Pages: 12 to 19

Copyright: Copyright (c) IARIA, 2016

Publication date: August 21, 2016

Published in: conference

ISSN: 2163-9027

ISBN: 978-1-61208-499-2

Location: Rome, Italy

Dates: from August 21, 2016 to August 25, 2016