Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]

Slides:



Advertisements
Similar presentations
Coverage in Wireless Sensor Network Phani Teja Kuruganti AICIP lab.
Advertisements

1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
4/29/2015 Wireless Sensor Networks COE 499 Deployment of Sensor Networks II Tarek Sheltami KFUPM CCSE COE
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Mobility Improves Coverage of Sensor Networks Benyuan Liu*, Peter Brass, Olivier Dousse, Philippe Nain, Don Towsley * Department of Computer Science University.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control II.
1 Distributed Navigation Algorithms for Sensor Networks Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri Dept. of Computer Science, University of.
1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.
Zoë Abrams, Ashish Goel, Serge Plotkin Stanford University Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks.
Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael DeRosa, and Daniela Rus Dartmouth College MOBICOM 2003.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
1 University of Denver Department of Mathematics Department of Computer Science.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
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.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
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.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
VLDB '2006 Haibo Hu (Hong Kong Baptist University, Hong Kong) Dik Lun Lee (Hong Kong University of Science and Technology, Hong Kong) Victor.
Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks Paper By: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder Presenter: Ke Gao Instructor:
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.
Maximum Lifetime Routing in Wireless Sensor Networks by Collins Adetu Nicole Powell Course: EEL 5784 Instructor: Dr. Ming Yu.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Simulation of DeReClus Yingyue Xu September 6, 2003.
DSN & SensorWare Projects Rockwell Science Center –Charles Chien UCLA –Mani Srivastava, Miodrag Potkonjak USC/ISI –Brian Schott, Bob Parker Virginia Tech.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Fundamentals of Computer Networks ECE 478/578
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
1 Power Efficient Monitoring Management in Sensor Networks A.Zelikovsky Georgia State joint work with P. BermanPennstate G. Calinescu Illinois IT C. Shah.
Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker : Shih-Yun.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
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.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Prof. Yu-Chee Tseng Department of Computer Science
Vineet Mittal Should more be added here Committee Members:
Dynamic Coverage In Wireless Ed-Hoc Sensor Networks
Introduction Wireless Ad-Hoc Network
Presentation transcript:

Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]

Sensor Network Coverage The Problem:  Given: Ad hoc sensor field with some number of nodes with known location Start and end positions of an agent  Want: How well can the field be observed? Example usage  Commander Weakest path: what path is the enemy likely to take?  Network manager Weakest path: where to deploy additional nodes for optimum coverage?  Soldier in the battlefield Strongest path: what path to take for maximum coverage by my command? Weakest path: how to walk through enemy sensor net or through minefield? GATEWAY MAIN SERVER CONTROL CENTER

Summary of Our Work Phase 1: distance to closest sensor [status: done, demonstrated]  Worst case coverage: Maximal Breach Path  Best case coverage: Maximal Support Path Phase 2: exposure to sensors [status: done, demonstrated]  Consider speed and distance  Worst case coverage: Minimal Exposure Path Phase 3: localized distributed algorithms [status: current, experimented]  Query from user roaming in the sensor field  Computation done by the nodes themselves  Only relevant sensor nodes involved in the computation Phase 4 [future]  Probability of detection and its relationship with density  Heterogeneous sensors  Terrain-specific measured or statistical exposure models

Closest Sensor Model: Maximal Breach Path Problem: find the path between I & F with the property that for any point p on the path the distance to the closest sensor is maximized Observation: maximal breach path lies on the Voronoi Diagram Lines  by construction each line segment maximizes the distance from the nearest point Given : Voronoi diagram D with vertex set V and line segment set L and sensors S Construct graph G(N,E): Each vertex v i  V corresponds to a node n i  N Each line segment l i  L corresponds to an edge e i  E Each edge e i  E, Weight(e i ) = Distance of l i from closest sensor s k  S Search for P B : Check for existence of I  F path using BFS  Search for path with maximal, minimum edge weights

Status Simulation  Demonstrated to Dr. Frank Fernandez in Spring 2000 Implementation  Centralized coverage server  Integrated with the SensIT GUI (V. Tech.) GUI passes node location Server reports back the desired path GUI displays sensor field coverage and breach paths GUI also displays other status (e.g. battery) and controls nodes (e.g. activate)  Part of the SITEX demonstration in Summer 2000 & Spring 2001 E.g.: Max Breach Path in a 50-node n/wVirginia Tech’s GUI

Exposure Model of Sensors Likelihood of detection by sensors is a function of time interval and distance from sensors. Minimal exposure paths indicate the worst case scenarios in a field:  Can be used as a metric for coverage Sensor detection coverage Also, for wireless (RF) transmission coverage

Exposure Model of Sensors (contd.) Sensing model S at an arbitrary point P for a sensor s where d(s,p) is the Euclidean distance between the sensor s and the point p, and positive constants and K are technology- and environment-dependent parameters. Effective sensing intensity at point p in the sensor field F  All sensors  Closest sensor  K closest sensor The Exposure for an object O in the sensor field during the interval [t 1,t 2 ] along the path p(t) is

Minimum Exposure Path Formulation Problem: find the path between two given points along which the exposure is smallest Example: minimum exposure for one sensor in a square field

Solution Approach General Case is analytically intractable Our approach: efficient and scalable method to approximate exposure integrals and search for Minimum Exposure paths  use a grid to approximate path exposures  exposure (weight) along each hrif edge approximated numerically  use Dijkstra’s Single-Source Shortest Path Algorithm on the weighted graph (grid) to find the Minimal Exposure Path  worst case search O(n 2 m) for a nxn grid with m divisions per edge cost dominated by grid construction Generalized grids provide improved accuracy by increasing grid divisions at the cost of higher storage and run-time

Status Centralized coverage server Integrated with the SensIT GUI (V. Tech.)  GUI passes node location, server reports back the desired path Part of the SITEX demonstration in Spring 2001 Example: 50 randomly deployed node with the all-sensor intensity model 8x8 m=1 Exposure: Length: x16 m=2 Exposure: Length: x32 m=8 Exposure: Length:1581.0

Problem? …. Centralized GATEWAY MAIN SERVER CONTROL CENTER

Solution? LocalizedDistributedAlgorithm

Localized Algorithms Solve a distributed optimization problems Take into account topology, available energy, power etc. Obtain only needed information and use it to guide optimization Take into account problem properties Problems: Numerical errors

Localized Exposure Voronoi Partitioning Advantages:  One sensor per Polygon  Node can calculate its VP by knowing only its immediate (Delaunay) neighbors  Smaller VP’s in high node density areas Drawbacks  One sensor potentially in charge of large area  Paths likely to be close to border edges  How to find Delaunay neighbors?  If node only knows locations of the Delaunay neighbors, then exposure calculation is not accurate

Localized Exposure (contd.) Each polygon edge has a corresponding Exposure Profile (EP) Can use different data structures to store EPs. EPs initialized to infinity Continuously updated in algorithm by keeping smaller values and discarding larger ones

Localized Exposure (contd.) Node s1 updates an EP e13 s1 sends update message to neighbor node s3 s3 computes new minimal exposure paths and updates all its EPs. s3 sends appropriate EP update messages to corresponding neighbors

Localized Exposure (contd.) Algorithm stops when  Each EP at the search boundary is larger than the specified termination condition (parameter indicating bound on exposure) Specified by the algorithm at first Periodically set to exposure at destination point during the optimization process (broadcast)  No more edge updates (EP)  Guaranteed to converge since exposure is always increasing. Message types  Path_request: Node s i receives a request from an agent to find P minE from I to D.  Edge_update: Node s i receives an update notification from a neighbor to continue search for P minE (I,D).  Abort_update: Aborting conditions notification.  Dest_update: Destination reached notification

Some Simulation Results

Status Initial implementation on Sensoria’s WINS nodes  “Coverage Server” at each node  Listens for user query request for minimum exposure path  Participates in distributed computation  Limitations/issues one query at a time uses an id-based addressing/routing emulated on top of diffusion Conducted experiments at SITEX demo on November 12, 2001  largest experiment: cluster off 22 nodes allocated 41, 42, 50, 51,  worked, but radio hanging problems on the nodes forced using the control ethernet for inter-node communication

Results from SITEX Experiments 22 nodes allocated 41, 42, 50, 51, 53-70

Results from SITEX Experiments Localized Implementation Optimum (Simulated)

Results from SITEX Experiments Localized Implementation Optimum (Simulated)

Results from SITEX Experiments Localized Implementation Optimum (Simulated)