1 TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden UC Berkeley with Michael Franklin, Joseph Hellerstein, and Wei Hong December.

Slides:



Advertisements
Similar presentations
한국기술교육대학교 컴퓨터 공학 김홍연 TinyDB : An Acquisitional Query Processing System for Sensor Networks. - Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein,
Advertisements

Topology Control Presenter: Ajit Warrier With Dr. Sangjoon Park (ETRI, South Korea), Jeongki Min and Dr. Injong Rhee (advisor) North Carolina State University.
1 Sensor Network Databases Ref: Wireless sensor networks---An information processing approach Feng Zhao and Leonidas Guibas (chapter 6)
1 Querying Sensor Networks Sam Madden UC Berkeley.
What is a Wireless Sensor Network (WSN)? An autonomous, ad hoc system consisting of a collective of networked sensor nodes designed to intercommunicate.
Programming Vast Networks of Tiny Devices David Culler University of California, Berkeley Intel Research Berkeley
Probabilistic Aggregation in Distributed Networks Ling Huang, Ben Zhao, Anthony Joseph and John Kubiatowicz {hling, ravenben, adj,
DNA Research Group 1 CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein.
1 Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks Samuel Madden UC Berkeley With Robert Szewczyk, Michael Franklin, and David Culler.
Scaling Down Robert Grimm New York University. Scaling Down in One Slide  Target devices (roughly)  Small form factor  Battery operated  Wireless.
The Cougar Approach to In-Network Query Processing in Sensor Networks By Yong Yao and Johannes Gehrke Cornell University Presented by Penelope Brooks.
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams Amit Manjhi, Suman Nath, Phillip B. Gibbons Carnegie Mellon University.
Aggregation in Sensor Networks NEST Weekly Meeting Sam Madden Rob Szewczyk 10/4/01.
A Survey of Wireless Sensor Network Data Collection Schemes by Brett Wilson.
Approximate data collection in sensor networks the appeal of probabilistic models David Chu Amol Deshpande Joe Hellerstein Wei Hong ICDE 2006 Atlanta,
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Aggregate Query Processing in Ad-Hoc Sensor Networks Yong Yao Database lunch, Apr. 15th.
Sensor Networks: Implications for Database Systems and Vice-Versa Michael Franklin January UCB Sensor Day.
1 Acquisitional Query Processing in TinyDB Sam Madden UC Berkeley NEST Winter Retreat 2003.
The Design of an Acquisitional Query Processor For Sensor Networks Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong Presentation.
Model-driven Data Acquisition in Sensor Networks Amol Deshpande 1,4 Carlos Guestrin 4,2 Sam Madden 4,3 Joe Hellerstein 1,4 Wei Hong 4 1 UC Berkeley 2 Carnegie.
TAG: A TINY AGGREGATION SERVICE FOR AD-HOC SENSOR NETWORKS Presented by Akash Kapoor SAMUEL MADDEN, MICHAEL J. FRANKLIN, JOSEPH HELLERSTEIN, AND WEI HONG.
T AG : A TINY AGGREGATION SERVICE FOR AD - HOC SENSOR NETWORKS Samuel Madden, Michael J. Franklin, Joseph Hellerstein, and Wei Hong Presented by – Mahanth.
15-744: Computer Networking L-13 Sensor Networks.
1 Implementation and Research Issues in Query Processing for Wireless Sensor Networks Wei Hong Intel Research, Berkeley Sam Madden.
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Paper By : Samuel Madden, Michael J. Franklin, Joseph Hellerstein, and Wei Hong Instructor :
L-22 Sensor Networks. 2 Overview Ad hoc routing Sensor Networks Directed Diffusion Aggregation  TAG  Synopsis Diffusion.
CS2510 Fault Tolerance and Privacy in Wireless Sensor Networks partially based on presentation by Sameh Gobriel.
INF5100 Autumn 2007 © Ellen Munthe-Kaas and Jarle Søberg 1 Data Management in Sensor Networks Ellen Munthe-Kaas Jarle Søberg.
The Design of an Acquisitional Query Processor For Sensor Networks Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong.
TinyOS By Morgan Leider CS 411 with Mike Rowe with Mike Rowe.
March 6th, 2008Andrew Ofstad ECE 256, Spring 2008 TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden, Michael J. Franklin, Joseph.
Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.
15-744: Computer Networking L-13 Sensor Networks.
1 Pradeep Kumar Gunda (Thanks to Jigar Doshi and Shivnath Babu for some slides) TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden,
TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks Authors: Samuel Madden, Michael Franklin, Joseph Hellerstein Presented by: Vikas Motwani CSE.
1 Querying Sensor Networks Sam Madden UC Berkeley December 13 th, New England Database Seminar.
INT 598 Data Management for Sensor Networks Silvia Nittel Spatial Information Science & Engineering University of Maine Fall 2006.
The Design of an Acquisitional Query Processor for Sensor Networks CS851 Presentation 2005 Presented by: Gang Zhou University of Virginia.
CS542 Seminar – Sensor OS A Virtual Machine For Sensor Networks Oct. 28, 2009 Seok Kim Eugene Seo R. Muller, G. Alonso, and D. Kossmann.
1 Fjording The Stream An Architecture for Queries over Streaming Sensor Data Samuel Madden, Michael Franklin UC Berkeley.
한국기술교육대학교 컴퓨터 공학 김홍연 Habitat Monitoring with Sensor Networks DKE.
Wireless Sensor Networks for Habitat Monitoring Intel Research Lab EECS UC at Berkeley College of the Atlantic.
Query Processing for Sensor Networks Yong Yao and Johannes Gehrke (Presentation: Anne Denton March 8, 2003)
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks.
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
1 REED: Robust, Efficient Filtering and Event Detection in Sensor Networks Daniel Abadi, Samuel Madden, Wolfgang Lindner MIT United States VLDB 2005.
ResTAG: Resilient Event Detection with TinyDB Angelika Herbold -Western Washington University Thierry Lamarre -ENSEIRB Systems Software Laboratory, OGI.
DATA AGGREGATION Siddhartha Sarkar Roll no: CSE-4 th Year-7 th semester Sensor Networks (CS 704D) Assignment.
CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein - Columbia University.
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
W. Hong & S. Madden – Implementation and Research Issues in Query Processing for Wireless Sensor Networks, ICDE 2004.
0.1 IT 601: Mobile Computing Wireless Sensor Network Prof. Anirudha Sahoo IIT Bombay.
In-Network Query Processing on Heterogeneous Hardware Martin Lukac*†, Harkirat Singh*, Mark Yarvis*, Nithya Ramanathan*† *Intel.
Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.
Sep Multiple Query Optimization for Wireless Sensor Networks Shili Xiang Hock Beng Lim Kian-Lee Tan (ICDE 2007) Presented by Shan Bai.
1 TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden UC Berkeley with Michael Franklin, Joseph Hellerstein, and Wei Hong December.
The Design of an Acquisitional Query Processor For Sensor Networks Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong Presentation.
- Pritam Kumat - TE(2) 1.  Introduction  Architecture  Routing Techniques  Node Components  Hardware Specification  Application 2.
TAG: a Tiny AGgregation service for ad-hoc sensor networks Authors: Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong Presenter: Mingwei.
Querying Sensor Networks
Distributed database approach,
The Design of an Acquisitional Query Processor For Sensor Networks
Querying Sensor Networks
Distributing Queries Over Low Power Sensor Networks
Querying Sensor Networks
Data-Centric Networking
REED : Robust, Efficient Filtering and Event Detection
Aggregation.
Presentation transcript:

1 TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden UC Berkeley with Michael Franklin, Joseph Hellerstein, and Wei Hong December 9th, OSDI

2 TAG Introduction What is a sensor network? Programming sensor nets is hard! Declarative queries are easy –Tiny Aggregation (TAG) : In-network processing via declarative queries Example: »Vehicle tracking application: 2 weeks for 2 students »Vehicle tracking query: took 2 minutes to write, worked just as well! SELECT MAX(mag) FROM sensors WHERE mag > thresh EPOCH DURATION 64ms

3 Overview Sensor Networks Queries in Sensor Nets Tiny Aggregation –Overview –Simulation & Results

4 Overview Sensor Networks Queries in Sensor Nets Tiny Aggregation –Overview –Simulation & Results

5 Device Capabilities “Mica Motes” –8bit, 4Mhz processor »Roughly a PC AT –40kbit CSMA radio –4KB RAM, 128KB flash, 512KB EEPROM –TinyOS based Variety of other, similar platforms exist –UCLA WINS, Medusa, Princeton ZebraNet, SmartIts

6 Sensor Net Sample Apps Habitat Monitoring: Storm petrels on great duck island, microclimates on James Reserve. Traditional monitoring apparatus. Earthquake monitoring in shake- test sites. Vehicle detection: sensors along a road, collect data about passing vehicles.

7 Metric: Communication Lifetime from one pair of AA batteries –2-3 days at full power –6 months at 2% duty cycle Communication dominates cost –< few mS to compute –30mS to send message Our metric: communication!

8 Communication In Sensor Nets Radio communication has high link-level losses –typically about 5m Ad-hoc neighbor discovery Tree-based routing A B C D F E

9 Overview Sensor Networks Queries in Sensor Nets Tiny Aggregation –Overview –Optimizations & Results

10 Declarative Queries for Sensor Networks Examples: SELECT nodeid, light FROM sensors WHERE light > 400 EPOCH DURATION 1s 1 EpochNodeidLightTempAccelSound 01455xxx 02389xxx 11422xxx 12405xxx Sensors

11 Aggregation Queries SELECT roomNo, AVG(sound) FROM sensors GROUP BY roomNo HAVING AVG(sound) > 200 EPOCH DURATION 10s Rooms w/ sound > SELECT AVG(sound) FROM sensors EPOCH DURATION 10s EpochAVG(sound) EpochroomNoAVG(sound)

12 Overview Sensor Networks Queries in Sensor Nets Tiny Aggregation –Overview –Optimizations & Results

13 TAG In-network processing of aggregates –Common data analysis operation »Aka gather operation or reduction in || programming –Communication reducing »Operator dependent benefit –Across nodes during same epoch Exploit semantics improve efficiency!

14 Query Propagation SELECT COUNT(*)… Epoch Comm. Slot

15 Basic Aggregation In each epoch: –Each node samples local sensors once –Generates partial state record (PSR) »local readings »readings from children –Outputs PSR during its comm. slot. At end of epoch, PSR for whole network output at root (In paper: pipelining, grouping)

16 Illustration: Aggregation Sensor # Slot # Slot 1 SELECT COUNT(*) FROM sensors

17 Illustration: Aggregation Sensor # Slot # Slot 2 SELECT COUNT(*) FROM sensors

18 Illustration: Aggregation Sensor # Slot # Slot 3 SELECT COUNT(*) FROM sensors

19 Illustration: Aggregation Sensor # Slot # Slot 4 SELECT COUNT(*) FROM sensors

20 Illustration: Aggregation Sensor # Slot # Slot 1 SELECT COUNT(*) FROM sensors

21 Aggregation Framework As in extensible databases, we support any aggregation function conforming to: Agg n ={f init, f merge, f evaluate } f init {a 0 }  F merge {, }  F evaluate { }  aggregate value (Merge associative, commutative!) Example: Average AVG init {v}  AVG merge {, }  AVG evaluate { }  S/C Partial State Record (PSR)

22 Types of Aggregates SQL supports MIN, MAX, SUM, COUNT, AVERAGE Any function can be computed via TAG In network benefit for many operations –E.g. Standard deviation, top/bottom N, spatial union/intersection, histograms, etc. –Compactness of PSR

23 Taxonomy of Aggregates TAG insight: classify aggregates according to various functional properties –Yields a general set of optimizations that can automatically be applied PropertyExamplesAffects Partial State MEDIAN : unbounded, MAX : 1 record Effectiveness of TAG Duplicate Sensitivity MIN : dup. insensitive, AVG : dup. sensitive Routing Redundancy Exemplary vs. Summary MAX : exemplary COUNT: summary Applicability of Sampling, Effect of Loss MonotonicCOUNT : monotonic AVG : non-monotonic Hypothesis Testing, Snooping

24 TAG Advantages Communication Reduction –Important for power and contention Continuous stream of results –Smooth transient faults across epochs Lots of optimizations –Via operator semantics

25 Simulation Environment Evaluated via simulation Coarse grained event based simulator –Sensors arranged on a grid –Two communication models »Lossless: All neighbors hear all messages »Lossy: Messages lost with probability that increases with distance

26 Benefit of In-Network Processing Simulation Results 2500 Nodes 50x50 Grid Depth = ~10 Neighbors = ~20 Some aggregates require dramatically more state!

27 Optimization: Channel Sharing (“Snooping”) Insight: Shared channel enables optimizations Suppress messages that won’t affect aggregate –E.g., MAX –Applies to all exemplary, monotonic aggregates

28 Optimization: Hypothesis Testing Insight: Guess from root can be used for suppression –E.g. ‘MIN < 50’ –Works for monotonic & exemplary aggregates »Also summary, if imprecision allowed How is hypothesis computed? –Blind or statistically informed guess –Observation over network subset

29 Experiment: Hypothesis Testing Uniform Value Distribution Dense Packing Ideal Communication

30 Optimization: Use Multiple Parents For duplicate insensitive aggregates Or aggregates that can be expressed as a linear combination of parts –Send (part of) aggregate to all parents »In just one message, via broadcast –Decreases variance A BC A BC A BC 1 A BC A BC 1/2

31 Multiple Parents Results Better than previous analysis expected! Losses aren’t independent! Insight: spreads data over many links Critical Link! No Splitting With Splitting

32 Summary TAG enables in-network declarative query processing –State dependent communication benefit –Transparent optimization via taxonomy »Hypothesis Testing, Parent Sharing Declarative queries are the right interface for data collection in sensor nets! –Easier to program and more efficient for vast majority of users TinyDB Release Available - TinyDB Release Available -

33 Questions? TinyDB Demo After The Session…