Lai smaržo vasara, lai smaržo brīvība! Lai smaržo vasara, lai smaržo ...
Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State...
-
Upload
elinor-wood -
Category
Documents
-
view
216 -
download
1
Transcript of Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State...
![Page 1: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/1.jpg)
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
![Page 2: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/2.jpg)
Outline IntroductionNetwork ModelMeasuring the Quality of Barrier CoverageRepairing Weak ZonesA Protocol Guaranteeing Quality of Barrier CoverageSimulation Conclusion
![Page 3: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/3.jpg)
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.
![Page 4: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/4.jpg)
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.
![Page 5: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/5.jpg)
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.
![Page 6: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/6.jpg)
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
![Page 7: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/7.jpg)
Belt region
Belt region: A belt (region) has four boundaries .
![Page 8: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/8.jpg)
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
![Page 9: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/9.jpg)
Crossing paths & Orthogonal lines
Crossing paths: A path crosses from one parallel boundary to the other.
Crossing path
![Page 10: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/10.jpg)
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
![Page 11: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/11.jpg)
Leftmost /Rightmost orthogonal line of a sensing Region
![Page 12: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/12.jpg)
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.
zoneSz
Zn(l1,l2)
l1l2
![Page 13: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/13.jpg)
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
![Page 14: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/14.jpg)
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 }
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 .
kQ
kQ
kQ
kQ
kQ
![Page 15: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/15.jpg)
= -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.
kQ
Crossing path
kQ
kQ
![Page 16: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/16.jpg)
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)
![Page 17: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/17.jpg)
![Page 18: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/18.jpg)
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: (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
![Page 19: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/19.jpg)
≠ -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 = .kQ kM
ZSkM
kQ
kQ
kQ kM
5r 3r
![Page 20: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/20.jpg)
Identifying all weak zonesAs 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 *
kQ
Q*
![Page 21: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/21.jpg)
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’
![Page 22: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/22.jpg)
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’
![Page 23: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/23.jpg)
Repairing all weak zones
a
zone zzone z’
a b
Zn (a , b)
L
j = Q* - ),( jj baZnSj
![Page 24: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/24.jpg)
Distributed algorithmGiven 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.
![Page 25: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/25.jpg)
Algorithm GUARANTEE
The algorithm comprises two parts, one for every sensor node and the other for gateways.Actions of every active node aActions of the gateway
![Page 26: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/26.jpg)
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*
maxR
maxR
![Page 27: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/27.jpg)
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
![Page 28: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/28.jpg)
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)
![Page 29: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/29.jpg)
Actions of every active node a
l l’
ll(a)
rl(a)
a
b
![Page 30: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/30.jpg)
Actions of every active node a
l l’
ll(a)
rl(a)
a
Zn(rl(a),?)
![Page 31: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/31.jpg)
Actions of every active node aNode a checks if there is
a critical k-barrier covered zone Zn(a; b) , and if so, includes it in the report.
![Page 32: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/32.jpg)
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{
, }. kQ
kQ ),( baZnS
kQ
![Page 33: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/33.jpg)
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(rl(a),?)
![Page 34: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/34.jpg)
Simulation
Simulator MATLAB
Belt region of dimension 5,000m X 200m
Sensing range (r) 30m
K 1
Required quality Q* 200m
![Page 35: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/35.jpg)
Related work - SEEML-Local k-Barrier Coverage
d d
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.
![Page 36: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/36.jpg)
SEEMCase I : If d ≦ r , The maximum value of d for nodes a and b is r.
2d-zone
d d
![Page 37: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/37.jpg)
if d > r, algorithm SEEM will report = max{2d - 2r ; d + r}
SEEMkQ
= 4rkQ
Max{ 2*3r-2r = 4r ; 3r+r = 4r }
![Page 38: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/38.jpg)
![Page 39: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/39.jpg)
![Page 40: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/40.jpg)
ConclusionMeasure : 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 .
kQ
![Page 41: Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.](https://reader036.fdocuments.net/reader036/viewer/2022081603/56649f575503460f94c7c350/html5/thumbnails/41.jpg)
Thank you ~