A Survey of Distributed Data Aggregation Algorithms

IEEE Communications Surveys and Tutorials

Volumn 17, Issue 1, 2015, Pages 381-404

  Jesus, Paulo ^a   Baquero, Carlos ^a   Almeida, Paulo Sérgio ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

data aggregation; Distributed algorithms; fault tolerance; performance trade offs

Indexed keywords

COMMERCE; COMPLEX NETWORKS; DIGITAL STORAGE; ECONOMIC AND SOCIAL EFFECTS; FAULT TOLERANCE; PARALLEL ALGORITHMS; SURVEYS;

AGGREGATION ALGORITHMS; AGGREGATION FUNCTIONS; AGGREGATION TECHNIQUES; APPLICATION EXAMPLES; DATA AGGREGATION; DISTRIBUTED COMPUTATIONS; GLOBAL PROPERTIES; PERFORMANCE TRADE-OFF;

ALGORITHMS;

EID: 84925845557     PISSN: None     EISSN: 1553877X     Source Type: Journal    
DOI: 10.1109/COMST.2014.2354398     Document Type: Review

References (108)

1. nd Annu. Symp. PODC, 2003, pp. 133-142.
2. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications,"in Proc. Conf. SIGCOMM Appl., Technol., Architectures, Protocols Comput. Commun., 2001, pp. 149-160.
3. A. Ganesh, A. Kermarrec, and L. Massoulie, "Peer-to-peer membership management for gossip-based protocols," IEEE Trans. Comput., vol. 52, no. 2, pp. 139-149, Feb. 2003.
4. I. Abraham and D. Malkhi, "Probabilistic quorums for dynamic systems,"Distrib. Comput., vol. 18, no. 2, pp. 113-124, Nov. 2005.
5. Z. Bar-Yossef, R. Friedman, and G. Kliot, "RaWMS - Random walk based lightweight membership service for wireless ad hoc networks,"ACM Trans. Comput. Syst., vol. 26, no. 2, p. 5, Jun. 2008.
6. C.-W. Tsai, C.-F. Lai, M.-C. Chiang, and L. Yang, "Data mining for internet of things: A survey," IEEE Commun. Surveys Tuts., vol. 16, no. 1, pp. 77-97, 2014.
7. A. Bianzino, C. Chaudet, D. Rossi, and J. Rougier, "A survey of green networking research," IEEE Commun. Surveys Tuts., vol. 14, no. 1, pp. 3-20, 2012.
8. R. van Renesse, "The importance of aggregation," in Future Directions in Distributed Computing, A. Schiper, A. A. Shvartsman, H. Weatherspoon, and B. Y. Zhao, Eds. Berlin, Germany: Springer-Verlag, 2003, pp. 87-92.
9. E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, "In-network aggregation techniques for wireless sensor networks: A survey," IEEE Wireless Commun., vol. 14, no. 2, pp. 70-87, Apr. 2007.
10. R. Rajagopalan and P. Varshney, "Data-aggregation techniques in sensor networks: A survey," IEEE Commun. Surveys Tuts., vol. 8, no. 4, pp. 48-63, 2005.
11. th Int. Conf. PDCAT, 2006, pp. 315-320.
12. th AISC, 2008, pp. 93-105.
13. E. Nakamura, A. Loureiro, and A. Frery, "Information fusion for wireless sensor networks: Methods, models, classifications," ACM Comput. Surveys, vol. 39, no. 3, pp. 9:1-9:55, 2007.
14. A. Syropoulos, "Mathematics of multisets," in Proc. Workshop Multiset Process. - Multiset Process., Math., Comput. Sci., Mol. Comput. Points View, 2001, pp. 347-358.
15. B. Pittel, "On spreading a rumor," SIAM J. Appl. Math., vol. 47, no. 1, pp. 213-223, Feb. 1987.
16. S. Madden, M. Franklin, J. Hellerstein, andW. Hong, "TAG: A tiny AGgregation service for ad-hoc sensor networks," ACM SIGOPS Operat. Syst. Rev., vol. 36, no. SI, pp. 131-146, 2002.
17. S. Motegi, K. Yoshihara, and H. Horiuchi, "DAG based in-network aggregation for sensor network monitoring," in Proc. Int. SAINT, 2005, pp. 1-8.
18. th Annu. ACM Symp. PODC, 2006, pp. 102-111.
19. th ICDE, 2004, pp. 449-460.
20. Y.-C. Fan and A. Chen, "Efficient and robust sensor data aggregation using linear counting sketches," in Proc. IEEE IPDPS, 2008, pp. 1-12.
21. Y.-C. Fan and A. L. Chen, "Efficient and robust schemes for sensor data aggregation based on linear counting," IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 11, pp. 1675-1691, Nov. 2010.
22. A. Manjhi, S. Nath, and P. Gibbons, "Tributaries and deltas: Efficient and robust aggregation in sensor network streams," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2005, pp. 287-298.
23. nd Int. Conf. Embedded Netw. SenSys, 2004, pp. 239-249.
24. K. Horowitz and D. Malkhi, "Estimating network size from local information," Inf. Process. Lett., vol. 88, no. 5, pp. 237-243, Dec. 2003.
25. M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, "Estimating aggregates on a peer-to-peer network," Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA, Tech. Rep., 2003.
26. th Annu. ACM Symp. PODC, 2006, pp. 123-132.
27. st IEEE Symp. Reliable Distrib. Syst., 2002, pp. 70-79.
28. S. Dolev, E. Schiller, and J. Welch, "Random walk for self-stabilizing group communication in ad hoc networks," IEEE Trans. Mobile Comput., vol. 5, no. 7, pp. 893-905, Jul. 2006.
29. A. Ganesh, A. Kermarrec, E. Le Merrer, and L. Massoulié, "Peer counting and sampling in overlay networks based on random walks," Distrib. Comput., vol. 20, no. 4, pp. 267-278, Nov. 2007.
30. S. Mane, S. Mopuru, K. Mehra, and J. Srivastava, "Network size estimation in a peer-to-peer network," Dept. Comput. Sci., Univ. Minnesota, Minneapolis, MN, USA, Tech. Rep. TR 05-030, 2005.
31. th Annu. IEEE Symp. Found. Comput. Sci., 2003, pp. 482-491.
32. M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Trans. Comput. Syst., vol. 23, no. 3, pp. 219-252, Aug. 2005.
33. J.-Y. Chen, G. Pandurangan, and D. Xu, "Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis," IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 9, pp. 987-1000, Sep. 2006.
34. th IFIP Int. Conf. DAIS, vol. 5523, ser. Springer LNCS, 2009, pp. 73-86.
35. th IEEE Symp. Reliable Distrib. Syst., 2010, pp. 37-43.
36. th ICAS, 2009, pp. 88-93.
37. M. Haridasan and R. van Renesse, "Gossip-based distribution estimation in peer-to-peer networks," in Proc. IPTPS Workshop, 2008, p. 13.
38. th ICDCS, 2010, pp. 697-707.
39. th IEEE Int. Symp. Netw. Comput. Appl., 2005, pp. 41-48.
40. D. Kostoulas, D. Psaltoulis, I. Gupta, K. P. Birman, and A. J. Demers, "Active and passive techniques for group size estimation in large-scale and dynamic distributed systems," J. Syst. Softw., vol. 80, no. 10, pp. 1639-1658, Oct. 2007.
41. L. Chitnis, A. Dobra, and S. Ranka, "Aggregation methods for large-scale sensor networks," ACM Trans. Sensor Netw., vol. 4, no. 2, pp. 1-36, Mar. 2008.
42. th IEEE Workshop Mobile Comput. Syst. Appl., 2002, pp. 49-58.
43. P. Flajolet and G. Martin, "Probabilistic counting algorithms for data base applications," J. Comput. Syst. Sci., vol. 31, no. 2, pp. 182-209, Oct. 1985.
44. th Int. Symp. DISC, 2006, pp. 90-104.
45. nd Int. Conf. Embedded Netw. SenSys, 2004, p. 7.
46. J. Li, K. Sollins, and D. Lim, "Implementing aggregation and broadcast over distributed hash tables," ACM SIGCOMM Comput. Commun. Rev., vol. 35, no. 1, pp. 81-92, Jan. 2005.
47. st IEEE Int. Workshop Sensor Netw. Protocols Appl., 2003, pp. 139-148.
48. M. Dam and R. Stadler, "A generic protocol for network state aggregation,"in Proc. RVK, 2005, pp. 1-6.
49. L. Jia, G. Noubir, R. Rajaraman, and R. Sundaram, "GIST: Group-independent spanning tree for data aggregation in dense sensor networks,"in Distributed Computing in Sensor Systems, vol. 4026, P. Gibbons, T. Abdelzaher, J. Aspnes, and R. Rao, Eds. Berlin, Germany: Springer-Verlag, 2006, ser. Lecture Notes in Computer Science, pp. 282-304.
50. A. Sharaf, J. Beaver, A. Labrinidis, and K. Chrysanthis, "Balancing energy efficiency and quality of aggregate data in sensor networks," Int. J. Very Large Data Bases, vol. 13, no. 4, pp. 384-403, Dec. 2004.
51. R. Misra and C. Mandal, "Ant-aggregation: Ant colony algorithm for optimal data aggregation in wireless sensor networks," in Proc. IFIP Int. Conf. Wireless Opt. Commun. Netw., 2006, pp. 1-5.
52. W. Liao, Y. Kao, and C. Fan, "Data aggregation in wireless sensor networks using ant colony algorithm," J. Netw. Comput. Appl., vol. 31, no. 4, pp. 387-401, Nov. 2008.
53. H. Wang and N. Luo, "An improved ant-based algorithm for data aggregation in wireless sensor networks," in Proc. Int. Conf. CMC, 2010, pp. 239-243.
54. H. Luo, J. Luo, Y. Liu, and S. Das, "Adaptive data fusion for energy efficient routing in wireless sensor networks," IEEE Trans. Comput., vol. 55, no. 10, pp. 1286-1299, Oct. 2006.
55. rd Annu. Hawaii Int. Conf. Syst. Sci., 2000, pp. 1-10.
56. H. Luo, Y. Liu, and S. K. Das, "Distributed algorithm for en route aggregation decision in wireless sensor networks," IEEE Trans. Mobile Comput., vol. 8, no. 1, pp. 1-13, Jan. 2009.
57. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks,"IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660-670, Oct. 2002.
58. A. Prieto and R. Stadler, "Adaptive distributed monitoring with accuracy objectives," in Proc. SIGCOMM Workshop INM, 2006, pp. 65-70.
59. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos, "Hierarchical in-network data aggregation with quality guarantees," in Proc. Int. Conf. EDBT, 2004, pp. 658-675.
60. th Annu. Int. COCOON, 2002, pp. 279-289.
61. th Int. Conf. TAMC, 2006, pp. 148-158.
62. A.-M. Kermarrec and M. Steen, "Gossiping in distributed systems,"ACM SIGOPS Operat. Syst. Rev., vol. 41, no. 5, pp. 2-7, Oct. 2007.
63. P. Jesus, C. Baquero, and P. S. Almeida, "Dependability in aggregation by averaging," in Proc. Simpósio de Informática (INForum), Lisboa, Portugal, 2009, pp. 457-470.
64. th Int. Conf. Distrib. Comput. Syst., 2004, pp. 102-109.
65. th IFIP/IEEE Int. Symp. Integr. Netw. Manage., 2007, pp. 226-235.
66. th Euromicro Conf. Parallel, Distrib. Netw.-Based Process., 2004, pp. 200-207.
67. L. Chitnis, A. Dobra, and S. Ranka, "Fault tolerant aggregation in heterogeneous sensor networks," J. Parallel Distrib. Comput., vol. 69, no. 2, pp. 210-219, Feb. 2009.
68. R. van Renesse, K. Birman, and W. Vogels, "Astrolabe: A robust and scalable technology for distributed system monitoring, management, data mining," ACM Trans. Comput. Syst., vol. 21, no. 2, pp. 164-206, May 2003.
69. I. Gupta, R. V. Renesse, and K. P. Birman, "Scalable fault-tolerant aggregation in large process groups," in Proc. Int. Conf. DSN, 2001, pp. 433-442.
70. th INFOCOM, 2010, pp. 1181-1189.
71. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
72. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006.
73. L. Xiao, S. Boyd, and S.-J. Kim, "Distributed average consensus with least-mean-square deviation," J. Parallel Distrib. Comput., vol. 27, no. 1, pp. 22-46, Jan. 2007.
74. S. Patterson, B. Bamieh, and A. El Abbadi, "Convergence rates of distributed average consensus with stochastic link failures," IEEE Trans. Autom. Control, vol. 55, no. 4, pp. 880-892, Apr. 2010.
75. th Annu. ACM Symp. PODC, 1987, pp. 1-12.
76. J.-Y. Chen and J. Hu, "Analysis of distributed random grouping for aggregate computation on wireless sensor networks with randomly changing graphs," IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 8, pp. 1136-1149, Aug. 2008.
77. th Int. Conf. OPODIS, vol. 7109, ser. Springer LNCS, 2011, pp. 513-527.
78. th Int. Telecommun. Netw. Strategy Planning Symp., 2006, pp. 1-6.
79. th Int. Symp. ALGOSENSOR Syst., Wireless Ad Hoc Netw. Auton. Mobile Entities, 2011, pp. 72-85.
80. A. Dimakis, A. Sarwate, and M. Wainwright, "Geographic gossip: Efficient averaging for sensor networks," IEEE Trans. Signal Process., vol. 56, no. 3, pp. 1205-1216, Mar. 2008.
81. th Int. Conf. IPSN, 2006, pp. 69-76.
82. M. Mehyar, D. Spanos, J. Pongsajapan, S. Low, and R. Murray, "Asynchronous distributed averaging on communication networks," IEEE/ACM Trans. Netw., vol. 15, no. 3, pp. 512-520, Jun. 2007.
83. K.-Y. Whang, B. Vander-Zanden, and H. Taylor, "A linear-time probabilistic counting algorithm for database applications," ACM Trans. Database Syst., vol. 15, no. 2, pp. 208-229, Jun. 1990.
84. th Annu. ESA, 2003, pp. 605-617.
85. P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier, "HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm," in Proc. Int. Conf. AofA, 2007, pp. 127-146.
86. E. Cohen, "Size-estimation framework with applications to transitive closure and reachability," J. Comput. Syst. Sci., vol. 55, no. 3, pp. 441-453, Dec. 1997.
87. th Annu. ACM Symp. PODC, 2007, pp. 225-234.
88. Y.-C. Fan and A. L. Chen, "Energy efficient schemes for accuracy-guaranteed sensor data aggregation using scalable counting," IEEE Trans. Knowl. Data Eng., vol. 24, no. 8, pp. 1463-1477, Aug. 2012.
89. C. Baquero, P. Almeida, R. Menezes, and P. Jesus, "Extrema propagation: Fast distributed estimation of sums and network sizes," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 4, pp. 668-675, Apr. 2012.
90. th LADC Symp., 2009, pp. 33-40.
91. th IEEE CDC, Dec. 2010, pp. 149-1503.
92. M. Bawa, A. Gionis, H. Garcia-Molina, and R. Motwani, "The price of validity in dynamic networks," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 515-526.
93. nd ICDE, 2006, pp. 1-10.
94. N. Ntarmos, P. Triantafillou, and G.Weikum, "Distributed hash sketches: Scalable, efficient, accurate cardinality estimation for distributed multisets,"ACM Trans. Comput. Syst., vol. 27, no. 1, p. 2, Feb. 2009.
95. D. Mosk-Aoyama and D. Shah, "Fast distributed algorithms for computing separable functions," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2997-3007, Jul. 2008.
96. th Annu. ACM Symp. PODC, 2006, pp. 113-122.
97. rd ACM SIGMOD-SIGACT-SIGART Symp. PODS, 2004, pp. 275-285.
98. th Workshop HotDep Syst., 2009, pp. 1-6.
99. th ACM SIGACT-SIGOPS Symp. PODC, 2010, pp. 151-160.
100. th IFIP Int. Conf. DAIS, vol. 7272, ser. Springer LNCS, 2012, pp. 96-103.
101. E. Cohen and H. Kaplan, "Spatially-decaying aggregation over a network: Model and algorithms," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 707-718.
102. A. DasGupta, "The matching, birthday and the strong birthday problem: A contemporary review," J. Stat. Planning Inference, vol. 130, no. 1/2, pp. 377-389, 2005.
103. C. J. Schwarz and G. A. F. Seber, "Estimating animal abundance: Review III," Stat. Sci., vol. 14, no. 4, pp. 427-456, Nov. 1999.
104. nd Annu. Joint Conf. IEEE INFOCOM, 2003, pp. 1011-1021.
105. D. Dolev, O. Mokryn, and Y. Shavitt, "On multicast trees: Structure and size estimation," IEEE/ACM Trans. Netw., vol. 14, no. 3, pp. 557-567, Jun. 2006.
106. th Annu. Joint Conf. IEEE INFOCOM, 1999, pp. 965-972.
107. st Annu. Joint Conf. IEEE INFOCOM, 2002, pp. 1109-1118.
108. th ICDE, 2009, pp. 1331-1334.