Time-decaying sketches for sensor data aggregation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 215-224

  Cormode, Graham ^a   Tirthapura, Srikanta ^b   Xu, Bojian ^b  

^a AT AND T LABS RESEARCH   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

Asynchronous streams; Data aggregation; Data stream processing; Distributed streams; Duplicate insensitive sketch; Sensor network; Sliding windows; Time decay

Indexed keywords

ASYNCHRONOUS STREAMS; DUPLICATE INSENSITIVE SKETCH; SLIDING WINDOWS; TIME DECAY;

COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; SENSOR NETWORKS; USER INTERFACES;

DATA ACQUISITION;

EID: 36849095546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281132     Document Type: Conference Paper

References (28)

1. C. C. Aggarwal. On biased reservoir sampling in the presence of stream evolution. In VLDB, 2006.
2. I. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci. A survey on sensor networks. IEEE Commun. Mag. 40 (8) (2002) 102-114
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. A. Arasu and G. Manku. Approximate counts and quantiles over sliding windows. In PODS, 2004.
5. B. Babcock, M. Datar, and R. Motwani. Sampling from a moving window over streaming data. In SODA, 2002.
6. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In PODS, 2003.
7. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In STOC, 1998.
8. C. Busch and S. Tirthapura. A deterministic algorithm for summarizing asynchronous streams over a sliding window. In STACS, 2007.
9. J.L. Carter and M.L. Wegman. Universal classes of hash functions. J. of Comp, and System Sciences, 18(2):143-154, 1979.
10. Y. Chen, H. V. Leong, M. Xu, Jiannong Cao, K.C.C Chan and A. T.S Chan. In-network data processing for wireless sensor networks. In MDM (International Conference on Mobile Data Management) 2006
11. E. Cohen and M. Strauss. Maintaining time-decaying stream aggregates. In PODS, 2003.
12. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE, 2004.
13. G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In PODS, 2005.
14. G. Cormode, S. Tirthapura, B. Xu. Time-Decaying Sketches for Sensor Data Aggregation. Technical Report TR-2007-06-0, Department of Electrical and Computer Engineering, Iowa State University.
15. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM J. on Computing, 31(6):1794-1813, 2002.
16. P. Flajolet and G. N. Martin. Probabilistic counting. In FOCS, 1983.
17. P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In SPAA, 2001.
18. P. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In SPAA, 2002.
19. P. Indyk, D. Woodruff. Tight lower bounds for the distinct elements problem. In FOCS, 2003.
20. N. Kimura and S. Latifi. A survey on data compression in wireless sensor networks. In ITCC International Conference on Information Technology Coding and Computing, 2005
21. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
22. L.K. Lee and H.F. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In PODS, 2006.
23. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tag: a tiny aggregation service for ad-hoc sensor networks. SIGOPS Operating Systems Review, 36(SI):131-146, 2002.
24. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12(3):315-323, 1980.
25. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science. Now Publishers, August 2005.
26. S. Nath, P. B. Gibbons, S. Seshan, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In SENSYS, 2004.
27. A. Pavan and S. Tirthapura. Range-efficient computation of Fo over massive data streams. In SIAM Journal on Computing, 37(2):359-379, 2007.
28. S. Tirthapura, B. Xu, and C. Busch. Sketching asynchronous streams over a sliding window. In PODC, 2006.