1 Hidden Markov Model Xiaole Shirley Liu STAT115, STAT215, BIO298, BIST520.
1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*,...
-
Upload
baldric-manning -
Category
Documents
-
view
216 -
download
1
Transcript of 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*,...
![Page 1: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/1.jpg)
1
Deploying Wireless Sensors to Achieve Both Coverage and Connectivity
Xiaole Bai* , Santosh Kumar* , Dong Xuan* ,
Ziqiu Yun+ , Ten H. Lai*
* Computer Science and Engineering The Ohio State University USA
+ Department of Mathematics, Suzhou University P.R.CHINA
![Page 2: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/2.jpg)
2
The Optimal Connectivity and Coverage
Problem What is the optimal number of sensors needed to
achieve p-coverage and q-connectivity in WSNs? An important problem in WSNs:
Connectivity is for information transmission and coverage is for information collection
To save cost To help design topology control algorithms and protocol
s; other practical benefits
The Ohio State University
![Page 3: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/3.jpg)
3
Outline
p-coverage and q-connectivity Previous work Main results
On optimal patterns to achieve coverage and connectivity
On regular patterns to achieve coverage and connectivity
Future work Conclusion
The Ohio State University
![Page 4: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/4.jpg)
4
p- Coverage and q-Connectivity
q-connectivity: there are at least q disjoint paths between any two sensors
p-coverage: every point in the plane is covered by at least p different sensors
rs
rc
Node ANode B
For example, nodes A, B, C andD are two connected
Node C
Node D
The Ohio State University
![Page 5: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/5.jpg)
5
Relationship between rs and rc
Most existing work is focused on In reality, there are various values of
sc rr 3
The reliable communication range of the Extreme Scale Mote (XSM) platform is 30 m and the sensing range of the acoustics sensor for detecting an All Terrain Vehicle is 55 m
Sometimes even when it is claimed for a sensor platform to have , it may not hold in practice because the reliable communication range is often 60-80% of the claimed value
sc rr /
sc rr 3
The Ohio State University
![Page 6: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/6.jpg)
6
Previous Work
Research on Asymptotically Optimal Number of Nodes
[1] R. Kershner. The number of circles covering a set. American Journal of Mathematics, 61:665–671, 1939, reproved by Zhang and Hou recently.[2] R. Iyengar, K. Kar, and S. Banerjee. Low-coordination topologies for redundancy in sensor networks. MobiHoc2005.
The Ohio State University
![Page 7: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/7.jpg)
7
Well Known Results: Triangle Lattice Pattern [1] sc rr 3
sr3
4
22 ss rr
We notice it actually achieves 1-coverage and 6-connectivity.
The Ohio State University
sr2
3
![Page 8: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/8.jpg)
8
Strip-based Pattern
sc rr 3,min
4
22 ss rr
/2
In [2], the strip-based pattern is showed to be close to the optimaldeployment pattern when rc = rs in terms of number of nodes needed.
The Ohio State University
sc rr 3
![Page 9: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/9.jpg)
9
Our Focuses
Research on Asymptotically Optimal Number of Nodes
OUR WORK
The Ohio State University
![Page 10: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/10.jpg)
10
Our Main Results
1-connectvity: We prove that a strip-based deployment pattern is asymptotically optimal for achieving both 1-coverage and 1-connectivity for all values of rc and rs
2-connectvity: We also prove that a slight modification of this pattern is asymptotically optimal for achieving 1-coverage and 2-connectivity
Triangle lattice pattern can be considered as a special case of strip-based deployment pattern
The Ohio State University
![Page 11: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/11.jpg)
11
Theorem on Minimum Number of Nodes for 1-Connectivity
The Ohio State University
![Page 12: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/12.jpg)
12
Sketch of the proof : basic ideas for both 1-connectivity and 2-connectivity
1.
2.
3. Prove the upper bound by construction
We show that, when 1-connectivity is achieved, the whole area is maximized when the Voronoi Polygon for each sensor is a hexagon.
We get the lower bound:
The Ohio State University
![Page 13: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/13.jpg)
13
Place enough disks between the strips to connect them See the paper for a
precise expression The number is disks
needed is negligible asymptotically
sc rr 3,min 4
22 ss rr
Our Optimal Pattern for 1-Connectivity
Note : it may be not the only possible deployment pattern
The Ohio State University
![Page 14: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/14.jpg)
14
Theorem on Minimum Number of Nodes for 2-Connectivity
The Ohio State University
![Page 15: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/15.jpg)
15
Connect the neighboring horizontal strips at its two ends
sc rr 3,min
4
22 ss rr
Our Optimal Pattern for 2-Connectivity
Note : it may be not the only possible deployment pattern
The Ohio State University
![Page 16: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/16.jpg)
16
Regular Patterns
The Ohio State University
Triangular Lattice (can achieve 6 connectivity)
Square Grid (can achieve 4 connectivity)
Hexagonal (can achieve 3 connectivity)
Rhombus Grid (can achieve 4 connectivity)
![Page 17: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/17.jpg)
17
Efficiency of Regular Patterns
The Ohio State University
![Page 18: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/18.jpg)
18
Efficiency of Regular Patterns to Achieve Coverage and Connectivity
The Ohio State University
![Page 19: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/19.jpg)
19
More general optimal number of sensors needed to achieve p-coverage and q-connectivity
Irregular sensing and communication range
Future work
The Ohio State University
![Page 20: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/20.jpg)
20
Conclusions Proved the optimality of the strip-based deployment patt
ern for achieving both coverage and connectivity in WSNs (For proof details, please see our paper)
Different regular patterns are the best in different communication and sensing range.
The results have applications to the design and deployment of wireless sensor networks
The problem of finding an optimal pattern that achieves p-coverage and q-connectivity is still open for general values of p and q. Optimal problems for irregular sensing and communication range are more challenging
The Ohio State University
![Page 21: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/21.jpg)
21
Thank You!
The Ohio State University
![Page 22: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/22.jpg)
22
“q-connectivity (for a general q) problem is very easy?”
1 connectivity 2 connectivity q vertical lines q-connectivity?
The Ohio State University
![Page 23: 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.](https://reader036.fdocuments.net/reader036/viewer/2022062517/56649f2c5503460f94c46fb1/html5/thumbnails/23.jpg)
23
Efficiency of Regular Patterns to Achieve Coverage and Connectivity
can achieve4 connectivity
The Ohio State University