On Sleep-wakeup Scheduling of Non-penetrable Barrier-coverage of Wireless Sensors
This paper identifies a new security problem of existing scheduling algorithms for barrier-coverage of sensors, which never considered before. A barrier-cover of wireless sensors is a subset of sensors seamlessly spanning between two opposite sides such that no intruder can move from one side to the other without being detected. The goal of the scheduling algorithms is to find a sleep-wakeup schedule of sensors such that the time to protect an area of interest using a series of alternating barrier-covers can be maximized. The authors introduce a new security problem which may exist when two barrier-covers, whose covered areas are not completely disjoint, alternate. They show how an intruder can utilize a set of points, namely "Barrier-breaches", to penetrate the alternating barrier-covers.