/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio.

Slides:



Advertisements
Similar presentations
Wireless Sensor Placement for Reliable and Efficient Data Collection Edo Biagioni and Galen Sasaki University of Hawaii at Manoa.
Advertisements

Let’s review our shapes….
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Geometry 5 Level 1. Interior angles in a triangle.
Regular Polygons. Introduction A Polygon is a many-sided shape. A Regular Polygon is a many-sided shape with all sides and angles the same. An important.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
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.
Randomized k-Coverage Algorithms for Dense Sensor Networks
Three-Dimensional Broadcasting with Optimized Transmission Efficiency in Wireless Networks Yung-Liang Lai and Jehn-Ruey Jiang National Central University.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 19th Lecture Christian Schindelhauer.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Data Flow and Random Placement.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
Outcome F Quadrilaterals
Department of Computer Science and Engineering The Ohio State University Key Student Collaborator: Xiaole Bai and Jin.
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Triangles Polygons Similar or Congruent?
Using Rotatable and Directional (R&D) Sensors to Achieve Temporal Coverage of Objects and Its Surveillance Application You-Chiun Wang, Yung-Fu Chen, and.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Miao Zhao, Ming Ma and Yuanyuan Yang
Localization With Mobile Anchor Points in Wireless Sensor Networks
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Introduction to congruent angles
The Chinese Univ. of Hong Kong Dept. of Computer Science & Engineering A Point-Distribution Index and Its Application to Sensor Grouping Problem Y. Zhou.
Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.
Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.
Areas of Regular Polygons Section Theorem 11.3 Area of an Equilateral Triangle: The area of an EQUILATERAL triangle is one fourth the square of.
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai*, Santosh Kumar*, Dong Xuan*, Ziqiu Yun +, Ten H. Lai* * Computer Science.
KAIS T Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai, Santosh Kumar, Dong Xuan, Ziqiu Yun and Ten H.Lai MobiHoc 2006.
Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.
APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.
A polygon is a closed figure made by joining line segments, where each line segment intersects exactly two others. Polygons.
Barrier Coverage With Wireless Sensors
Ai Chen, Ten H. Lai, Dong Xuan Department of Computer Science and Engineering The Ohio State University Columbus Measuring and Guaranteeing Quality of.
Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Barrier Coverage With Wireless Sensors Santosh Kumar, Ten H. Lai, Anish Arora The Ohio State University Presented at Mobicom 2005.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
Barrier Coverage in Camera Sensor Networks ACM MobiHoc 2011 Yi Wang Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun,
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
4.5 – Prove Triangles Congruent by ASA and AAS In a polygon, the side connecting the vertices of two angles is the included side. Given two angle measures.
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in WSNs Azzedine Boukerche, Xin Fei PARADISE Research Lab Univeristy.
The Interior Angles of Polygons. Sum of the interior angles in a polygon We’ve seen that a quadrilateral can be divided into two triangles … … and a pentagon.
A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.
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 1 Sriram Chellappan, Xiaole Bai, Bin Ma ‡ and Dong Xuan Presented by Sriram.
Types of Polygons Polygon- a flat closed figure made of straight line segments Circle the figures that are polygons. Cross out the figures 
that are.
Xiaobing Wu, Guihai Chen and Sajal K. Das
Dynamic Coverage In Wireless Ed-Hoc Sensor Networks
Cincinnati’s Proof Given an equilateral triangle and any interior point, the perpendicular segments from the point to any sides sum will be constant.
The Coverage Problem in a Wireless Sensor Network
Standards:.
Strong Barrier Coverage of Wireless Sensor Networks Seung Oh Kang
Presentation transcript:

/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio State University MobiHoc 2006

/ 24 2 Outline Introduction Deployment Model Assumptions and Definitions Proof of Optimality Conclusion

/ 24 3 Motivations Consideration of coverage alone is no longer enough Having a wireless sensor network just 1-connected is not much useful in practice

/ 24 4 Goal To design and prove the asymptotic optimality of both coverage and 2-connectivity for all values of r c /r s

/ 24 5 Deployment Model (Strip-based deployment ) connective a b

/ 24 6 Regular Deployment Hexagon Square RhombusTriangular

/ 24 7 Assumptions Both the sensing and communication ranges are regular disks All sensors have the same communication and sensing ranges

/ 24 8 Definitions (1) : The sensing disk of node u : The communication disk of node u : The distance between node u and v Area Per Node (APN) : The area of the vonoroi cell per node

/ 24 9 Definitions (2) Connected Neighboring Sensors : The sensing disks of node u and v are intersected l : Minimum length of connection chord φ: Minimum angle of connection angle uv Sensing disk Connection chord Connection angle

/ Optimal deployed number of nodes Evaluate A k,2, k>2 – Regular polygon – Semi-regular polygon Evaluate number of deployed nodes

/ A k,2 uv Sensing disk Connection chord Connection angle Regular Polygon Semi-regular Polygon

/ A k,2 (regular polygon) b a

/ A k,2 (semi-regular polygon) b φ a

/ A k,2 k = 6

/ Different Regular Deployment Patterns Hexagon Square Rhombus Equilateral triangle

/ Maximum APN For The Hexagon-Based Topology ab p

/ Maximum APN For Different Patterns

/ Maximum APN For The Rhombus-Based Topology d bc a θ θ = 90° Square topology d(a, c) ≤ r c Triangle topology ( θ ≤ 60 ° )

/ Maximum APN For The Rhombus-Based Topology

/ Maximum APN

/ The Proof of

/ Compare Different Patterns with Optimal

/ Conclusion A strip-based deployment pattern to achieve coverage and 2-connectivity, and proved its optimality Established the efficiency of popular regular patterns of deployment

/ Thank You !