1. Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of Barrier-Coverage in Wireless Sensor Networks ACM Mobihoc 2008

2. Outline Introduction Network Model Measuring the Quality of Barrier Coverage Repairing Weak Zones A Protocol Guaranteeing Quality of Barrier Coverage Simulation Conclusion

3. A new application of sensor networks Sensor networks can be used to monitor the borders of a country. Sensors deployed for this sort of application are said to provide border coverage or barrier coverage.

4. Problem Sensors may fail due to various reasons such as lack of power. As more and more sensors fail, certain desired properties such as barrier coverage will diminish and eventually fall below a desired level.

5. Goal Measuring the quality of barrier coverage. If Sensor failures cause the network to fall bellow a desired level of “quality”,we want to detect it.

6. Overview If Sensor failures cause the network to fall bellow a desired level of quality,we want to detect it. If the network indeed needs repair, we want to know which part of the network( weak part) indeed need repair. Repair the weak parts

7. Belt region Belt region: A belt (region) has four boundaries.

8. Middle line Middle Line: The middle line of a belt region is the curve that is parallel to, at the middle between the belt’s two parallel boundaries. middle line

9. Crossing paths & Orthogonal lines Crossing paths: A path crosses from one parallel boundary to the other. Crossing path

10. Coordinate of an orthogonal line Coordinate of an orthogonal line (Vl): For an orthogonal line l,let Vl be the length of the middle line from the middle line’s left endpoint to its intersection with l. Vl

11. Leftmost /Rightmost orthogonal line of a sensing Region

12. Zone Zone : A zone, Z, is a slice of the belt region. The length of a zone Z, denoted by Sz,is the length of the middle line in the zone. zone Sz Zn(l 1,l 2 ) l1l1 l2l2

13. L-Local K-barrier coverage K-Barrier Coverage: A crossing path is k-covered if it intersects the sensing regions of at least k distinct sensors. L-Local k-Barrier Coverage: A belt region is said to be L-Local k- Barrier Coverage if every zone of length L in the region is k-barrier covered. 5 5 – Local 2-Barrier Coverage

14. Quality of k-barrier coverage ( ) A desired quality Q*. The quality of a sensor deployment for k-barrier coverage ( ), is defined to be maximum L such that the belt is L-local k-barrier covered ; i.e., = max { L: the belt is L-local k-barrier covered }L If there is no such L(i.e., if the belt is not even 0-local k-barrier covered), then define = -1; could be negative or nonnegative.

15. = -1 ? LEMMA 4.1: = -1 iff the belt contains an orthogonal crossing line that is not k-barrier covered. Theorem 4.1: ≠ - 1 iff all sensing-boundary zones in the belt are k- barrier covered. Crossing path

16. Zone from node a to node b Zone from node a to node b( Zn(a ; b)): If two nodes a and b are such that Vll(a),Vrl(b), then we denote by Zn(a ; b) Vll(a)Vrl(b)

18. Critical k-barrier covered zone Critical k-barrier covered zone: For two sensor nodes a and b such that Zn(a; b) ≠ ;Zn(a; b) is said to be a critical k-barrier covered zone if the following conditions are all satisfied: Critical k-barrier covered zone (1) Zn(a; b) is k-barrier covered; (2) there exists a δ > 0 such that Zn(a;-δ; b; 0) and Zn(a; 0; b; δ) are both k-barrier covered; (3) for any α > 0,Zn(a;- α; b; α ) is not k-barrier covered. a b δα Zn( a, b ) is a critical 2-barrier covered zone

19. ≠ - 1 Definition 4.8. If ≠ -1, let denote the minimum length of critical k- barrier covered zones. That is, = min{ : Z is a critical k-barrier covered zone}. Theorem 4.2. If ≠ -1, then =. 5r3r

20. Identifying all weak zones As mentioned in the preceding section, there are two types of weak zones: non-k-barrier covered sensing-boundary zones. critical k-barrier covered zones of length less than Q * Q*

21. Lemma 4.3. Let Z be a k-barrier covered zone, and let Z ’ ⊇ Z be another zone. If all sensing regions that intersect lb(Z) or rb(Z) also intersect lb(Z ’) or rb(Z ’), respectively, then Z ’ is also k-barrier covered. Z Z’

22. Definition 5.1. [Repairing a zone] By repairing a zone Z, we mean adding new sensors to a zone Z ’ ⊇ Z such that certain objectives are achieved. Z Z’

23. Repairing all weak zones a zone z zone z’ a b Zn (a, b) L = Q* -

24. Distributed algorithm Given a sensor deployment over a belt for k-barrier coverage and a required quality Q*, returns a (possibly empty) set of weak zones. Once these zones are repaired, the belt will provide k- barrier coverage with quality Q*. If the set of weak zones is empty, the required quality is already met.

25. Algorithm GUARANTEE The algorithm comprises two parts, one for every sensor node and the other for gateways. Actions of every active node a Actions of the gateway

26. Assumptions The gateway has information about the shape of the entire region, but each sensor only knows a small section of it (Q* + ). Given any two sensor nodes it is possible to know if their sensing regions have intersection. Every node is able to communicate with neighbors and with at least one gateway. a Q*

27. Actions of every active node a Check if the sensing region of a is a non-k-barrier covered, if so,write it in the report. l ll(a)rl(a) a

28. Actions of every active node a Node a checks if the sensing-boundary zone Zn(ll(a); l) that starts from ll(a) is k-barrier covered l l’ ll(a)rl(a)

29. Actions of every active node a l l’ ll(a)rl(a) a b

30. Actions of every active node a l l’ ll(a)rl(a) a Zn(rl(a),?)

31. Actions of every active node a Node a checks if there is a critical k-barrier covered zone Zn(a; b), and if so, includes it in the report.a critical k-barrier covered zone Zn(a; b)

32. Actions of the gateway upon receiving a report(1) If the report includes a non-k-barrier covered sensing- boundary zone, then let = -1; otherwise, if critical zone Zn(a, b) exists, let = min{, }.

33. Actions of the gateway upon receiving a report(2) 2)After a gateway gets the report from an active node a, it updates the list L of “need-to-be-repaired” zones. Zn(ll(a),l), Zn(rl(a),l’), Zn(a,b) Zn(ll(a),l) Zn(rl(a),l’) Zn(a,b) Zn(rl(a),?)

34. Simulation SimulatorMATLAB Belt region of dimension5,000m X 200m Sensing range (r)30m K1 Required quality Q*200m

35. Related work - SEEM L-Local k-Barrier Coverage dd L L-local K-barrier coverage 2d-zone [5] A. Chen, S. Kumar, and T. H. Lai. Designing Localized Algorithms for Barrier Coverage. In Proc. Of ACM Mobicom'07, Canada, September 2007.

36. SEEM Case I : If d ≦ r, The maximum value of d for nodes a and b is r. 2d-zone dd

37. if d > r, algorithm SEEM will report = max{2d - 2r ; d + r} SEEM = 4r Max{ 2*3r-2r = 4r ; 3r+r = 4r }

40. Conclusion Measure : Use a critical k-barrier covered zone instead of the k-barrier covered zone. Determine the locations to place additional sensors such that Z ’ (Z’ ⊇ Z ) becomes Q*-local k-barrier covered,thus ensure zone Z is Q*-local k-barrier covered.

41. Thank you ~