Lecture 1
Lecture 1
Communication, and
Sensing capabilities.
continue …
Soil moisture
Sensor field
probe
Communications Mote
barrier
Gateway
Internet
Mote Operation
Information
Transmitted
Data Processed
A/
Transceiver D Sensor
D/
A
Retrieving/ Microcontroll Event
Storing Data er Detected
External
Memory Sensor
21
Microcontroller
Main processing units of embedded devices
Special purpose and highly integrated
Integrated RAM, ROM, I/O, peripherals
Extremely good power to performance ratio
Cheap, typically 0.25 - 10.00 USD
Executes programs including embedded
system control, measurement &
communications
Usually time-critical requiring guarantees deadlines
Real-time performance a must in most applications
Pre-emptive scheduled tasks
Motes vs. Traditional Computing
23
Computer Revolution
Xbow’
UC- s i-
Riverside mote2
RISE
Network Model for WSN
A wireless sensor network consists of
hundreds or thousands of low cost nodes
which could either have a fixed location or
randomly deployed to monitor the
environment. The flowing of data ends at
special nodes called base stations
(sometimes they are also referred to as
sinks).
Network Model for WSN continue …
ST
Deployment Of Nodes
Forest Fire Detection
Usage of Sensor
Military Monitoring:
Networks continue …
Gateway
2. Listen to neighbors
3. Connect to neighbors
Base Station
Data Mule
Data Collecting
Data Collecting
Base Station
Applications
Collecting a data in a sparse
sensor network
Tracking movement of mobile
elements
Vehicles
Livestock
Wild Animals
Data Collecting
Base Station
Multihop Networking
Standard implementation “tree
Problems: based routing” A
B B
Parent Selection R:{…} R:{…}
Asymmetric Links
Adaptation vs. Stability B
B B
C
B B B
Node D Node C R:{…}
Neigh Neigh
Qual Qual D B R:{…}
B .75 A .5
C .66 B .44
R:{…}
B B B
E .45 D .53 F
F .82 F .35 E 51
B
Geographic Routing
Any-to-any routing via geographic
coordinates
•Requires
coordinate system*
B
•Requires endpoint
coordinates
A •Hard to route
around local
minima
Tree-based Routing
Q:SELECT …
Tree-based routing A
Used in: Q Q
Query delivery R:{…} R:{…}
Data collection Q
In-network aggregation B Q
C
Relationship to
indexing? Q Q Q
R:{…}
D Q R:{…}
R:{…}
Q Q Q
F
E Q
53
Illustration: Aggregation
SELECT COUNT(*)
FROM sensors Interval 4
Sensor #
1
Epoch
1 2 3 4 5
4 1 2 3
Interval #
2
4
1
1
4
5
Illustration: Aggregation
SELECT COUNT(*)
FROM sensors Interval 3
Sensor #
1
1 2 3 4 5
4 1 2 3
Interval #
3 2
2
2
4
1
4
5
Illustration: Aggregation
SELECT COUNT(*)
FROM sensors Interval 2
Sensor #
1
1 2 3 4 5 1 3
4 1 2 3
Interval #
3 2
2 1 3
4
1
4
5
Illustration: Aggregation
SELECT COUNT(*)
FROM sensors 5 Interval 1
Sensor #
1
1 2 3 4 5
4 1 2 3
Interval #
3 2
2 1 3
4
1 5
4
5
Illustration: Aggregation
SELECT COUNT(*)
FROM sensors Interval 4
Sensor #
1
1 2 3 4 5
4 1 2 3
Interval #
3 2
2 1 3
4
1 5
1
4 1
5
In-Network Join Strategies
Types of joins:
non-sensor -> sensor
sensor -> sensor
Optimization questions:
Should the join be pushed down?
If so, where should it be placed?
What if a join table exceeds the
memory available on one node?
cases where Ecapture helps
I Got B!
B Got
D!
A D F Got
D!
C H
G
cases where collision
happens E
I
B
A D F Got
???
D!
???
Got B!
Got A!
C H
G
Routing Phenomenon
being sensed
Data aggregation
takes place here
Sink
Data from the sensors (or publishers) towards the sink (or subscribers)
and,
Queries and control packets from the sink (or subscribers) towards the
sensor nodes (or publishers)
Directed Diffusion
Gradient
ThisUses
Consumer
Nodes
The represents
process
choice
diffuse
of sets
of
data
the
path
upboth
application-aware direction
initiates
interest
gradients
is madeinterest
towards towards
communication
locally
in the data
inproducers
at
network
data
every
with matching
primitives
node
tovia
certain
draw
afor
Every route
Probability
Collect energy 1/energy
has a probability
metrics ofcost
along being chosen
the way
and status of demand
expressed
sequence
events matching
of
every with
inlocal
terms
attributes desired
of
packet
the namedupdate
interactions
interest data rate
Four-legged
animal
Source
Sink
Directed Diffusion
Reinforcement andtolerance
Has built-in negative to
reinforcement
nodes movingused
to converge to range
out of efficient
or distribution
dying
Source
Sink
Geographic Forwarding
Greedy Approach
Problem: It can get stuck in a local minima
Thank You