Ubiquitous Office Ubiquitous Office Applications using Applications using Sensor NetworksSensor Networks
Jasmeet ChhabraJasmeet ChhabraW. Steven ConnerW. Steven ConnerLakshman KrishnamurthyLakshman KrishnamurthyAsish Shah Asish Shah Mark YarvisMark YarvisNetwork Architecture LabNetwork Architecture Lab
Steven FordyceSteven FordyceEmerging Platforms LabEmerging Platforms Lab
Our 1Our 1stst step: Create an election protocol for Hierarchical Energy/Resource- step: Create an election protocol for Hierarchical Energy/Resource-Aware Self-OrganizationAware Self-Organization
AssumptionsAssumptions– All nodes in a dense network need not be relays or routersAll nodes in a dense network need not be relays or routers– Nodes that are not relays can sleep most of the timeNodes that are not relays can sleep most of the time– Network nodes will have heterogeneous energy sources (line power, battery Network nodes will have heterogeneous energy sources (line power, battery
power)power)
ProblemProblem– Elect a set of nodes in the network that must be relays Elect a set of nodes in the network that must be relays
SolutionSolution– Relays establish full connectivity in the networkRelays establish full connectivity in the network
– Adaptive BackboneAdaptive Backbone– Run data aggregation/routing protocols on top of backboneRun data aggregation/routing protocols on top of backbone
– Directed Diffusion (Estrin), Energy Aware Routing (Shah/Rabey), AODV, Directed Diffusion (Estrin), Energy Aware Routing (Shah/Rabey), AODV, DSDV rely on flooding in discovery phaseDSDV rely on flooding in discovery phase
– This protocol minimizes the set of nodes that participateThis protocol minimizes the set of nodes that participate
– Routes are automatically biased toward high-energy nodesRoutes are automatically biased toward high-energy nodes
1. Each node elects master Each node elects master relay neighbor based on energy metricrelay neighbor based on energy metric
Local Relay Election StepsLocal Relay Election Steps
8
6
10
2
10
8
75
9
6
10
9
7
4
8
3
8
63
2
10
8
3
5
9
6
10
9
7
2
3
9
3
8
10
2
7
5 8
10
7
38
3
8
6
10
2
10
8
75 9
6
10
4
7
4
383
7
8
4
4
43
3
3
3
4
8
6
10
2
10
8
75
9
6
10
9
7
4
8
3
8
63
2
10
8
3
5
9
6
10
9
7
2
3
9
3
8
10
2
7
5 8
10
7
38
3
8
6
10
2
10
8
75 9
6
10
4
7
4
383
7
8
4
4
43
3
3
3
4
8
6
10
2
10
8
75
9
6
10
9
7
4
8
3
8
63
2
10
8
3
5
9
6
10
9
7
2
3
9
3
8
10
2
7
5 8
10
7
38
3
8
6
10
2
10
8
75 9
6
10
4
7
4
383
7
8
4
4
43
3
3
3
4
8
6
10
2
10
8
75
9
6
10
9
7
4
8
3
8
63
2
10
8
3
5
9
6
10
9
7
2
3
9
3
8
10
2
7
5 8
10
7
38
3
8
6
10
2
10
8
75 9
6
10
4
7
4
383
7
8
4
4
43
3
3
3
4
8
6
10
2
10
8
75
9
6
10
9
7
4
8
3
8
63
2
10
8
3
5
9
6
10
9
7
2
3
9
3
8
10
2
7
5 8
10
7
38
3
8
6
10
2
10
8
75 9
6
10
4
7
4
383
7
8
4
4
43
3
3
3
4
In this example, ReOrg enables full communication using only 19% of 70 nodes
Example Example RelayOrgRelayOrg in a in a Dense Sensor NetworkDense Sensor Network
ReOrgReOrg Characteristics Characteristics
– Complexity: Each node stores 1-hop and Complexity: Each node stores 1-hop and 2-hop neighbor list and best next hop for 2-hop neighbor list and best next hop for each 2-hop neighboreach 2-hop neighbor
– Storage Storage 4n 4n
(assuming average 2n 2-hop nbrs)(assuming average 2n 2-hop nbrs)
– Normalized energy metric is remaining time-Normalized energy metric is remaining time-to-live before battery depleted to-live before battery depleted
(max. value for line-powered nodes)(max. value for line-powered nodes)
Intel Labs
Zero Negotiation MAC-level Synchronization Zero Negotiation MAC-level Synchronization protocolprotocol
Sleep to save energySleep to save energy Neighbors must wake up Neighbors must wake up
synchronized to each other to synchronized to each other to communicatecommunicate
• No global clock synchronizationNo global clock synchronization
• No negotiationNo negotiation
A B C
A
B
C
D
A B C
D’s own notion of slotted time
A B CD D
Short periodic intent messagesShort periodic intent messages Data messages scheduled at Data messages scheduled at
random timesrandom times– Advertised in intent messageAdvertised in intent message
Intel Labs
First results from the network: 15 nodesFirst results from the network: 15 nodesAverage Traffic Per Node vs. Packet
Generation Rate
36.18
18.28
10.335.18
26.93
1.37 2.33 3.70
0.00
10.00
20.00
30.00
40.00
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
Generated Packets/Minute/Node
To
tal
Pac
kets
/Min
ute
/No
de
Average RX Count
Average TX Count
Error Rate vs. Packet Generation Rate
1.1 1.32.7
15
0
5
10
15
20
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
Generated Packets/Minute/Node%
Av
era
ge
Err
or
%Avg Error
Mode Usage vs. Packet Generation Rate
8.16.75.2 9.9
88.890.892.293.6
0
20
40
60
80
100
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
Generated Packets/Minute/Node
% T
ime
in
Mo
de
%Avg PUP
%Avg PSAVE
Intel Labs
What is the nearest available conference
room?
How many people are in the
gym? Is the treadmill free?
Motion Sensor:Room 3201 is
Empty
What is the average temperature on the
second floor?
What is next: Office What is next: Office ApplicationsApplications
Applications that improve/distribute resource utilization Applications that improve/distribute resource utilization – E.g., conference rooms, vending rooms, inventory tracking etc.E.g., conference rooms, vending rooms, inventory tracking etc.– As a Ubicomp reviewer pointed out:As a Ubicomp reviewer pointed out:
– ““Some people may also be interested in finding Some people may also be interested in finding hot spotshot spots in a in a building, where lots of people are congregating…” (something building, where lots of people are congregating…” (something interesting may be happening there!)interesting may be happening there!)
– How to support local users that move around?How to support local users that move around?– What are the right user interfaces?What are the right user interfaces?
Instrumentation of buildings for facilities management Instrumentation of buildings for facilities management analysisanalysis
– Would a better designed building be better utilized?Would a better designed building be better utilized?
How to make applications that show value in increased How to make applications that show value in increased productivity?productivity?
– $$$$
Intel Labs
BackupBackup
Intel Labs
Focus
Berkeley Mote
Mega Mote
Intel® Xscale™
Heterogeneous Network:Scavenge,Battery, Line power Tiny nodes, Powerful nodes
Solve the following hard challenges:Solve the following hard challenges:
1.1. Network Architecture and Self-Organization: Network Architecture and Self-Organization:
– Autonomous formation of networks with Autonomous formation of networks with 100s or 1000s of nodes100s or 1000s of nodes
– In the presence of energy and resource In the presence of energy and resource constraintsconstraints
2.2. Proactive and Efficient Data Acquisition: Proactive and Efficient Data Acquisition:
– How to implement efficient data acquisition How to implement efficient data acquisition on top of the self-organizing network?on top of the self-organizing network?
– Need to avoid centralized data warehousingNeed to avoid centralized data warehousing
Deliver Protocol Building BlocksDeliver Protocol Building Blocks– Implement these protocols in a reusable, Implement these protocols in a reusable,
Election protocol to create Hierarchical Energy/Resource-Election protocol to create Hierarchical Energy/Resource-aware Self-Organizationaware Self-Organization
– Organizes network into a hierarchical adaptive backbone based Organizes network into a hierarchical adaptive backbone based on energy and node capabilityon energy and node capability
– Protocol scales to node capabilityProtocol scales to node capability
Zero-negotiation synchronization protocol Zero-negotiation synchronization protocol – Allows energy constrained nodes to sleep and wake up in a Allows energy constrained nodes to sleep and wake up in a
synchronized mannersynchronized manner
– Does not prevent collisions – tries to minimize Does not prevent collisions – tries to minimize
In-network data aggregation protocol and caching In-network data aggregation protocol and caching – Leverages sleep/wake up schedules from self-organizationLeverages sleep/wake up schedules from self-organization
– Usage pattern driven acquisition and data caching in higher-Usage pattern driven acquisition and data caching in higher-end nodesend nodes
– Distributed caching in low-end nodes in the absence of higher-Distributed caching in low-end nodes in the absence of higher-end nodesend nodes
Networks
ProactiveComputing
Ubiquitously Ubiquitously DeployedDeployed
Primary ObjectivesPrimary Objectives New IdeasNew Ideas
Real world Real world information: information: anywhere, anywhere, anytime!anytime!
![[IJCST-V3I4P5]: Ajay Kumar, Jasmeet Singh](https://static.documents.pub/doc/80x56/55cf8620550346484b9487ac/ijcst-v3i4p5-ajay-kumar-jasmeet-singh.jpg)
