Querying the Physical World Joe Hellerstein Wei Hong Sam Madden
Download
Report
Transcript Querying the Physical World Joe Hellerstein Wei Hong Sam Madden
Querying the Physical World
Joe Hellerstein
UC Berkeley & Intel Research Berkeley
Wei Hong
Intel Research Berkeley
Sam Madden
M.I.T.
1
Motivation
• Sensor networks (aka sensor webs, emnets) are here
– Several widely deployed HW/SW platforms
• Low power radio, small processor, RAM/Flash
– Variety of (novel) applications: scientific, industrial, commercial
– Great experimental platform for ubicomp + mobility
• Cross-cutting technical challenges
– Networking, systems, languages, databases, AI, stats, signal proc.
• We will summarize:
– The state of the art
– Our experiences building TinyDB
– Current and future research directions
Berkeley
Mote
2
Some Sensornet Apps
redwood forest
microclimate
monitoring
smart cooling
in data centers
(hp/intel)
http://www.hpl.hp.com/research/dca/smart_cooling/
condition-based
maintenance
(intel/BP)
structural
integrity
(ucb/ggbd)
And More…
• Homeland security
• Container monitoring
• Mobile environmental apps
• Bird tracking
• Zebranet
• Home automation
• Etc!
Context: The “Berkeley” Stack
Motes
4
Declarative Queries
• Programming TinyOS Apps is Hard
– Embedded x Distributed Programming!
•
•
•
•
•
Limited power budget
Lossy, low bandwidth communication
Require long-lived, zero admin deployments
Distributed Algorithms
Limited tools, debugging interfaces
• Queries abstract away much of the complexity
– Burden on the query engine developer
– Users get:
• Safe, optimizable programs
• Freedom to think about apps instead of details
5
TinyDB Query Engine
• Continuous variant of SQL : TinySQL
• Power and data-acquisition based innetwork optimization framework
• Extensible interface for aggregates, new
types of sensors
6
Agenda
• Sensornet Background
• TinyDB
– Data Model and Query Language
– Software Architecture
• TASK
– Quick overview
• A Flavor of Research Challenges
7
Sensor Networks: a hot topic
• New university courses
• New conferences
– ACM SenSys, IEEE IPSN, etc.
• New industrial research lab projects
– Intel, PARC, MSR, HP, Accenture, etc.
• Startup companies
– Crossbow, Dust, Ember, Sensicast, Moteiv, etc.
• Media Buzz
– Over 30 news articles since July 2002 covering IntelBerkeley/UC Berkeley sensor network activities
– One of 10 emerging technologies that will change the world
– MIT Technology Review
8
Why Now?
• Commoditization of radio hardware
– Cellular and cordless phones, wireless
communication
• Low cost -> many/tiny -> new applications!
• Real application for ad-hoc network research
from the late 90’s
• Coming together of EE + CS communities
10
Motes
Mica2Dot uProc: 4Mhz, 8 bit Atmel RISC
Mica Mote
Radio:
40 kbit 900/450/300 MHz or
250 kbit 2.5GHz (MicaZ 802.15.4)
Memory:
4 K RAM / 128 K Program Flash /
512 K Data Flash
Power: 2 x AA or coin cell
iMote
Telos Mote
uProc: 8Mhz, 16 bit TI RISC
Radio: 250 kbit 2.5GHz (802.15.4)
Memory:
2 K RAM / 60 K Program Flash /
512 K Data Flash
Power: 2 x AA
uProc: 12Mhz, 16 bit ARM
Radio: Bluetooth
Memory:
64K SRAM / 512 K Data Flash
Power: 2 x AA
11
History of Motes
• Initial research goal wasn’t hardware
– Has since become more of a priority with emerging
hardware needs, e.g.:
• Power consumption
• (Ultrasonic) ranging + localization
– MIT Cricket, NEST Project
• Connectivity with diverse sensors
– UCLA sensor board
– Even so, now on the 5th generation of devices
•
•
•
•
Costs down to ~$50/node (Moteiv, Dust)
Greatly improved radio quality
Multitude of interfaces: USB, Ethernet, CF, etc.
Variety of form factors, packages
12
Motes vs. Traditional
Computing
•
•
•
•
Embedded OS
Lossy, Adhoc Radio Communication
Sensing Hardware
Severe Power Constraints
13
NesC/TinyOS
• NesC: a C dialect
for embedded
programming
– Components, “wired
together”
– Quick commands
and asynch events
• TinyOS: a set of
NesC components
– hardware
components
– ad-hoc network
formation &
maintenance
– time synchronization
Think of the pair as a programming environment
Radio Communication
• Low Bandwidth Shared Radio Channel
– ~40kBits on motes
– Much less in practice
• Encoding, Contention for Media Access (MAC)
• Very lossy: 30% base loss rate
– Argues against TCP-like end-to-end
retransmission
• And for link-layer retries
• Generally, not well behaved
15
From Ganesan, et al. “Complex Behavior at Scale.” UCLA/CSD-TR 02-0013
Types of Sensors
• Sensors attach via daughtercard
•Weather
–Temperature
–Light x 2 (high
intensity PAR, low
intensity, full
spectrum)
–Air Pressure
–Humidity
•Vibration
–2 or 3 axis accelerometers
•Tracking
–Microphone (for ranging
and acoustic signatures)
–Magnetometer
• GPS
• RFID Reader
16
Non-Volatile Storage
• EEPROM
–
–
–
–
512K off chip, 32K on chip
Writes at disk speeds, reads at RAM speeds
Interface : random access, read/write 256 byte pages
Maximum throughput ~10Kbytes / second
• MatchBox Filing System
– Provides a Unix-like file I/O interface
– Single, flat directory
– Only one file being read/written at a time
17
Power Consumption and
Lifetime
• Power typically supplied by a small battery
– 1000-2000 mAH
– 1 mAH = 1 milliamp current for 1 hour
• Typically at optimum voltage, current drain rates
– Power = Watts (W) = Amps (A) * Volts (V)
– Energy = Joules (J) = W * time
• Lifetime, power consumption varies by application
– Processor: 5mA active, 1 mA idle, 5 uA sleeping
– Radio: 5 mA listen, 10 mA xmit/receive, ~20mS / packet
– Sensors: 1 uA -> 100’s mA, 1 uS -> 1 S / sample
18
Energy Usage in A Typical
Data Collection Scenario
Percentage of Total Energy
Percentage of Total Power
• Each
mote collects
of Energy Breakdown
Breakdown 1 sample
Power Consumption
Processor
(light,humidity) data every 10 seconds,
50
90
forwards it
45
80
40
70
• Each mote can “hear” 10 other
motes
35
60
30
25
• 50Process:
40
20
15
10
5
0
– Wake up, collect samples (~ 1 second)
30
20– Listen to radio for messages to forward (~1
10 second)
Idle
Waiting Waiting
0– Forward data
for Radio
for
Radio
Sensors
Processor
Hardware Element
Sending
Sensors
Processing Phase
19
Sensors: Slow, Power Hungry, Noisy
Time of
of Day
Day vs.
vs. Light
Light
Time
200
Chamber Sensor
Chamber Sensor
Sensor 69 (Median of Last 10)
Sensor 69
180
160
140
Lux
Light
(Lux)
120
100
80
60
40
20
0
20:09
20:38
21:07
21:36
22:04
22:33
23:02
23:02
-20
23:31
23:31
0:00
0:00
0:28
0:28
0:57
0:57
1:26
1:26
20
Time
Time
of Day
Agenda
• Sensornet Background
• TinyDB
–
–
–
–
–
–
–
–
TinyDB Overview
Data Model and Query Language
Demo
TinyDB Java API and Scripting
Demo with TinyDB GUI
TinyDB Internals
Extending TinyDB
TinyDB Status and Roadmap
• TASK
• A Flavor of Research Challenges
21
TinyDB Revisited
• High level abstraction:
– Data centric programming
– Interact with sensor network
as a whole
– Extensible framework
SELECT MAX(mag)
FROM sensors
WHERE mag > thresh
SAMPLE PERIOD 64ms
App
• Under the hood:
– Intelligent query processing:
query optimization, power
efficient execution
– Fault Mitigation: automatically
introduce redundancy, avoid
problem areas
Query,
Trigger
Data
TinyDB
Sensor Network
22
Feature Overview
•
•
•
•
•
•
Declarative SQL-like query interface
Metadata catalog management
Multiple concurrent queries
Network monitoring (via queries)
In-network, distributed query processing
Extensible framework for attributes,
commands and aggregates
• In-network, persistent storage
23
Architecture
TinyDB GUI
TinyDB Client API
JDBC
PC side
0
Mote side
0
4
Sensor network
TinyDB query
processor
2
1
5
DBMS
83
6
7
24
Query Language (TinySQL)
SELECT <aggregates>, <attributes>
[FROM {sensors | <buffer>}]
[WHERE <predicates>]
[GROUP BY <exprs>]
[SAMPLE PERIOD <const> | ONCE]
[INTO <buffer>]
[TRIGGER ACTION <command>]
25
Demo Time
26
TinySQL Examples
“Find the sensors in bright
nests.”
Sensors
1
SELECT nodeid, nestNo, light
FROM sensors
WHERE light > 400
EPOCH DURATION 1s
Epoch Nodeid nestNo
Light
0
1
17
455
0
2
25
389
1
1
17
422
1
2
25
405
27
TinySQL Examples (cont.)
2 SELECT AVG(sound)
FROM sensors
EPOCH DURATION 10s
3 SELECT region, CNT(occupied)
AVG(sound)
FROM sensors
GROUP BY region
HAVING AVG(sound) > 200
“Count the number occupied
nests in each loud region of
the island.”
Epoch
region
CNT(…)
AVG(…)
0
North
3
360
0
South
3
520
1
North
3
370
1
South
3
520
EPOCH DURATION 10s
Regions w/ AVG(sound) > 200
28
Event-based Queries
• ON event SELECT …
• Run query only when interesting events
happen
• Event examples
– Button pushed
– Message arrival
– Bird enters nest
• Analogous to triggers but events are
user-defined
29
Query over Stored Data
•
•
•
•
•
Named buffers in Flash memory
Store query results in buffers
Query over named buffers
Analogous to materialized views
Example:
CREATE BUFFER name SIZE x (field1 type1, field2 type2, …)
SELECT a1, a2
FROM sensors
SAMPLE PERIOD d
INTO name
SELECT field1, field2, …
FROM name
SAMPLE PERIOD d
30
Using the Java API
• SensorQueryer
– translateQuery() converts TinySQL string into TinyDBQuery
object
– Static query optimization
• TinyDBNetwork
– sendQuery() injects query into network
– abortQuery() stops a running query
– addResultListener() adds a ResultListener that is invoked for
every QueryResult received
– removeResultListener()
• QueryResult
– A complete result tuple, or
– A partial aggregate result, call mergeQueryResult() to
combine partial results
• Key difference from JDBC: push vs. pull
31
Writing Scripts with TinyDB
• TinyDB’s text interface
– java net.tinyos.tinydb.TinyDBMain –run
“select …”
– Query results printed out to the console
– All motes get reset each time new query is
posed
• Handy for writing scripts with shell, perl,
etc.
32
Inside TinyDB
SELECT
T:1, AVG: 225
AVG(temp) Queries
Results T:2, AVG: 250
WHERE
light > 400
Multihop
Network
Query Processor
Aggavg(temp)
~10,000
Lines
Embedded C Code
Filter
Name: temp
light > 400
Time to sample: 50 uS
Cost to sample: 90 uJ
Schema
Calibration Table: 3
~3200
Bytes
RAM (w/ 768 byte heap)
getTempFunc(…)
Units: Deg. F
TinyOS
~58 kB compiled code
Error: ± 5 Deg F
(largest TinyOS program)
Get f : getTempFunc()…
33
got(‘temp’)
~5,000
LinesSamples
(PC-Side)
Java
get (‘temp’)
Tables
TinyDB
Tree-based Routing
• Tree-based routing
Q:SELECT …
– Used in:
• Query delivery
• Data collection
• In-network aggregation
• Ensure good connectivity
• Maintain loop-free
– Techniques
• First person you hear from
• Snoop on others, keep track
of promising contenders,
switch as appropriate
Q
R:{…}
Q
R:{…}
B
• Parent Selection
– Goals
A
Q
R:{…}Q
Q
D
R:{…}
Q
C
Q
Q
R:{…}
Q
Q
Q
F
E
Q
34
Power Management Approach
Coarse-grained app-controlled communication scheduling
Mote ID
1
… zzz …
Epoch (10s -100s of seconds)
… zzz …
2
3
4
5
time
35
2-4s Waking Period
Time Synchronization
• All messages include a 5 byte time stamp indicating system time
in ms
– Synchronize (e.g. set system time to timestamp) with
• Any message from parent
• Any new query message (even if not from parent)
– Punt on multiple queries
– Timestamps written just after preamble is xmitted
• All nodes agree that the waking period begins when (system
time % epoch dur = 0)
– And lasts for WAKING_PERIOD ms
• Adjustment of clock happens by changing duration of sleep
cycle, not wake cycle.
36
Extending TinyDB
• Why extending TinyDB?
– New sensors attributes
– New control/actuation commands
– New data processing logic aggregates
– New events
• Analogous to concepts in objectrelational databases
37
Adding Attributes
• Types of attributes
– Sensor attributes: raw or cooked sensor
readings
– Introspective attributes: parent, voltage,
ram usage, etc.
– Constant attributes: constant values that
can be statically or dynamically assigned to
a mote, e.g., nodeid, location, etc.
38
Adding Attributes (cont)
•
Steps to adding attributes to TinyDB
1) Create attribute nesC components
2) Wire new attribute components to TinyDBAttr
configuration
3) Reprogram TinyDB motes
4) Add new attribute entries to catalog.xml
•
Constant attributes can be added on the fly
through TinyDB GUI
40
TinyDB Status
• Latest released with TinyOS 1.1.6 (5/04)
– Install the task-tinydb package in TinyOS 1.1
distribution
– First release in TinyOS 1.0 (9/02)
– Widely used by research groups as well as industry
pilot projects
• Ongoing deployments in Intel Berkeley Lab and
redwood trees at UC’s Sonoma Grove
– Largest deployment: ~80 weather station nodes
– Network longevity: 4-5 months
43
The Redwood Tree Deployment
• Redwood Grove in UC Botanical
Garden, Berkeley
• Collect dense sensor readings to
monitor climatic variations across
–
–
–
–
altitudes,
angles,
time,
forest locations, etc.
• Versus sporadic monitoring points
with 30lb loggers!
• Current focus: study how dense
sensor data affect predictions of
conventional tree-growth models
44
Data from Redwoods
Humidity vs. Time
101
104
109
110
111
36m
33m: 111
32m: 110
Rel Humidity (%)
95
30m: 109,108,107
85
75
65
55
45
35
20m: 106,105,104
Temperature vs. Time
10m: 103, 102, 101
Temperature (C)
33
28
23
18
13
8
7/7/03 7/7/03 7/7/03 7/7/03 7/7/03 7/8/03 7/8/03 7/8/03 7/8/03 7/8/03 7/8/03 7/9/03 7/9/03 7/9/03 7/9/03
9:40 13:11 16:43 20:15 23:46 3:18 6:50 10:21 13:53 17:25 20:56 0:28 4:00 7:31 11:03
Date
45
TinyDB Roadmap (near term)
• Support for high frequency sampling
– For a variety of deployments
• Intel Fab, BP shipboard, Golden Gate Bridge
– Store and forward
– Bulk reliable data transfer
– Scheduling of communications
• Research agenda continues
– Discussion later
46
For more information
• http://berkeley.intel-research.net/tinydb
or
http://triplerock.cs.bekeley.edu/tinydb
47
Agenda
• Sensornet Background
• TinyDB
• TASK
– SW/HW architecture
– Features
• A Flavor of Research Challenges
48
SensorNet Dilemma
• Sensors still packaged like HeathKits
– Pretty hard to cope with out of the box
• Bare metal encourages one-off applications
– Inhibits reuse
• Deployment not intuitive
– No configuration/monitoring tools
• SensorNet PhD Factor
– Today ~2.5 PhDs needed to deploy a SensorNet
– Needs to be Zero
49
TASK Design Requirements
•
•
•
•
•
Ease of S/W Installation
Deployment tools
Reconfigurability
Health/Mgmt Monitoring
Network Reliability
Guarantee
• Interpretable Sensor
Results
• Tool Integration
• Audit Trails
• Lifetime estimates
~ For Developers ~
• Familiar API
• Extensibility of S/W
• Modular services
50
Tiny Application Sensor Kit
External Tools
TASK Client Tools
TaskView
Internet
Stable Store
(DBMS)
TASK Field Tools
SensorNet Appliance
TASK Server
TinyDB Sensor Network
•
•
•
•
Simplicity vs. Functionality
Modularity
Remote control
51
Fault Tolerant
SensorNet Appliance
SNA
• Intelligent Gateway
http,
other
ODBC
DBMS
TASK
Server
TinyDB Client
–
–
–
–
Proxy for the sensornet
Distributes query
Stages results
Manages configuration
• Components
–
–
–
–
TASK Server
TinyDB Client (Java)
DBMS (PostgreSQL)
WebServer (Apache)
SensorNet
52
Tools
• Field Tool
– In-situ diagnostics
• TaskView
– Integrated tool for
management and
monitoring
53
Quick TASK Demo
54
Agenda
•
•
•
•
Sensornet Background
TinyDB
TASK
A Flavor of Research Challenges
55
Sensor Network Research
• Very active research area
– Can’t summarize it all
• Focus: database-relevant research topics
– Some outside of Berkeley/MIT
– Other topics that are itching to be scratched
– But, some bias towards work that we find
compelling
56
Topics
•
•
•
•
•
•
•
•
•
In-network aggregation
Acquisitional Query Processing
Heterogeneity
Intermittent Connectivity
In-network Storage
Statistical modeling and summarization
In-network Joins
Adaptivity and Sensor Networks
Multiple Queries
57
Topics
•
•
•
•
•
•
•
•
•
In-network aggregation
Acquisitional Query Processing
Heterogeneity
Intermittent Connectivity
In-network Storage
Statistical modeling and summarization
In-network Joins
Adaptivity and Sensor Networks
Multiple Queries
58
Tiny Aggregation (TAG)
• In-network processing of aggregates
– Common data analysis operation
• Aka gather operation or reduction in ||
programming
– Communication reducing
• Operator dependent benefit
• Exploit query semantics to improve
efficiency!
Madden, Franklin, Hellerstein, Hong. Tiny AGgregation (TAG), OSDI 2002.
59
Basic Aggregation
• In each epoch:
– Each node samples local sensors once
– Generates partial state record (PSR)
• local readings
• readings from children
1 4
2 3
– Outputs PSR during assigned comm. interval
• Interval assigned based on depth in tree
• At end of epoch, PSR for whole network output at
root
• New result on each successive epoch
3 3
4 2
5 Interval 1
60
Illustration: In-Network
Aggregation
SELECT COUNT(*)
FROM sensors
Sensor #
1
Interval #
4
2
3
Interval 4
1
4
Sample
Period
5
1
2
3
3
2
1
4
Time
4
1
5
61
Illustration: In-Network
Aggregation
SELECT COUNT(*)
FROM sensors
Sensor #
1
2
3
Interval #
2
1
4
4
3
Interval 3
5
1
2
3
2
2
4
1
4
5
62
Illustration: In-Network
Aggregation
SELECT COUNT(*)
FROM sensors
Sensor #
1
2
3
Interval #
1
4
4
1
5
1
3
2
Interval 2
3
2
3
2
1
3
4
1
4
5
63
Illustration: In-Network
Aggregation
SELECT COUNT(*)
FROM sensors
Sensor #
1
2
3
Interval #
2
3
2
2
4
5
1
3
Interval 1
1
4
4
1
5
1
3
4
5
5
64
Illustration: In-Network
Aggregation
SELECT COUNT(*)
FROM sensors
Sensor #
1
2
3
Interval #
5
1
3
2
3
2
2
4
1
4
4
1
Interval 4
1
3
4
5
1
1
5
65
Illustration: In-Network
Aggregation
Interval #
SELECT COUNT(*)
FROM sensors
Sensor #
1
2
3
4
zzz
zzz
zzz
3
zzz
zzz
2
Interval 4
1
4
5
1
2
zzz
1
3
zzz
zzz
zzz
zzz
1
5
zzz
zzz
4
zzz
zzz
zzz
1
2
3
4
1
5
66
Aggregation Framework
• As in extensible databases, TinyDB supports any
aggregation function conforming to:
Aggn={finit, fmerge, fevaluate}
Finit {a0}
<a0>
Partial State Record (PSR)
Fmerge {<a1>,<a2>} <a12>
Fevaluate {<a1>}
aggregate value
Example: Average
AVGinit
{v}
<v,1>
AVGmerge {<S1, C1>, <S2, C2>}
< S1 + S2 , C1 + C2>
AVGevaluate{<S, C>}
S/C
Restriction: Merge associative, commutative
67
Taxonomy of Aggregates
• TAG insight: classify aggregates according to various
functional properties
– Yields a general set of optimizations that can automatically be applied
Property
Partial State
Examples
MEDIAN : unbounded,
MAX : 1 record
Affects
Effectiveness of TAG
Monotonicity
COUNT : monotonic
AVG : non-monotonic
MAX : exemplary
COUNT: summary
MIN : dup. insensitive,
AVG : dup. sensitive
Hypothesis Testing, Snooping
Exemplary vs.
Summary
Duplicate
Sensitivity
Drives an API!
Applicability of Sampling,
Effect of Loss
Routing Redundancy
68
Use Multiple Parents
• Use graph structure
– Increase delivery probability with no communication overhead
• For duplicate insensitive aggregates, or
• Aggs expressible as sum of parts
– Send (part of) aggregate to all parents
SELECT COUNT(*)
• In just one message, via multicast
R
– Assuming independence, decreases variance
• Recent research on “converting”
to robust dup-insensitivity
– E.g. count can be approximated robustly
in a dup-insensitive fashion
[Considine, et al., 2003]
B
C
c
c/n
n=2
c/n
A
69
Statistical Techniques
• Approximations, summaries, and sampling
based on statistics and statistical models
• Applications:
– Limited bandwidth and large number of nodes ->
data reduction
– Lossiness -> predictive modeling
– Uncertainty -> tracking correlations and changes
over time
– Physical models -> improved query answering
71
Correlated Attributes
• Data in sensor networks is correlated; e.g.,
–
–
–
–
–
Temperature and voltage
Temperature and light
Temperature and humidity
Temperature and time of day
etc.
72
BBQ*: Model-based Probabilistic
Querying over Sensor Networks
Joint work with Amol Desphande
and Carlos Guestrin
Model
Query Processor
1
3
4
2
5
*BarbieQ: A Tiny
Model Driven
Query System
6
7
8
9
73
BBQ: Model-based Probabilistic
Querying over Sensor Networks
Probabilistic Query
select NodeID, Temp ± 0.1C
where NodeID in [1..9]
with conf(0.95)
Model
Consult
Model
Query Processor
Observation Plan
[Temp, 3], [Voltage, 9]
1
3
4
2
5
6
7
8
9
74
BBQ: Model-based Probabilistic
Querying over Sensor Networks
Probabilistic Query
select NodeID, Temp ± 0.1C
where NodeID in [1..9]
with conf(0.95)
Model
Consult
Model
Query Processor
Observation Plan
[Temp, 3], [Voltage, 9]
1
3
4
2
5
6
7
8
9
75
BBQ: Model-based Probabilistic
Querying over Sensor Networks
Query Results
Temperature
30
Model
25
20
15
10
Update
Model
1
Query Processor
2
3
4
Node ID
Data
[Temp, 3] = …, [Voltage, 9] = …
1
3
4
2
5
6
7
8
9
76
Challenges
• What kind of models to use ?
• Routing:
– How to “tour” the selected set of nodes
• Optimization:
– Given a model and a query, find the best set of attributes to
observe
– Cost not easy to measure
• Non-uniform network communication costs
• Changing network topologies
• Depends on touring technique
– Large plan space
• Might be cheaper to observe attributes not in query
– e.g. Voltage instead of Temperature
• Conditional Plans:
– Change the observation plan based on observed values
77
BBQ: Current Prototype
• Multi-variate Gaussian Models
– Kalman Filters to capture correlations across time
• Handles:
– Range predicate queries
• sensor value within [x,y], w/ confidence
– Value queries
• sensor value = x, w/in epsilon, w/ confidence
– Simple aggregate queries
• AVG(sensor value) n, w/in epsilon, w/confidence
• Uses a greedy algorithm to choose the observation plan
78
A complex aggregate:
Wavelets
• just like AVG or COUNT
– but fancier :-)
• re-codes a signal into a
sum of “square waves”
• biggest coefficients ⇒
approx. reconstruction
– lossy compression
– multi-resolution
• Examples:
– histograms
– 2-d or 3-d
compression and
reconstruction
computing a wavelet
35,
-1,
3,
8,
-4,
3,
3,
3
computing a wavelet
And a corresponding
Communication Graph
computing a wavelet
And a corresponding
Communication Graph
computing a wavelet
And a corresponding
Communication Graph
resulting comm graph
a binomial tree!
I never promised you a
binomial
• TinyDB agg trees are not any special shape
– Parents chosen for reliability, not tree “shape”
• Options
– Cope with non-binomial trees
• How to merge two subtrees of different sizes?
• Can muck with the Wavelet, but it biases the answer
• Can forward when merge is impossible, but comm cost
– Develop a scheme to ensure binomial agg trees
• When is it possible?
• Distributed algorithm to do it?
85
Concluding Remarks
• Sensor nets becoming a reality
– For sensornet system hackers, TinyOS an emerging
standard
– For sensornet app writers, TinyDB an emerging standard
– TASK a developing example of a turnkey solution
• Lots of room for innovation
–
–
–
–
Applications and vertical solutions
Systems work in OS, Networks, DBs
Opportunities in Statistics, AI, Signal Processing
This all meshes in new and interesting ways!
86
Sensornets: Getting Started
• TinyDB home page:
– http://telegraph.cs.berkeley.edu/tinydb
• The TinyOS home page:
– http://webs.cs.berkeley.edu/tinyos
• Crossbow (motes & stargates):
– http://www.xbow.com
• Moteiv (motes)
– http://www.moteiv.com
• Intel Imote
– www.intel.com/research/exploratory/motes.htm.
87
Backup Slides
88
computing a wavelet
35,
0,
3,
8,
-4,
0,
0,
0
computing a wavelet
35,
0,
3,
8,
-4,
0,
0,
0