DocumentCode :
1971053
Title :
On sleep-wakeup scheduling of non-penetrable barrier-coverage of wireless sensors
Author :
Donghyun Kim ; Jiwoong Kim ; Deying Li ; Sung-Sik Kwon ; Tokuta, Alade O.
Author_Institution :
Dept. of Math. & Comput. Sci., North Carolina Central Univ., Durham, NC, USA
fYear :
2012
fDate :
3-7 Dec. 2012
Firstpage :
321
Lastpage :
327
Abstract :
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. We introduce a new security problem which may exist when two barrier-covers, whose covered areas are not completely disjoint, alternate. We show how an intruder can utilize a set of points, namely “barrier-breaches”, to penetrate the alternating barrier-covers. We also propose two remedies for this problem for existing scheduling algorithms. Our analysis shows that depending on the input graph, one of our approaches works better than the other. Given that such scheduling algorithms only need to run during the initialization phase of a sensor network, we suggest to apply both approaches and pick the better schedule rather than relying solely on the approach which works well on average.
Keywords :
graph theory; scheduling; telecommunication security; wireless sensor networks; barrier-breach; graph; nonpenetrable barrier-coverage; security problem; sleep-wakeup scheduling; wireless sensor; Barrier coverage; barrier-breach; maximum lifetime; network security; scheduling; wireless sensor network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Communications Conference (GLOBECOM), 2012 IEEE
Conference_Location :
Anaheim, CA
ISSN :
1930-529X
Print_ISBN :
978-1-4673-0920-2
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2012.6503133
Filename :
6503133
Link To Document :
بازگشت