Optimizing Query Processing In Sensor Networks Ross Rosemark.

Slides:



Advertisements
Similar presentations
Energy-efficient distributed algorithms for wireless ad hoc networks Ramki Gummadi (MIT)
Advertisements

Eiman Elnahrawy WSNA’03 Cleaning and Querying Noisy Sensors Eiman Elnahrawy and Badri Nath Rutgers University WSNA September 2003 This work was supported.
Distributed Assignment of Encoded MAC Addresses in Sensor Networks By Curt Schcurgers Gautam Kulkarni Mani Srivastava Presented By Charuka Silva.
Scalable Content-Addressable Network Lintao Liu
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin LECS – UCLA Modified and Presented by Sugata Hazarika.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
1 Snapshot Queries: Towards Data- Centric Sensor Networks Yannis Kotidis AT&T Labs-Research ICDE 2005.
Multi-dimensional Range Query in Sensor Networks Xin Li,Young Jim Kim, Ramesh Govindan (University of Southern California ) Wei Hong (Intel Research Lab.
Aggregation in Sensor Networks NEST Weekly Meeting Sam Madden Rob Szewczyk 10/4/01.
Geographic Gossip: Efficient Aggregations for Sensor Networks Author: Alex Dimakis, Anand Sarwate, Martin Wainwright University: UC Berkeley Venue: IPSN.
A Survey of Wireless Sensor Network Data Collection Schemes by Brett Wilson.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented by Cuong Le (CPSC538A)
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Ad-Hoc Query Processing Architecture Ross Rosemark.
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks Shan-Hung Wu Kun-Ta Chuang Chung-Min Chen Ming-Syan Chen.
CS Dept, City Univ.1 Research Issues in Wireless Sensor Networks Prof. Xiaohua Jia Dept. of Computer Science City University of Hong Kong.
GIS Analysis. Questions to answer Position – what is here? Condition – where are …? Trends – what has changed? Pattern – what spatial patterns exist?
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Paper By : Samuel Madden, Michael J. Franklin, Joseph Hellerstein, and Wei Hong Instructor :
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
March 6th, 2008Andrew Ofstad ECE 256, Spring 2008 TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden, Michael J. Franklin, Joseph.
Geographic Hash Table S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin and F. Yu.
Sensor Database System Sultan Alhazmi
Tufts University. EE194-WIR Wireless Sensor Networks. March 3, 2005 Increased QoS through a Degraded Channel using a Cross-Layered HARQ Protocol Elliot.
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
Query Processing over a Sensor Network Cornell University Johannes Gehrke Philippe Bonnet.
Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Network Layer4-1 Distance Vector: link cost changes Link cost changes: r node detects local link cost change r updates distance table (line 15) r if cost.
Query Aggregation for Providing Efficient Data Services in Sensor Networks Wei Yu *, Thang Nam Le +, Dong Xuan + and Wei Zhao * * Computer Science Department.
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Eddies: Continuously Adaptive Query Processing Ross Rosemark.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
 Tree in Sensor Network Patrick Y.H. Cheung, and Nicholas F. Maxemchuk, Fellow, IEEE 3 rd New York Metro Area Networking Workshop (NYMAN 2003)
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
In-Network Query Processing on Heterogeneous Hardware Martin Lukac*†, Harkirat Singh*, Mark Yarvis*, Nithya Ramanathan*† *Intel.
Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,
Topology Management -- Power Efficient Spatial Query Presented by Weihang jiang.
REED : Robust, Efficient Filtering and Event Detection in Sensor Network Daniel J. Abadi, Samuel Madden, Wolfgang Lindner Proceedings of the 31st VLDB.
Building Wireless Efficient Sensor Networks with Low-Level Naming J. Heihmann, F.Silva, C. Intanagonwiwat, R.Govindan, D. Estrin, D. Ganesan Presentation.
The Design of an Acquisitional Query Processor For Sensor Networks Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong Presentation.
16장. Networking and Internetworking Devices
Introduction to Wireless Sensor Networks
Distributed database approach,
Efficient Join Query Evaluation in a Parallel Database System
Wireless Sensor Network Architectures
A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks
Routing in Packet Networks Shortest Path Routing
Routing Metrics for Wireless Mesh Networks
Divide Areas Algorithm For Optimal Multi-Robot Coverage Path Planning
A Survey on Routing Protocols for Wireless Sensor Networks
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Optimizing Query Processing In Sensor Networks Ross Rosemark

Our Research We argue that the sensor network can be viewed as a database where each node is a table. –Under this view.. we argue that a query plan can now dictate how to abstract data from the sensor network rather than a sensor node.

Our Goal Given a query Q2 –Define how to process the query What metadata (if any) should be collected What query plan should a node utilize to abstract data from it’s local sensors What is the routing infrastructure of the query Example –Given Q2 Define cost of –Collecting metadata + Execution Cost + Routing cost Define cost of –Not collecting metadata + execution cost + routing cost Choose the lowest cost

Idea Evaluate multiple different infrastructures for a query Choose the infrastructure that utilizes the least energy The * operator means aggregation –Not database aggregation (i.e. Sum, Count) but rather aggregation that is discussed in networks

Research Issue We use metadata to evaluate different query plans –Metadata becomes an important research issue Which nodes should send metadata to the AP What metadata does the AP require We do an on demand approach in terms of collecting metadata

Metadata Collection Algorithm to collect metadata –Only nodes participating in query send metadata Algorithm –Access Point routes query to spatial area utilizing GPSR –Utilizing GPSR query is routed around spatial area –Each node on perimeter of spatial area floods msg inside spatial area –Each node in spatial area sends metadata to the AP utilizing GPSR

Metadata For a given query Q1 Initially the access point knows: –The number of nodes in the network (N) –The spatial area of the network (SA) –The query area (QA)…. (we only consider spatial queries) –A histogram that represents the selectivity of each attribute Bad representation –Using this information Query Plan 1 –Estimate metadata collection cost –Estimate query execution cost if metadata is collected –Estimate result collection cost Query Plan 2 –Estimate query execution cost if metadata is not collected –Estimate result collection cost if metadata is not collected –If (Query Plan 1 > Query Plan 2) Choose Query Plan 1 –Else Choose Query Plan 2

Metadata Collection When metadata is collected –nodes participating in a query send the selectivity of each of the queries predicates It’s longitude and latitude Example –Query 1-> Select * From Sensors Where Light > 10 –Node participating in query send the selectivity of the predicate Light > 10 –Node participating in query send Longitude/Latitude (i.e. Longitude = Latitude =

Metadata If query 2 now comes in and covers the same/subset of the spatial area of query 1 then we evaluate the following: –Should we collect more metadata, or just optimize with our current metadata Estimate the metadata collection cost Estimate query execution cost Estimate routing cost This is a repeat of the initial problem –Our estimates are now better though

Results Estimated mathematically the energy associated with –Metadata collection –Query Execution Ran simulations to get real values for these metrics In simulations inserted 1 spatial query into the network Ran this experiment varying –The query (spatial area) (predicates) –Topology (5 different topologies) –Metadata (5 different metadata distributions)

Query Execution.

Metadata Collection

Total

Questions?