supporting aggregate queries over ad-hoc wireless sensor.ppt

Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks Samuel Madden UC Berkeley Motivation: Sensor Nets and In-Network Query Processing Many Sensor Network Applications are Data Oriented Queries Natural and Efficient Data Processing Mechanism Easy (unlike embedded C code) Enable optimizations through abstraction Aggregates Common Case E.g. Which rooms are in use? In-network processing a must Sensor networks power and bandwidth constrained Communication dominates power cost Not subject to Moore’s law! Overview Background Sensor Networks Our Approach: Tiny Aggregation (TAG) Overview Expressiveness Illustration Optimizations Grouping Current Status Future Work Overview Background Sensor Networks Our Approach: Tiny Aggregation (TAG) Overview Expressiveness Illustration Optimizations Grouping Current Status Future Work Background: Sensor Networks Berkeley Mica Motes TinyOS TinyOS operating system (services) 4Mhz Processor 4K RAM, 512K EEPROM, 128K code space Single channel CSMA half-duplex radio @ 40kbits Lossy: 20% loss @ 5ft in Ganesan et al. Communication Very Expensive: 800 instrs/bit Overview Background Sensor Networks Our Approach: Tiny Aggregation (TAG) Overview Expressiveness Illustration Optimizations Grouping Current Status Future Work The Tiny Aggregation (TAG) Approach Push declarative queries into network Impose a hierarchical routing tree onto the network Divide time into epochs Every epoch, sensors evaluate query over local sensor data and data from children Aggregate local and child data Each node transmits just once per epoch Pipelined approach increases throughput Depending on aggregate function, various optimizations can be applied SQL Primer SQL is an established declarative language; not wedded to it Some extensions clearly necessary, e.g. for sample rates We adopt a basic subset: ‘sensors’ relation (table) has One column for each reading-type, or attribute One row for each externalized value May represent an aggregat