Presentation is loading. Please wait.

Presentation is loading. Please wait.

Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun,

Published byAlban Stevens Modified over 8 years ago

Similar presentations

Presentation on theme: "Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun,"— Presentation transcript:

1 Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun, Weijia Jia Computer Science and Engineering The Ohio State University, USA Department of Mathematics Suzhou University, CHINA Department of Computer Science City University of Hong Kong, CHINA ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008 YearSubmittedAccepted% Accepted 2006318319.75% 20071462718.5% 20083004414.7%

2 Outline IntroductionThe proposed patternsNumerical resultsConclusion

3 Introduction Wireless sensor networks show more and more popularity for both military and civil applications.

4 Introduction Wireless sensor networks show more and more popularity for both military and civil applications. –Noxious Gas Detection

5 Introduction Wireless sensor networks show more and more popularity for both military and civil applications. –Fire Detection

6 The deployment is a fundamental issue in Wireless Sensor Networks (WSNs) that affects many facts for these applications. There are two categories of deployments in WSNs. –Random deployment –Deterministic deployment Introduction

7 RsRs

8 Achieve 6-connectivity only when r c ≧ RsRs A

9 The work on exploring optimal patterns in WSNs is not yet complete. –3-connected –5-connected –6-connected when R c / R s < The previous exploration on optimal patterns has not yet been conducted systematically. Introduction

10 Goal Propose deployment patterns systematically. –Achieve full coverage and k-connectivity (k ≦ 6) under different ratios of sensor communication range over sensing range.

11 Deployment Patterns Universal elemental patternk=3k=4k=5k=6 k=1 or k=2

12 Deployment Patterns - Universal elemental pattern θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

13 θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

14 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s

15 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=15, Rs=20 :  1 = 120 °,  2 = 120 °,  3 = 120 °, d 1 =15, d 2 =15 120° 15

16 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=25, Rs=20 :  1 = 154.73 °,  2 = 102.64°,  3 = 102.64°, d 1 =25, d 2 =25 154.73° 102.64° 154.73° 102.64° 25

17 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=28.284, Rs=20 :  1 = 180°,  2 = 90°,  3 = 90°, d 1 =28.284, d 2 =28.284 180° 90° 180°90° 28.284

18 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=32, Rs=20 :  1 = 180°,  2 = 106.26°,  3 = 73.74°, d 1 = 32, d 2 = 32 180° 106.26°73.74° 180°106.26 °73.74° 32

19 Deployment Patterns – 3-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=40, Rs=20 :  1 = 180°,  2 = 120°,  3 = 60°, d 1 = 34.641, d 2 = 34.641 180° 120°60° 180° 120 °60° 34.641

20 Deployment Patterns – 4-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s

21 Deployment Patterns – 4-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s ≦ √2 √2 < R c / R s < √3 √3 ≦ R c / R s 180° 90° 180°90° RcRc RcRc RcRc RcRc RcRc RcRc

22 Deployment Patterns – 4-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=32, Rs=20 :  1 = 180°,  2 = 106.26°,  3 = 73.74°, d 1 = 32, d 2 = 32 180° 106.26°73.74° 180°106.26 °73.74° 32

23 Deployment Patterns – 4-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=40, Rs=20 :  1 = 180°,  2 = 120°,  3 = 60°, d 1 = 34.641, d 2 = 34.641 180° 120°60° 180° 120 °60° 34.641

24 Deployment Patterns – 5-connectivity R c / R s ≦ √2 √2 < R c / R s < √3 √3 ≦ R c / R s θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

25 Deployment Patterns – 5-connectivity R c / R s ≦ √2 √2 < R c / R s < √3 √3 ≦ R c / R s 150° 60° 150° 60° RcRc RcRc RcRc RcRc RcRc RcRc θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

26 Deployment Patterns – 5-connectivity R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=32, Rs=20 :  1 = 60 °,  2 = 166.26°,  3 = 133.74°, d 1 = 32, d 2 = 32 60° 166.24° 133.74° 60° 166.26 ° 133.74° 32 θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

27 Deployment Patterns – 5-connectivity R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=40, Rs=20 :  1 = 60°,  2 = 180°,  3 = 120°, d 1 = 34.641, d 2 = 34.641 60° 180° 120° 60° 180 ° 120° 34.641 θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2

28 Deployment Patterns – 6-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < √3 √3 ≦ R c / R s

29 Deployment Patterns – 6-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 180° 120°60° 180° 120°60° RcRc RcRc RcRc RcRc RcRc RcRc R c / R s < √3 √3 ≦ R c / R s

30 Deployment Patterns – 6-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 180° 120°60° 180° 120°60° RsRs RsRs RsRs RsRs RsRs RsRs R c / R s < √3 √3 ≦ R c / R s

31 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s

32 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=15, Rs=20 :  1 = 180°,  2 =78.779°,  3 =101.22°, d 1 =15, d 2 =39.263 180°78.779°101.22° 180°78.779°101.22° 15 39.263

33 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=25, Rs=20 :  1 = 180°,  2 = 69.451°,  3 = 110.55°, d 1 =25, d 2 =37.743 180°69.450°110.55° 180° 69.451°110.55° 25 37.743

34 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=28.284, Rs=20 :  1 = 180°,  2 = 65.53°,  3 = 114.47°, d 1 =28.284, d 2 =36.955 180°65.53°114.47° 28.284 36.955 114.47° 180° 65.53° 28.284 36.955

35 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=32, Rs=20 :  1 = 180°,  2 = 60°,  3 = 120°, d 1 = 32, d 2 = 35.777 180°60°120° 32 35.777 120° 180° 60° 32 35.777

36 Deployment Patterns – 1 or 2-connectivity θ1θ1 θ1θ1 θ2θ2 θ2θ2 θ3θ3 θ3θ3 d1d1 d1d1 d1d1 d1d1 d2d2 d2d2 R c / R s < 1 1 ≦ R c / R s < √2 R c / R s = √2 √2 < R c / R s < √3 √3 ≦ R c / R s Rc=39, Rs=20 :  1 = 180°,  2 = 37.085°,  3 = 142.91°, d 1 = 34.641, d 2 = 34.641 180° 37.085°142.91° 34.641 142.91° 180° 37.085° 34.641

37 Deployment Patterns

38 Numerical Results Parameters SimulatorUnknow Size of network1000*1000 m Sensing range30 m Communication range20~60 m

39 Numerical Results

40 Conclusion This paper propose deployment patterns systematically. –Achieve full coverage and k-connectivity (k ≦ 6) under different ratios of sensor communication range over sensing range.

41

Download ppt "Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun,"

Similar presentations

1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.

1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,

Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
An Energy-Efficient Communication Scheme in Wireless Cable Sensor Networks Xiao Chen Neil C. Rowe epartment of Computer Science Department of Computer Science.

An Energy-Efficient Communication Scheme in Wireless Cable Sensor Networks Xiao Chen Neil C. Rowe epartment of Computer Science Department of Computer Science.
GPS-Free Node Localization in Mobile Wireless Sensor Networks H¨useyin Akcan 1, Vassil Kriakov 1,Herv´e Br¨onnimann 1, Alex Delis 2 1 CIS Department Polytechnic.

GPS-Free Node Localization in Mobile Wireless Sensor Networks H¨useyin Akcan 1, Vassil Kriakov 1,Herv´e Br¨onnimann 1, Alex Delis 2 1 CIS Department Polytechnic.
General Description Coverage-Preserving Routing Protocol for WSNs Distributed, power-balanced multi- hop routing protocol Coverage-preserving based route-

General Description Coverage-Preserving Routing Protocol for WSNs Distributed, power-balanced multi- hop routing protocol Coverage-preserving based route-
Joint Access Point Placement and Channel Assignment for 802.11 Wireless LANs Xiang Ling School of Communication and Information Engineering University.

Joint Access Point Placement and Channel Assignment for Wireless LANs Xiang Ling School of Communication and Information Engineering University.
Secrecy Capacity Scaling of Large-Scale Cognitive Networks Yitao Chen 1, Jinbei Zhang 1, Xinbing Wang 1, Xiaohua Tian 1, Weijie Wu 1, Fan Fu 2, Chee Wei.

Secrecy Capacity Scaling of Large-Scale Cognitive Networks Yitao Chen 1, Jinbei Zhang 1, Xinbing Wang 1, Xiaohua Tian 1, Weijie Wu 1, Fan Fu 2, Chee Wei.
Coverage Preserving Redundancy Elimination in Sensor Networks Bogdan Carbunar, Ananth Grama, Jan Vitek Computer Sciences Department Purdue University West.

Coverage Preserving Redundancy Elimination in Sensor Networks Bogdan Carbunar, Ananth Grama, Jan Vitek Computer Sciences Department Purdue University West.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.

1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks Xiao Wang, Xinbing Wang, Jun Zhao Department of Electronic.

Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks Xiao Wang, Xinbing Wang, Jun Zhao Department of Electronic.
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,

1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
Data Fusion Improves the Coverage of Wireless Sensor Networks Guoliang Xing 1, Rui Tan 2, Benyuan Liu 3, Jianping Wang 2, Xiaohua Jia 2,Chih-wei Yi 4 1.

Data Fusion Improves the Coverage of Wireless Sensor Networks Guoliang Xing 1, Rui Tan 2, Benyuan Liu 3, Jianping Wang 2, Xiaohua Jia 2,Chih-wei Yi 4 1.
T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering 1 Wenjun Gu, Xiaole Bai, Sriram Chellappan and Dong Xuan Presented by Wenjun.

T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering 1 Wenjun Gu, Xiaole Bai, Sriram Chellappan and Dong Xuan Presented by Wenjun.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.

Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
EWSN 04 – Berlin, Jan. 20, 2004 Silence is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks Paolo Santi* Janos.

EWSN 04 – Berlin, Jan. 20, 2004 Silence is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks Paolo Santi* Janos.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.

1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
CS Dept, City Univ.1 Research Issues in Wireless Sensor Networks Prof. Xiaohua Jia Dept. of Computer Science City University of Hong Kong.

CS Dept, City Univ.1 Research Issues in Wireless Sensor Networks Prof. Xiaohua Jia Dept. of Computer Science City University of Hong Kong.

Similar presentations

Ads by Google