scalable data aggregation for dynamic events in sensor networks
DESCRIPTION
Scalable Data Aggregation for Dynamic Events in Sensor Networks. Kai-Wei Fan, Sha Liu, Prasun Sinha Dept. of Computer Science and Engineering The Ohio State University Sensys 2006. Outline. Introduction Dynamic Forwarding over tree on Directed Acyclic Graph (ToD) One Dimensional Network - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/1.jpg)
1
Scalable Data Aggregation for
Dynamic Events in Sensor NetworksKai-Wei Fan, Sha Liu, Prasun Sinha
Dept. of Computer Science and EngineeringThe Ohio State University
Sensys 2006
![Page 2: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/2.jpg)
2
Outline Introduction Dynamic Forwarding over tree on Directed Acy
clic Graph (ToD) One Dimensional Network Two Dimensional Network
Simulation Results Conclusion
![Page 3: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/3.jpg)
3
Introduction - Data
Aggregation Motivations
Communication cost is higher than computation cost
In-network processing reduces number/size of packets
Challenges Dynamic events Protocol must use low energy for long network
lifetime
![Page 4: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/4.jpg)
4
Introduction - Related Works Static Structure Dynamic Structure Structure-Free
![Page 5: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/5.jpg)
5
Data Aggregation ApproachesStatic Structure Routing on a pre-computed structure
Doesn’t need maintain overhead Suitable for unchanging traffic pattern
Inappropriate for dynamic event Without or Later data aggregation
a b
![Page 6: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/6.jpg)
6
Data Aggregation ApproachesDynamic Structure Create a structure dynamically Has optimal aggregation High control overhead for dynamic events
a bc
![Page 7: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/7.jpg)
7
Data Aggregation ApproachesStructure-Free (DAA, Infocom ’06)
Improve aggregation without any structure Data aware anycast to achieve spatial convergence Randomized waiting to improve temporal convergence
No guarantee of aggregation for allpackets
![Page 8: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/8.jpg)
8
Data aware anycast Based on anycasting at the MAC layer for determining the nex
t-hop node for each transmission Randomized Waiting
Each node generating a new packet to transmit, delays it by an interval chosen from 0 toτ
Sender
X
Sink
T=1
RTS(AID=1)
1
1
Sender
X
Sink
CTSSender
X
Sink
Pkt
Data Aggregation ApproachesStructure-Free (DAA, Infocom ’06)
![Page 9: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/9.jpg)
9
Introduction – Motivations and Goals Motivations
Propose a scalable structure-less protocol Structure-free: Local data aggregation Structured: further aggregation and Guarantee
early aggregation
Goals Low overhead of structure construction and
maintenance Suitable for dynamic event scenarios
![Page 10: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/10.jpg)
10
Dynamic Forwarding over ToD- Basic Idea
……
……………………
……………………
……
network
sink
sink
DAA
![Page 11: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/11.jpg)
11
Dynamic Forwarding over ToD- Basic Idea First phase: DAA
Packets are forwarded and aggregated to the selected node (F-aggregator)
Second phase: Dynamic forwarding Further aggregation (S-aggregator) In one dimensional networks In two dimensional networks
![Page 12: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/12.jpg)
12
Dynamic Forwarding over ToD- in one dimensional networks Assume a cell
a square with a side length is greater than the maximum diameter of
events
……
……………………
……………………
……
network
one row instance of the network
Cell
F-cluster S-cluster
![Page 13: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/13.jpg)
13
Dynamic Forwarding over ToD- F-Tree All nodes in F-clusters send their packets to their
cluster-heads, called F-aggregators Nodes in the F-cluster can be multiple hops away
from the F-aggregator. Each F-aggregator then creates a shortest path to
the sink
sink
F-clusters
F-cluster-head
![Page 14: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/14.jpg)
14
Dynamic Forwarding over ToD- S-Tree Each S-cluster also has a cluster head, S-
aggregator, for aggregating packets. Each S-aggregator create a shortest path
to the sink
sink
S-cluster
S-cluster-head
![Page 15: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/15.jpg)
15
Dynamic Forwarding over ToD- Further aggregation
sink
F-clusters
F-cluster-head
sink
S-cluster
S-cluster-head
a b
a b
f4
s4s3
sink
a b
f4
s4s3
![Page 16: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/16.jpg)
16
F1
Dynamic Forwarding over ToD- Three cases
sink
The Event occurs in one cell and a F-cluster
b
sink
F1
The Event occurs in two cells and a F-cluster
a b
sink
F1
S1
F2
The Event occurs in two cells and a S-cluster
b c
Using DAA to determine the event span one or two cells
![Page 17: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/17.jpg)
17
C1
A4 B3
B1 C2
A3
A1 A2 B2
B4 C3 C4
D3
D1 D2
D4 E3
E1 E2
E4 F3
F1 F2
F4
G1 G2 H1 H2 I1 I2
Dynamic Forwarding over ToD- in two dimensional networks
A B C
D
G H I
E F
S1 S2
S3 S4
G3 G4 H3 H4 I3 I4
F-Clusters Cells S-Clusters
An event can span at most four cells
![Page 18: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/18.jpg)
18
Dynamic Forwarding Rules For packets generated only in one F-cluster, their
packets can be aggregated at the F-aggregator An event triggers nodes in different F-clusters
In the same S-cluster: aggregate at the S-aggregator In the different two S-clusters
F-cluster
F-cluster head
S-cluster
S-cluster head
![Page 19: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/19.jpg)
19
Dynamic Forwarding Rules To guarantee the aggregation, the F-aggregator of
F-cluster X forwards the packet through two S-aggregators
To firstly select the S-aggregator that is closer to the sink
![Page 20: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/20.jpg)
20
Clustering and Aggregator Selection Assume that sensor nodes know their physical location Nodes in an F-cluster and S-cluster have to select an
aggregator and change the role periodically Elect themselves as cluster-head with probability based on
metrics such as the residual energy Use a hash function to hash the current time to a node within
that cluster To simplify the control overhead of the cluster head, F-
cluster-head also takes the role of S-cluster-head
![Page 21: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/21.jpg)
21
Simulation Results Simulator: ns2 2000m*1200m (35 X 58 grid network) A total of 1938 nodes TX Range: 50m Perfect aggregation
![Page 22: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/22.jpg)
22
Simulation Results
OPT
ToD
DAA
SPT
![Page 23: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/23.jpg)
23
Simulation Results
SourcesngContributiofNumber
onsTransmissiTotalofNumber
DAA
SPT
OPTToD
DAA
OPT
ToD
The event size is 400m in diameterNormalized number of transmission:
![Page 24: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/24.jpg)
24
Simulation Results
DAA
SPT
OPTToD
![Page 25: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/25.jpg)
25
Simulation Results
for difference cell sizes
Event Size: 200m, 400m, 600m in diameter
200m
400m
600m
![Page 26: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/26.jpg)
26
Conclusion Proposed a semi-structures approach
Structure-Free Aggregation Dynamic Forwarding on ToD for Scalability without overhead of structure computation and ma
intenance
![Page 27: Scalable Data Aggregation for Dynamic Events in Sensor Networks](https://reader036.vdocuments.mx/reader036/viewer/2022070402/56813870550346895da01ee1/html5/thumbnails/27.jpg)
27
Thank you