Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion...
-
Upload
andrew-boyd -
Category
Documents
-
view
217 -
download
0
Transcript of Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion...
![Page 1: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/1.jpg)
1
Data Aggregation In Wireless Sensor Networks
Dave McKenney
![Page 2: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/2.jpg)
2
Presentation Outline
Introduction Algorithms/Approaches
Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact Top-K (EXTOK) Histogram Incremental Update (HIU) Distributed Data Cube
Conclusion
![Page 3: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/3.jpg)
3
Introduction
What is data aggregation? Why is it important?
![Page 4: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/4.jpg)
4
Aggregation Concerns
Energy vs. Latency vs. Accuracy
0
10
20
30
40
50
60
70
80
LatencyAccuracy
Energy
![Page 5: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/5.jpg)
5
Tiny Aggregation (TAG)1
Maintain tree structure Aggregate at internal nodes
[1] S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, “Tag: a tiny aggregation service for ad-hoc sensor networks,” ACM SIGOPS Operating Systems Review, vol. 36, no. SI, pp. 131–146, 2002.
![Page 6: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/6.jpg)
6
Max – No Aggregation
5
7 4
8 3 1 9
Total Messages: 0
![Page 7: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/7.jpg)
7
7 4
Max – No Aggregation
8 3 1 9
Total Messages: 1
Max Max
Numbers: [5]5
![Page 8: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/8.jpg)
8
Max – No Aggregation
5
8 3 1 9
Total Messages: 5
7 4
Max Max Max Max
Numbers: [5,7,4]
7 4
![Page 9: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/9.jpg)
9
Max – No Aggregation
5
3 1
Total Messages: 9
8 9
8 9
Numbers: [5,7,4,8,9]
47
8 9
![Page 10: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/10.jpg)
10
Max – No Aggregation
5
8 9
Total Messages: 13
3 1
3 1
Numbers: [5,7,4,8,9,3,1]
Max: 9
7 4
13
![Page 11: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/11.jpg)
11
Max – With TAG
5
7 4
8 3 1 9
Total Messages: 0
![Page 12: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/12.jpg)
12
Max – With TAG
7 4
8 3 1 9
Total Messages: 1
Max Max
5
![Page 13: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/13.jpg)
13
Max – With TAG
5
8 3 1 9
Total Messages: 3
Max Max Max Max
7 4
![Page 14: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/14.jpg)
14
Max – With TAG
5
7 4
Total Messages: 7
8 93 1
[7,8,3] [4,1,9]
8 3 1 9
![Page 15: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/15.jpg)
15
Max – With TAG
5
8 3 1 9
Total Messages: 9
[7,8,3] [4,1,9]
8 9
7 4
![Page 16: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/16.jpg)
16
Max – With TAG
5
7 4
8 3 1 9
Total Messages: 9 (vs. 13) [5,8,9]Max: 9
![Page 17: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/17.jpg)
17
‘Global’ Synchronization
![Page 18: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/18.jpg)
18
TAG Results
![Page 19: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/19.jpg)
19
TAG Results
![Page 20: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/20.jpg)
20
TAG Summary
Advantages Disadvantages
Zero estimation errorEnergy efficient (vs. centralized)
Vulnerable to node lossMust maintain tree structureIncreased latency
![Page 21: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/21.jpg)
21
Synopsis Diffusion (SD)2
Multipath routing How to handle duplicate information
Order and Duplicate Insensitive (ODI) Aggregation
Example: Count - Flajolet and Martin [3] Introduces approximation error
[2] S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson, “Synopsis diffusion for robust aggregation in sensor networks,” in Proceedings of the 2nd international conference on Embedded networked sensor systems, 2004, pp. 250–262.[3] P. Flajolet and G. Nigel Martin, “Probabilistic counting algorithms for data base applications,” Journal of Computer and System Sciences, vol. 31, no. 2, pp. 182–209, 1985.
![Page 22: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/22.jpg)
22
SD Structure/Routing
Ring 1
Ring 2
Ring 3
![Page 23: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/23.jpg)
23
SD Structure/Routing
Ring 1
Ring 2
Ring 3
![Page 24: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/24.jpg)
24
SD Structure/Routing
Ring 1
Ring 2
Ring 3
![Page 25: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/25.jpg)
25
SD Structure/Routing
Ring 1
Ring 2
Ring 3
![Page 26: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/26.jpg)
26
SD Results
![Page 27: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/27.jpg)
27
SD Summary
Advantages Disadvantages
More robust than TAG Approximation errorIncreased message size
![Page 28: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/28.jpg)
28
Tributaries & Deltas (TD)4
Combine TAG and SD approaches
M-Node
T-Node
[4] A. Manjhi, S. Nath, and P. B. Gibbons, “Tributaries and deltas: efficient and robust aggregation in sensor network streams,” in Proceedings of the 2005 ACM SIGMOD international conference on Management of data, 2005, pp. 287–298.
![Page 29: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/29.jpg)
29
TD-Coarse vs. TD
Nodes change based on percent contributing Expand when % < threshold, decrease if % >
threshold TD-Coarse
Expand: Switch all possible T nodes to M nodes Decrease: Switch all possible M nodes to T nodes
TD Expand: Switch any T node below M node with
percentage contributing < threshold Decrease: Switch M nodes to T node if percent
contributing > threshold
![Page 30: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/30.jpg)
30
TD Results
![Page 31: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/31.jpg)
31
TD Summary
Advantages Disadvantages
Adapts to network stateIncreased robustness (vs. TAG)Lower estimation error (vs. SD)Lower error than SD or TAG
Increased overhead (switching nodes)Requires network node count
![Page 32: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/32.jpg)
32
OPAG5
[5] Z. Chen and K. G. Shin, “OPAG: Opportunistic Data Aggregation in Wireless Sensor Networks,” in 2008 Real-Time Systems Symposium, 2008, pp. 345-354.
![Page 33: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/33.jpg)
33
OPAG Layers
![Page 34: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/34.jpg)
34
OPAG Results
![Page 35: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/35.jpg)
35
OPAG Results
![Page 36: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/36.jpg)
36
OPAG Summary
Advantages Disadvantages
Increased robustness (vs. TAG)
Increased overhead
![Page 37: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/37.jpg)
37
Exact Top-k6
Find the top most k elements in the WSN
TAG Full update every epoch
FILA Uses filters approximations
Exact Top-k Exact result Partial updates
[6] B. Malhotra, M. A. Nascimento, and I. Nikolaidis, “Exact top-k queries in wireless sensor networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 10, pp. 1513-1525, 2010.
![Page 38: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/38.jpg)
38
Exact Top-k Example
7 4
8 3 1 9
Top-2 Top-2
5
![Page 39: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/39.jpg)
39
Exact Top-k Example
5
8 3 1 9
Top-2 Top-2 Top-2 Top-2
[7] [4]7 4
![Page 40: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/40.jpg)
40
Exact Top-k Example
5
7 4
8 3 1 9
[7,8,3] [4,1,9]
8 3 1 9
![Page 41: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/41.jpg)
41
Exact Top-k Example
5
8 3 1 9
[7,8,3] [4,1,9]
7,8 4,9
[5,7,8,4,9]Top-2: [8,9]α: 8
7 4
![Page 42: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/42.jpg)
42
Exact Top-k Example
8 3 1 9
8 8
Top-2: [8,9]α: 8
TM-Node
F-Node
8 8 8 8
7 4
5
![Page 43: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/43.jpg)
43
Exact Top-k Example
5
7 7
8 5 2 9
Top-2: [8,9]α: 8
TM-Node
F-Node
35 12
47
![Page 44: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/44.jpg)
44
Exact Top-k Example
5
7
8 5 2 9
Top-2: [9,10]α: 9
TM-Node
F-Node
710
10
10
![Page 45: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/45.jpg)
45
Exact Top-k Example
8 3 1 9
9 9
Top-2: [9,10]α: 9
TM-Node
F-Node
9 9 9 9
7 10
5
![Page 46: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/46.jpg)
46
Exact Top-k Results
![Page 47: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/47.jpg)
47
Exact Top-k Summary
Advantages Disadvantages
Provides exact answerRequires only partial update
Unaware if a top-k node dies
![Page 48: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/48.jpg)
48
HIU Algorithm7
TAG Histogram requires complete update
Histogram Incremental Update (HIU) Sensors update if value leaves previous
bin Nodes store value and previous partial
state Update message – the change in bin
count[0,1,2,2,1] [1,1,1,1,1] = [1,0,-1,-1,0]
Updates may negate each other[7] K. Ammar and M. A. Nascimento, “Histogram and other aggregate queries in wireless sensor networks,” in Proc. of SSDBM, 2011, pp. 1-12.
![Page 49: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/49.jpg)
49
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2
[0,1,0] [0,1,0] [1,0,0] [1,0,0]
[0,1,0] [0,1,0] [1,0,0] [1,0,0]
3 3 0 1
![Page 50: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/50.jpg)
50
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2
[0,1,0] [0,1,0] [1,0,0] [1,0,0]
[0,1,0] [0,1,0] [1,0,0] [1,0,0]
[0,0,1]+ [0,1,0] [0,1,0]= [0,2,1]
[1,0,0]+ [1,0,0]
[0,1,0]= [2,1,0]
3 3 0 1
![Page 51: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/51.jpg)
51
5
HIU Example
Bins: 0-1, 2-3, 4-5
3 3 0 1[0,1,0] [0,1,0] [1,0,0] [1,0,0]
[0,2,1] [2,1,0]
[0,2,1] [2,1,0]
[0,2,1] + [2,1,0] + [0,0,1] = [2,3,2]
4 2
![Page 52: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/52.jpg)
52
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2
3 3 0 1[0,1,0] [0,1,0] [1,0,0] [1,0,0]
[0,2,1] [2,1,0]
[2,3,2]
![Page 53: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/53.jpg)
53
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2
1 4 1 2
[0,2,1] [2,1,0]
[2,3,2]
31 34 01 12
[0,1,0][1,0,0] [0,1,0][0,0,1] [1,0,0][1,0,0] [1,0,0][0,1,0]
![Page 54: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/54.jpg)
54
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2[0,2,1] [2,1,0]
[2,3,2]
31 34 01 12
[0,1,0][1,0,0] [0,1,0][0,0,1] [1,0,0][1,0,0] [1,0,0][0,1,0]
[1,-1,0] [0,-1,1] [-1,1,0]
1 4 1 2
![Page 55: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/55.jpg)
55
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2 [1,-1,0]
+ [0,-1,1] = [1,-2,1] [-1,1,0]
[2,3,2]
31 34 01 12
[0,1,0][1,0,0] [0,1,0][0,0,1] [1,0,0][1,0,0] [1,0,0][0,1,0]
[1,-1,0] [0,-1,1] [-1,1,0]
1 4 1 2
![Page 56: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/56.jpg)
56
HIU Example
Bins: 0-1, 2-3, 4-5 5
1 4 1 2
[1,-1,0] + [0,-1,1]
= [1,-2,1] [-1,1,0]
[2,3,2] + [1,-2,1] + [-1,1,0] = [2,2,3]
31 34 01 12
[1,0,0] [0,0,1] [1,0,0] [0,1,0]
[1,-1,0] [0,-1,1] [-1,1,0]
[1,-2,1] [-1,1,0]
4 2
![Page 57: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/57.jpg)
57
HIU Example
Bins: 0-1, 2-3, 4-5 5
4 2
1 4
[1,0,2]
[-1,1,0]+ [1,-1,0]= [0,0,0]
[2,2,3]
12 21
[1,0,0] [0,0,1] [1,0,0][0,1,0] [0,1,0][1,0,0]
[-1,1,0] [1,-1,0]
Cancellation = No Update Required
2 1
![Page 58: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/58.jpg)
58
Other Aggregates
Other aggregates can be estimated
![Page 59: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/59.jpg)
59
HIU Results
![Page 60: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/60.jpg)
60
HIU Summary
Advantages Disadvantages
Partial updatesPossible cancellationsEstimate other aggregates
|Partial State| = |Histogram|
![Page 61: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/61.jpg)
61
Fast and Simultaneous Multi-Region Aggregation8
Solutions so far are for single values Aims for multiple simultaneous
aggregates Assumes (questionably) a grid
topology See [8] and [9] for details
Uses distributed data cube Idea taken from database systems
[8] D. Wu and M. H. Wong, “Fast and simultaneous data aggregation over multiple regions in wireless sensor networks,” Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, vol. 41, no. 3, pp. 333-343, 2011.[9] X. Li, Y. J. Kim, R. Govindan, and W. Hong, “Multi-dimensional range queries in sensor networks,” in Proceedings of the 1st international conference on Embedded networked sensor systems, 2003, pp. 63–75.
![Page 62: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/62.jpg)
62
PS Cube Calculation
32 + 247 + 173 – 115 = 337
)1,1()1,(),1(),(),( yxpSumyxpSumyxpSumyxvyxpSum
![Page 63: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/63.jpg)
63
Region Definition (e:f)
![Page 64: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/64.jpg)
64
Region Calculation (e:f)
Sum(e:f) = pSum(xf,yf) – pSum(xe – 1, yf) – pSum(xf, ye – 1) + pSum(xe – 1, ye – 1)
![Page 65: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/65.jpg)
65
Region Calculation (e:f)
Sum(e:f) = pSum(xf,yf) – pSum(xe – 1, yf) – pSum(xf, ye – 1) + pSum(xe – 1, ye – 1)
![Page 66: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/66.jpg)
66
Region Calculation (e:f)
Sum(e:f) = pSum(xf,yf) – pSum(xe – 1, yf) – pSum(xf, ye – 1) + pSum(xe – 1, ye – 1)
![Page 67: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/67.jpg)
67
Region Calculation (e:f)
Sum(e:f) = pSum(xf,yf) – pSum(xe – 1, yf) – pSum(xf, ye – 1) + pSum(xe – 1, ye – 1)
![Page 68: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/68.jpg)
68
Region Calculation (e:f)
Sum(e:f) = pSum(xf,yf) – pSum(xe – 1, yf) – pSum(xf, ye – 1) + pSum(xe – 1, ye – 1)
![Page 69: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/69.jpg)
69
Data Cube Summary
Advantages Disadvantages
Theoretically fast queriesMultiple simultaneous queries
Very limiting assumptionsIncreased overhead/latencyNo empirical comparison
![Page 70: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/70.jpg)
70
Conclusion
A number of approaches, each with own tradeoffs
More details and works will be available in the report
![Page 71: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/71.jpg)
71
Bibliography
[1] S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, “Tag: a tiny aggregation service for ad-hoc sensor networks,” ACM SIGOPS Operating Systems Review, vol. 36, no. SI, pp. 131–146, 2002.
[2] S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson, “Synopsis diffusion for robust aggregation in sensor networks,” in Proceedings of the 2nd international conference on Embedded networked sensor systems, 2004, pp. 250–262.
[3] P. Flajolet and G. Nigel Martin, “Probabilistic counting algorithms for data base applications,” Journal of Computer and System Sciences, vol. 31, no. 2, pp. 182–209, 1985.
[4] A. Manjhi, S. Nath, and P. B. Gibbons, “Tributaries and deltas: efficient and robust aggregation in sensor network streams,” in Proceedings of the 2005 ACM SIGMOD international conference on Management of data, 2005, pp. 287–298.
[5] Z. Chen and K. G. Shin, “OPAG: Opportunistic Data Aggregation in Wireless Sensor Networks,” in 2008 Real-Time Systems Symposium, 2008, pp. 345-354.
[6] B. Malhotra, M. A. Nascimento, and I. Nikolaidis, “Exact top-k queries in wireless sensor networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 10, pp. 1513-1525, 2010.
[7] K. Ammar and M. A. Nascimento, “Histogram and other aggregate queries in wireless sensor networks,” in Proc. of SSDBM, 2011, pp. 1-12.
[8] D. Wu and M. H. Wong, “Fast and simultaneous data aggregation over multiple regions in wireless sensor networks,” Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, vol. 41, no. 3, pp. 333-343, 2011.
[9] X. Li, Y. J. Kim, R. Govindan, and W. Hong, “Multi-dimensional range queries in sensor networks,” in Proceedings of the 1st international conference on Embedded networked sensor systems, 2003, pp. 63–75.
![Page 72: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/72.jpg)
72
Question #1 A prefix-sum (PS) cube is a cube (or grid in this case) in which an entry summarizes the
aggregate sum of all values above and to the left of the grid entry. Using the prefix-sum values, a sum aggregate can then be easily calculated for a specified region using certain values bordering the defined region. Fill in the PS data-cube below and calculate the aggregate sum for the rectangular region (x=2,y=1):(x=3,y=3).
![Page 73: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/73.jpg)
73
Question #1 - Answer A prefix-sum (PS) cube is a cube (or grid in this case) in which an entry summarizes the
aggregate sum of all values above and to the left of the grid entry. Using the prefix-sum values, a sum aggregate can then be easily calculated for a specified region using certain values bordering the defined region. Fill in the PS data-cube below and calculate the aggregate sum for the rectangular region (x=2,y=1):(x=3,y=3).
Sum(x=2,y=1:x=3,y=3) = 648 – 302 – 136 + 57 = 267
![Page 74: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/74.jpg)
74
Question #2 Using the Histogram Incremental Update (HIU) aggregation algorithm, leaf nodes propagate
changes in their local histogram by sending update messages to their parent (if required). These changes are locally aggregated at internal nodes and continuously moved up the tree until they reach the root node, which can then determine the overall network histogram. Show the update messages sent using the HIU algorithm if the values change as specified.
Bins: 0-1, 2-3, 4-5 5
2
31 34 21 122 1
4
3 3
![Page 75: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/75.jpg)
75
Question #2 - Answer Using the Histogram Incremental Update (HIU) aggregation algorithm, leaf nodes propagate
changes in their local histogram by sending update messages to their parent (if required). These changes are locally aggregated at internal nodes and continuously moved up the tree until they reach the root node, which can then determine the overall network histogram. Show the update messages sent using the HIU algorithm if the values change as specified.
Bins: 0-1, 2-3, 4-5 5
2
31 34 21 12
[0,1,0][1,0,0] [0,1,0][0,0,1] [0,1,0][1,0,0] [1,0,0][0,1,0]
[1,-1,0] [0,-1,1] [1,-1,0] [-1,1,0]
[1,-1,0] + [0,-1,1]
= [1,-2,1]
[1,-2,1]
[-1,1,0]+ [1,-1,0]= [0,0,0]
2 1
4
3 3
Update messages in red.
![Page 76: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/76.jpg)
Question #3 When calculating the EXACT top-k aggregate for a tree, temporal monitoring (TM) nodes are
required to update the root every time their sensor value changes, while filtering (F) nodes are only required to send an update when they violate a filter value (essentially the same idea as a threshold). Identify the F and TM nodes in the tree on the left after top-2 is executed. Identify which nodes are required to send an update to the sink in the tree on the right.
7 4
8 3 1 9
5
7 4
8 3 1 9
5
37 910
79 46
![Page 77: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/77.jpg)
Question #3 – Answer 1
7 4
8 3 1 9
5
7 4
8 3 1 9
5TM-Node
F-Node
37 910
79 46
When calculating the EXACT top-k aggregate for a tree, temporal monitoring (TM) nodes are required to update the root every time their sensor value changes, while filtering (F) nodes are only required to send an update when they violate a filter value (essentially the same idea as a threshold). Identify the F and TM nodes in the tree on the left after top-2 is executed. Identify which nodes are required to send an update to the sink in the tree on the right.
![Page 78: Dave McKenney 1. Introduction Algorithms/Approaches Tiny Aggregation (TAG) Synopsis Diffusion (SD) Tributaries and Deltas (TD) OPAG Exact.](https://reader030.fdocuments.in/reader030/viewer/2022032806/56649f055503460f94c19742/html5/thumbnails/78.jpg)
Question #3 – Answer 2 When calculating the EXACT top-k aggregate for a tree, temporal monitoring (TM) nodes are
required to update the root every time their sensor value changes, while filtering (F) nodes are only required to send an update when they violate a filter value (essentially the same idea as a threshold). Identify the F and TM nodes in the tree on the left after top-2 is executed. Identify which nodes are required to send an update to the sink in the tree on the right.
7 4
8 3 1 9
5
7 4
8 3 1 9
5TM-Node
F-Node
37 910
79 46
Updates