Maintaining Connected Coverage for Wireless Sensor Networks
-
Upload
sybill-brooks -
Category
Documents
-
view
21 -
download
1
description
Transcript of Maintaining Connected Coverage for Wireless Sensor Networks
![Page 1: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/1.jpg)
1
Maintaining Connected Coverage for Wireless Sensor
Networks
Jehn-Ruey Jiang and Tzu-Ming SungDepartment of Computer Science and Information E
ngineering,National Central University, Taiwan
The 28th International Conference on Distributed Computing Systems Workshops
ICDCS 2008
![Page 2: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/2.jpg)
2
Outline
Introduction Problem Formulation The Density Control Algorithm Simulation Results Conclusion
![Page 3: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/3.jpg)
3
Introduction
The wireless sensor network consists of a large number of micro sensors for different application Battlefield surveillance Environment monitoring Animal tracking
The most of the sensors are supported battery distributed over a large area It is hard to recharge
![Page 4: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/4.jpg)
4
Introduction
How to extend the network lifetime is an important problem in WSNs. To deploy high density sensors To use power saving mechanism
![Page 5: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/5.jpg)
5
Problem Formulation
Sensors Asynchronous Position-less Density-high Sensing range
Rs Communication r
ange Rc
Rc ≥ 2Rs
The interesting area G
![Page 6: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/6.jpg)
6
Problem Formulation
In the high density sensor deployment How to connect the coverage with the least
umber of the sensor? To power saving in the asynchronous
system How to provide a mechanism for sensor to
aware of active sensors’ statuses by asynchronously beaconing
![Page 7: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/7.jpg)
7
R. Kershner, “The Number of Circles Covering a Set”,American Journal of Mathematics
The Optimal (Least) Number of Sensors
![Page 8: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/8.jpg)
8
The Density Control Algorithm
Two type of the beacon a beacon
:near beacon1/ <α<1
b beacon:far beacon
R3
R
3
![Page 9: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/9.jpg)
9
The Density Control Algorithm
The power saving in asynchronous system Monitor interval
Beacon window TI (traffic indication) window n beacon intervals
Non-monitor interval Beacon window TI (traffic indication) window
round
![Page 10: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/10.jpg)
10
The Density Control Algorithm
j node can receive the beacon and store to the two type set
A set j can hear i’s a-beacon i is older than j i is oldest among those whose
AB set J can hear I’s b-beacon but not hear a-beacon
![Page 11: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/11.jpg)
11
The Density Control Algorithm
(158,a,0) (143,b,0)
(158,a,-1)
(158,a,-2)
In the beacon interval the sensor will
broadcast the beacon with the vector
(time, root, level)
![Page 12: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/12.jpg)
12
Simulation Results
Language C Area : 100m x 100m Rc =20 meters Rs = 10 meters Beacon interval 100ms α= 0.7, 0.75, 0.8 and 0.85
![Page 13: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/13.jpg)
13
Simulation Results
Optimal hexagon-base deployment
: 42 sensors
The Algorithm : 51 sensors
The cover factor R = 51/42
= 1.21
![Page 14: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/14.jpg)
14
Simulation Results
![Page 15: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/15.jpg)
15
Simulation Results
![Page 16: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/16.jpg)
16
Conclusion
Under the assumption Rc ≥ 2Rs This paper propose the algorithm
Without location information Use two type beacons
Near beacon Far beacon
To approximate the optimal connected hexagonal deployment
![Page 17: Maintaining Connected Coverage for Wireless Sensor Networks](https://reader036.fdocuments.in/reader036/viewer/2022062516/56812ac5550346895d8e98b2/html5/thumbnails/17.jpg)
17
Thank you