1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Introduction to Algorithms 6.046J/18.401J/SMA5503
Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
ZMQS ZMQS
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
1 Column Generation. 2 Outline trim loss problem different formulations column generation the trim loss problem master problem and subproblem in column.
ABC Technology Project
Shadow Prices vs. Vickrey Prices in Multipath Routing Parthasarathy Ramanujam, Zongpeng Li and Lisa Higham University of Calgary Presented by Ajay Gopinathan.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.
Squares and Square Root WALK. Solve each problem REVIEW:
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
1 Modeling and Simulation: Exploring Dynamic System Behaviour Chapter9 Optimization.
Scalable and Dynamic Quorum Systems Moni Naor & Udi Wieder The Weizmann Institute of Science.
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Addition 1’s to 20.
25 seconds left…...
Complexity ©D.Moshkovits 1 Where Can We Draw The Line? On the Hardness of Satisfiability Problems.
Week 1.
We will resume in: 25 Minutes.
Rizwan Rehman Centre for Computer Studies Dibrugarh University
1 Unit 1 Kinematics Chapter 1 Day
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
Coverage in Wireless Sensor Network Phani Teja Kuruganti AICIP lab.
Worst & Best-Case Coverage in Sensors Networks DEC 2004 Presented by: Eugene Khokhlov (847) Seapahn Megerian Ph.D. UCLA.
Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks Gagan Raj Gupta Post-Doctoral Research Associate with the Parallel.
all-pairs shortest paths in undirected graphs
1 ECE 776 Project Information-theoretic Approaches for Sensor Selection and Placement in Sensor Networks for Target Localization and Tracking Renita Machado.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
4/29/2015 Wireless Sensor Networks COE 499 Deployment of Sensor Networks II Tarek Sheltami KFUPM CCSE COE
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
Coverage Preserving Redundancy Elimination in Sensor Networks Bogdan Carbunar, Ananth Grama, Jan Vitek Computer Sciences Department Purdue University West.
Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]
Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
Sensor network coverage Ref: 1.Seapahn Megerian et al., “Worst and best-case coverage in sensor networks” 2.Chi-Fu Huang and Yu-Chee Tseng, “The coverage.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
The Coverage Problem in Wireless Ad Hoc Sensor Networks Supervisor: Prof. Sanjay Srivastava By, Rucha Kulkarni
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
On Graphs Supporting Greedy Forwarding for Directional Wireless Networks W. Si, B. Scholz, G. Mao, R. Boreli, et al. University of Western Sydney National.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Coverage In Wireless Ad-Hoc Sensor Networks Shimon Tal Sion Cohen Instructor: Dr. Michael Segal.
Coverage and Deployment 1. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe.
Outline Introduction Network Model and Problem Formulation
Worst & Best-Case Coverage in Sensors Networks DEC 2004
Survey on Coverage Problems in Wireless Sensor Networks - 2
Presentation transcript:

1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS ON MOBILE COMPUTING, 2005 Presented by Cheng-Ta Lee 11/17/2009

2/22 Outlines  Introduction  Preliminaries  Stochastic Coverage Worst-case Coverage and Maximal Breach Path Best-case Coverage and Maximal Support Path  Experimental Results  Conclusion  Future Works

3/22 Introduction  In general, coverage can be considered as a measure of the quality of service of a sensor network.  Furthermore, coverage formulations can try to find weak points in a sensor field and suggest future deployment or reconfiguration schemes for improving the overall quality of service.  By using best and worst-case coverage information as heuristics to deploy sensors to improve coverage.

4/22 Preliminaries  Computational Geometry Voronoi Diagram Delaunay Triangulation

5/22 Stochastic Coverage  In the simulation studies for this paper, authors have generally assumed uniform sensor distribution.  Given: A field A. Sensors S, where for each sensor s i S, the location (x i,y i ) is known. Areas I and F corresponding to initial (I) and final (F) locations of an agent.

6/22 Worst-case Coverage and Maximal Breach Path (maxmin) (1/6)  Definition: Breach. Given a path P connecting areas I and F, breach is defined as the minimum Euclidean distance from P to any sensor in S.  Problem: Maximal Breach Path. P B is defined as a path through the field A, with end- points I and F and with the property that for any point p on the path P B, the distance from p to the closest sensor is maximized, thus the P B must lie on the line segments of the Voronoi diagram.  Theorem 1. At least one Maximal Breach Path must lie on the line segments of the bounded Voronoi diagram formed by the locations of the sensors in S.

7/22 Worst-case Coverage and Maximal Breach Path (2/6)  The following steps outline the algorithm for finding P B : 1. Generate Voronoi diagram D for S. 2. Apply graph theoretic abstraction by transforming D to a weighted graph. 3. Find P B using binary-search and breadth-first- search.

8/22

9/22 Worst-case Coverage and Maximal Breach Path (4/6)

10/22 Worst-case Coverage and Maximal Breach Path (5/6)

11/22 Worst-case Coverage and Maximal Breach Path (6/6)  The complexities of the subalgorithms For generating the Voronoi diagram, O(n log(n)), where n is the number of vertex. For BFS O(log(m)) where m is the number of edges. For binary search O(log(range)).

12/22 Best-case Coverage and Maximal Support Path (minmax) (1/3)  Definition: Support. Given a path P connecting areas I and F, support is defined as the maximum Euclidean distance from the path P to the closest sensor in S.  Problem. Maximal Support Path. P S is defined as a path through the field A, with end- points I and F and with the property that for any point p on the path P S, the distance from p to the closest sensor is minimized.  Theorem 2. At least one Maximal Support Path must lie on the edges of the Delaunay triangulation (with the exceptions of the start and end points connecting P S to I and F).

13/22 Best-case Coverage and Maximal Support Path (2/3)  The algorithm for finding P S is very similar to the breach algorithm above, with the following exceptions: 1. The Voronoi diagram is replaced by the Delaunay triangulation as the underlying geometric structure. 2. Each edge in graph G is assigned a weight equal to the largest distance from the corresponding line segment in the Delaunay triangulation to the closest sensor. 3. The search parameter breach_weight is replaced by the new parameter support_weight and the search is conducted in such a way that support_weight is minimized.

14/22 Best-case Coverage and Maximal Support Path (3/3)

15/22 Experimental Results (1/3) If new sensors can be deployed or existing sensors moved such that this breach_weight is decreased, then the worst-case coverage is improved.

16/22 Experimental Results (2/3) If additional sensors can be deployed or existing sensors moved such that support_weight is decreased, then the best-case coverage is improved.

17/22 Experimental Results (3/3)

18/22 Conclusion  Authors presented best and worst-case formulations for sensor coverage in wireless ad hoc sensor networks.  An optimal polynomial time algorithm that uses graph theoretic and computational geometry constructs was proposed for solving for best and worst-case coverages Maximal Breach Path (worst-case coverage) Maximal Support Path (best-case coverage)  Additional sensor deployment heuristics to improve coverage.

19/22 Future Works  In practice, other factors influence coverage such as Obstacles nonhomogeneous sensors  Authors have introduced heuristics based on this coverage model that may perform well for single-sensor deployment, it is interesting to investigate methods of optimally deploying multiple sensors at a time.

20/22 References  SeapahnMeguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani B. Srivastava, ” Coverage Problems in Wireless Ad-hoc Sensor Networks, ” IEEE INFOCOM  Laura Kneckt, ” Summary of Coverage Problems in Wireless Ad-hoc Sensor Networks, ” 2005.

21/22 Q & A