An Adaptive Sensor Network Architecture For Multi-Scale Communication

An Adaptive
Sensor Network Architecture

for Multi-scale Communication
Santashil PalChaudhuri
PhD Proposal
May 12, 2005
Sensor Node Applications
Sensor nodes can sense,

process and communicate
A few applications
Source: www.intel.com
Distributed surveillance
Preventive maintenance
Environment monitoring
Industrial automation
Smart Buildings
Pervasive computing
Computer Science | Rice University | PhD Proposal
What is Multi-scale?
Multi-scale implies that data is sensed,

processed and communicated at different
scales
Many sensor applications require support for
multi-scale approach
Collaborative Monitoring, Wavelet Compression
Illustrative example follow

Multi-scale Monitoring
Finer Scale Drilling
Thesis Contributions
Propose a COMPASS networking architecture

Design and evaluate specific protocols of this
architecture to support multi-scale
applications
1.
2.
3.
Data Service
Synchronization
Medium Access
1. Architecture
COMPASS Networking Architecture
Requirements
Design
Traditional Network
Architectures
Layering is a design principle, and is

important for complex systems
Each layer is independent of another layer

Service provided by one layer is solely
dependent on service by layer directly below
Applications and networking are developed

separately with no interaction
Sensor Networks
Characteristics
Resource Constraints
Data-Centric Routing
Limited set of application requirements
Large Scale
Node is not important, content is
Adaptability to applications
Energy, computational and communication capability
Hierarchy is a well-known way for scalability
Data Fusion Capability
In-network processing (E.g,: Averaging)

COMPASS Design Goals

Cross-layering for relevant information
1.
Example: MAC knows communication schedule
Adaptable for specific application
2.
Example: Routing has cost and latency tradeoff
Network Programming Interface (NPI)
3.
Example: Logical naming instead of physical

naming
10
COMPASS Network Architecture
Data Service
Medium Access
Information
Exchange
Service
(IES)
Localization
Service
Data Fusion
Synchronization
Service
Application
Radio
11
COMPASS Network Architecture

Enables multi-scale
application support
Application
Adaptive clock Synchronization
Publishes routing hierarchy
Subscribes to synchronization
and NPI
needs
To be published at DCOSS,
Data Fusion
Published at IPSN, April 2004 Information
June 2005
Exchange
Data Service
Scheduled medium access
Service
Publish-Subscribe based
for the multi-scale data
(IES)
notificationMedium
service Access
service
Modules register with
Subscribes to hierarchy,
interest in a specific resource
Radio NPI, fusion functions
E.g.: App -> MAC
To be submitted
Localization
Service
Synchronization
Service
12
2. Multi-Scale Data Service
Related Work
Hierarchical Overlay
Network Programming Interfaces
13
Related Work
Traditional sensor routing One Scale
Multi-scale approaches
Directed Diffusion, Trickle

Dimensions, Fractional Cascading
Regular grid structure, needs localization
Communication Abstractions
Abstract Region neighborhood communication
14
COMPASS Hierarchy
Formation
Similar to Landmark, L+, Safari
1.
2.
3.
4.
Nodes choose to become cellheads

Heterogeneous or random
Starts broadcasting beacons

Other nodes associate with the
heads
Choose next hop to parent
randomly
Repeat this process

hierarchically
15
Adaptivity using Selectors
Hop proximity is relevant for some applications

But, collaborative set of nodes might be based on
other criterion sensors with similar value might
need to coordinate more often
Beacons have selectors associated with it
Selector = (attribute, value, operator)

Selectors = Selector (AND|OR) Selector
Nodes associates with cluster-heads if Selectors evaluate to
TRUE
16
Communication Interfaces
Get & Put support for both types
Low-rate data generation, high interest => put

High-rate data generation, low interest => get
3 different kinds of addressing
Parent, Cell, Peer
PutPeer(Level,Selectors,Attribute,Value)
Reduction interface
Max. temp in cell

17
Implementation of Interfaces
With the parent node
With peer nodes
Reverse path of beacon packet of parent

Reverse path of beacon packet to peers
Within the cell
Optimal cell flooding using approximate

Connected Dominating Set (CDS)
18
4. Adaptive Synchronization
Overview
19
Clock Synchronization Service
Important service in sensor networks

Applications
Medium access scheduling

Sensor reading fusion
Synchronized energy savings
Time-sensitive routing
All related works provide best possible

syncronization
20
Need for Adaptation
Synchronization requires messaging, and

hence energy
Provide only necessary synchronization
Different applications have different

synchronization requirements
Apps publish requirements to IES, and IES

notifies synchronization service of common
requirement
21
Summary of work
Given service specification
Maximum Error in synchronization

Confidence probability - p
max
Derive receiver-based synchronization

protocol parameters to meet these
requirements
Number of messages per interval n

Interval length - Tsync
22
4. Hierarchical Medium
Access
Survey of MAC techniques

Design of MAC for COMPASS
23
Fundamental Tasks
Single-hop data transfer

Provides efficient access to shared media
Controls access to radio
24
Sensor Network:
Requirements and Opportunities
Higher significance: Energy efficiency &

scalability
Lower significance: Throughput, utilization,
latency, fairness
Adapt to data patterns using information
subscribed from IES
Limited communication abstractions

Known fusion function characteristics
25
Typical approaches
Contention-Based: Random Access & Slotted

9
Schedule-Base
9
Flexible with increased traffic fluctuations and node

failures or additions
Sources of overhead Idle listening, Packet collisions,
Control packet overhead
Collision-free and no idle listening
Reduced flexibility to handle variable traffic and changing
neighborhood
Hybrid Approach
Combination of both
26
Random Access Protocols
Preamble notifies receivers of upcoming transfer

Shifts cost from receivers to transmitters
Low Power Listening(LPL) and Preamble Sampling
[Hill,Micro02][WiseMAC,SenSys03]
27
Slotted Protocols
Synchronize nodes into slots

Implement duty cycle within each slot, which
determines energy saved
802.11 style data transfer using RTS/CTS
Overhearing avoidance & Streaming sequence of
messages[SMAC, Infocom02]
Automatically adjusts to fluctuations in traffic
[TMAC, SenSys03]
28
Sink-Based Scheduling
A central base-station, or sink or clusterhead computes the TDMA schedule

Sensors inform cluster-heads of traffic
demands, which are addressed in the next
scheduled frame [IBM Systems Journal,95]
Cluster-heads can be rotated to save energy
for that node [LEECH, PACT, BMA]
29
Distributed Scheduling
Nodes know about their
Sufficient information to choose one transmitter in

a collision-free way
2-hop neighborhood
1-hop future traffic
Priority given by hash func of node and slot id
Completely general communication assumed, no

hierarchy, and no ordering constraints
[NAMA, MobiCom01][TRAMA, SenSys03]
30
Aims for
COMPASS Medium Access
Design a medium access schedule to

provide energy efficiency for multi-scale
applications
Routing hierarchy known

Communication pattern known
Fusion functions known
Optimize the common case
For Parent and local communication

31
My Assumptions
Bi-directionality of links
1.
True for limited range
Interference range = Transmission range
2.
Techniques such as Radio Interference Detection

(RID) [Infocom 05] provides interference range
Clock synchronization present
3.
Provided necessary clock synchronization
Have 2-hop node information
4.
Easier to have than mobile networks

32
Time-Frame Design
Time-frame divided into two parts
Synchronized Contention Free Period (CFP)
Event-driven Contention Access Period (CAP)
Periodic deterministic application traffic

Example: Periodic sample of temperature
Event-driven traffic
Example: Intrusion detection, Fire, etc
I design a protocol for CFP, and any random access

technique can be used for CAP
33
Hierarchical Communication
Intra-Cluster (L1)
Inter-Cluster
(L2, L3)
34
Time Frame Structure

Frame Beacons
L1
Clock Sync
L2 L3
Contention
Free Period
Time
Contention Access Period
35
Intra-cluster Structure
a
Hierarchy is achieved by beacons

36
Design Goals
Spatially conflict-free slot allocation in 2hop neighborhood
Parents allocated slots after children,
1.
2.
For latency reduction
Partial Order
Slots of children grouped together
3.
Avoids switching states
Depth-First Search
Fusion function characteristics known
4.
No. of slots to allocate per node

37
Centralized Algorithm - I
DFS gives a topological sort

Conflict-free
But, inefficient
c
1
d
2
e
3
i 10
f 7
b 4
g
5
h
6
j
8
k
9
38
Centralized Algorithm - II
Complete graph knowledge

Allocate minimum slotnumber without conflict
Slotparent > max(slotchild)
c
1
d
2
e
3
i 6
f 5
b 4
g
1
Assume complete graph knowledge

Inter-cluster interference not accounted
h
2
j
3
k
1
39
Distributed Protocol
Token sent in DFS-order

Parent sends token to each
child, child send back
Nodes know its 2-hop
neighborhood
b 4
c
1
d
2
e
3
i 6
f 5
g
1
h
2
j
3
k
1
40
Inter-cluster Interference
To support parent->child &

child->child communication
If node j was near node g,
it cannot know about 2/3
All nodes locally broadcast
after sub-tree is done
Node j now knows about
allocated slots
f 3
1 g
41
Fusion Function
Characteristics
Nodes know about fusion

function through IES
Determines no. of slots to
allocate for forwarding
Fusion functions assumed to
be simple
Does not depend on input,
or has a bound
3,4,5 (all data)

f 3 (maximum)
1 g
42
Similarity with graph coloring
Network is taken as graph, G

2
Graph G is formed
V: same vertex set as G

E: 2-hop connected in G
Minimal graph coloring of G is similar to my

scheduling
NP-hard problem, so approximate
chromaticity of graph is relevant
2
43
Thesis Outline
Introduction
An Adaptive Sensor Network Architecture
Multi-scale Data Service [Published]
Hierarchical Medium Access [Work in Progress]
TODO: Toy applications with interfaces, for MAC

evaluation, as well as to demonstrate ease of
programmability
TODO: Complete design description. Simulate and
jointly evaluate with routing
Adaptive Clock Synchronization [Published]

Conclusion
44
The End
Comments
Feedback
Questions
Critique
45

An Adaptive Sensor Network Architecture For Multi-Scale Communication

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

An Adaptive Sensor Network Architecture For Multi-Scale Communication

Uploaded by

Copyright:

Available Formats

An Adaptive

Sensor Network Architecture

May 12, 2005

Sensor Node Applications

Sensor nodes can sense,

Computer Science | Rice University | PhD Proposal

Multi-scale implies that data is sensed,

Collaborative Monitoring, Wavelet Compression

Illustrative example follow

Computer Science | Rice University | PhD Proposal

Finer Scale Drilling

Computer Science | Rice University | PhD Proposal

Propose a COMPASS networking architecture

Computer Science | Rice University | PhD Proposal

Computer Science | Rice University | PhD Proposal

Layering is a design principle, and is

Each layer is independent of another layer

Applications and networking are developed

Computer Science | Rice University | PhD Proposal

Limited set of application requirements

Node is not important, content is

Energy, computational and communication capability

Hierarchy is a well-known way for scalability

Data Fusion Capability

In-network processing (E.g,: Averaging)

COMPASS Design Goals

Example: MAC knows communication schedule

Adaptable for specific application

Example: Routing has cost and latency tradeoff

Network Programming Interface (NPI)

Example: Logical naming instead of physical

Computer Science | Rice University | PhD Proposal

COMPASS Network Architecture

COMPASS Network Architecture

2. Multi-Scale Data Service

Computer Science | Rice University | PhD Proposal

Traditional sensor routing One Scale

Directed Diffusion, Trickle

Abstract Region neighborhood communication

Computer Science | Rice University | PhD Proposal

Nodes choose to become cellheads

Starts broadcasting beacons

Repeat this process

Computer Science | Rice University | PhD Proposal

Adaptivity using Selectors

Hop proximity is relevant for some applications

Selector = (attribute, value, operator)

Computer Science | Rice University | PhD Proposal

Get & Put support for both types

Low-rate data generation, high interest => put

3 different kinds of addressing

Parent, Cell, Peer

Max. temp in cell

With the parent node

With peer nodes

Reverse path of beacon packet of parent

Within the cell

Optimal cell flooding using approximate

Computer Science | Rice University | PhD Proposal

Computer Science | Rice University | PhD Proposal

Clock Synchronization Service

Important service in sensor networks

Medium access scheduling