1 / 41

Secure Scheduling for Barrier Coverage

Secure Scheduling for Barrier Coverage. Ding-Zhu Du University of Texas at Dallas. Outline. Background Our Research Future. Background. Sensor network. Internet / Satellite. User1. User2. Sink. phenomenon. Sensing Area. Biological Systems. intruder. Area of interest.

pamc
Download Presentation

Secure Scheduling for Barrier Coverage

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SecureScheduling for Barrier Coverage Ding-Zhu Du University of Texas at Dallas

  2. Outline • Background • Our Research • Future

  3. Background

  4. Sensor network Internet / Satellite User1 User2 Sink phenomenon Sensing Area

  5. Biological Systems

  6. intruder Area of interest

  7. Open belt Closed belt

  8. Barrier Cover A barrier-cover is a set of sensors covering a curve connecting two open boundaries.

  9. Homogeneous Sensor Network All sensors have the same size of sensing disks, the same size of communication disks, and the same lifetime, say unit time lifetime.

  10. There may exist several barrier covers.

  11. Sleep-wakeup scheduling may increase the lifetime of barrier coverage. B1 B2 But, there is a security problem!

  12. There is a breach in scheduling (B2, B1) B1 a B2

  13. There is a breach in scheduling (B2, B1) intruder a B2

  14. There is a breach in scheduling (B2, B1) B1 a intruder

  15. There is no breach in scheduling (B1, B2) B1 a B2

  16. Both (B2, B1) and (B1,B2) contain a breach. B1 a b B2 Crossing is bad!

  17. Donghyun Kim, Hyunbum Kim, Deying Li, Sung-Sik Kwon, Alade O. Tokuta, and Jorge A. Cobb, "Maximum Lifetime Dependable Barrier-coverage in Wireless Sensor Networks," Ad Hoc Networks (ADHOC), vol. 36, issue P1, pp. 296-307, January 2016. • This paper gave 3 approaches to removing crossing by delete some barrier-covers.

  18. Our Research

  19. Observation B1 B2 B3 Removal crossing is sufficient, but not necessary! (B3,B2,B1) is a breach-free scheduling.

  20. Starting with following Goals • Goal 1: Find necessary and sufficient condition for a sleep-wakeup scheduling to be breach-free. • Goal 2: Given a set of barrier-covers, find a maximum subset with breach-free scheduling. (complexity & Algorithm)

  21. We completely reached goals 1 Give necessary and sufficient condition for a sleep-wakeup scheduling to be breach-free. 2 Given a set of barrier-covers, find a maximum subset with breach-free scheduling. (This problem is equivalent to the longest path problem in directed graph. ) 3 Heterogeneous sensor system

  22. Necessary and Sufficient 1

  23. Sleep-wakeup scheduling 2 How to find? Step 1. Using the necessary and sufficient condition, construct a breach-free digraph. Step 2. Find the longest path in the beach-free digraph.

  24. B1 B2 B3 Breach Digraph Breach-free Digraph

  25. B1 B2 B3 (B3,B2,B1) is a breach-free scheduling.

  26. Equivalence

  27. Fig. 6

  28. Corollary The longest path problem

  29. Longest Path

  30. Heterogeneous Sensors 3

  31. Path Decomposition

  32. sleep-wakeup scheduling The longest path problem

  33. Node-weight  edge weight

  34. Recall • Find max flow. • Decompose flow into path-flows. Each path-flow gives a barrier-cover with lifetime (=flow value). • Find a max-lifetime subset of barrier-covers with a breach-free scheduling.

  35. Questions • Is decomposition unique? If not, how to give the best decomposition? • Does max flow give a solution with longest lifetime breach-free scheduling?

  36. Thanks, End

More Related