Synopsis diffusion for robust aggregation in sensor networks

ACM Transactions on Sensor Networks

Volumn 4, Issue 2, 2008, Pages

  Nath, Suman ^a   Gibbons, Phillip B ^b   Seshan, Srinivasan ^c,e   Anderson, Zachary ^d,f  

^a MICROSOFT RESEARCH   (United States)

^b INTEL CORPORATION   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e Carnegie Mellon University   (United States)

^f UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Query processing; Sensor networks; Synopsis diffusion

Indexed keywords

COMMUNICATION FAILURES; DOUBLE-COUNTING SENSOR READINGS; SYNOPSIS DIFFUSION;

ENERGY CONSERVATION; MULTIPATH PROPAGATION; NETWORK ROUTING; QUERY PROCESSING; SENSITIVITY ANALYSIS;

WIRELESS SENSOR NETWORKS;

EID: 42149159041     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1340771.1340773     Document Type: Article

References (47)

1. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137-147.
2. ATMEL AVR MICROCONTROLLER DATASHEET. 2004. Go online to http://www.atmel.com/dyn/resources/prod_documents/2467s.pdf.
3. BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). ACM Press, New York, NY, 1-16.
4. BAR-YOSSEF, Z., KUMAR, R., AND SIVAKUMAR, D. 2001. Sampling algorithms: Lower bounds and applications. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 266-275.
5. BAWA, M., GIONIS, A., GARCIA-MOLINA, H., AND MOTWANI, R. 2004. The price of validity in dynamic networks. In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY, 515-526.
6. BONNET, P., GEHRKE, J. E., AND SESHADRI, P. 2001. Towards sensor database systems. In IEEE Mobile Data Management. Springer, Berlin, Germany.
7. BOYD, S., GHOSH, A., PRABHAKAR, B., AND SHAH, D. 2005. Gossip algorithms: Design, analysis, and applications. In Proceedings of IEEE INFOCOM. IEEE Computer Society Press, Los Alamitos, CA.
8. CHEN, J.-Y. AND PANDURANGAN, D. X. G. 2005. Robust aggregates computation in wireless sensor networks: Distributed randomized algorithms and analysis. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN).
9. CONSIDINE, J., LI, F., KOLLIOS, G., AND BYERS, J. 2004. Approximate aggregation techniques for sensor databases. In Proceedings of the 20th International Conference on Data Engineering (ICDE). IEEE Computer Society Press, Los Alamitos, CA, 449.
10. CORMODE, G., GAROFALAKIS, M., MUTHUKRISHNAN, S., AND RASTOGI, R. 2005. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY
11. CORMODE, G. AND MUTHUKRISHNAN, S. 2005. An improved data stream summary: The Count-Min sketch and its applications. J. Algorithms 55, 1 (Apr.), 58-75.
12. DAVEY, B. A. AND PRIESTLEY, H. A. 2002. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K.
13. DESHPANDE, A., GUESTRIN, C., MADDEN, S., HELLERSTEIN, J. M., AND HONG, W. 2004. Model-driven data acquisition in sensor networks. In Proceedings of the International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann, San Francisco, CA.
14. DIMAKIS, A. G., SARWATE, A. D., AND WAINWRIGHT, M. 2006. Geographic gossip: Efficient aggregation for sensor networks. In Proceedings of the 5th International Symposium on Information Processing in Sensor Networks (IPSN, Nashville, TN).
15. FLAJOLET, P. AND MARTIN, G. N. 1985. Probabilistic counting algorithms for database applications. J. Comput. Syst. Sci. 31, 182-209.
16. GANESAN, D., GOVINDAN, R., SHENKER, S., AND ESTRIN, D. 2001. Highly-resilient, energy-efficient multipath routing in wireless sensor networks. Mobile Comput. Commun. Rev. 5, 4, 11-25.
17. GIBBONS, P. B. 2007. Distinct-values estimation over data streams. In Data Stream Management: Processing High-Speed Data Streams, M. Garofalakis, J. Gehrke, and R. Rastogi, Eds. Springer, New York, NY.
18. GIBBONS, P. B. AND MATIAS, Y. 1999. Synopsis data structures for massive data sets. In External Memory Algorithms. American Mathematical Society, Boston, MA, 39-70.
19. GIBBONS, P. B. AND TIRTHAPURA, S. 2001. Estimating simple functions on the union of data streams. In Proceedings of the Thirteenth Annual ACM Symposium, on Parallel Algorithms and Architectures (SPAA). ACM Press, New York, NY, 281-291.
20. GIBBONS, P. B. AND TIRTHAPURA, S. 2002. Distributed streams algorithms for sliding windows. In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). ACM Press, New York, NY, 63-72.
21. GUPTA, I., VAN RENESSE, R., AND BIRMAN, K. P. 2001. Scalable fault-tolerant aggregation in large process groups. In Proceedings of the 2001 International Conference on Dependable Systems and Networks (DSN). IEEE Computer Society Press, Los Alamitos, CA, 433-442.
22. INTANAGONWIWAT, C., GOVINDAN, R., AND ESTRIN, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom). ACM Press, New York, NY, 56-67.
23. JENKINS, K., HOPKINSON, K., AND BIRMAN, K. 2001. A gossip protocol for subgroup multicast. In Proceedings of the 21st International Conference on Distributed Computing Systems. IEEE Computer Society Press, Los Alamitos, CA.
24. JOHNSON, D. B. AND MALTZ, D. A. 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, T. Imielinski and H. F. Korth, Eds. Vol. 353. Kluwer Academic Publishers, Norwell, MA.
25. KARP, R., SCHINDELHAUER, C., SHENKER, S., AND VOCKING, B. 2000. Randomized rumor spreading. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 565.
26. KEMPE, D., DOBRA, A., AND GEHRKE, J. 2003. Gossip-based computation of aggregate information. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA.
27. KOSTIC, D., RODRIGUEZ, A., ALBRECHT, J. R., BHIRUD, A., AND VAHDAT, A. 2003. Using random subsets to build scalable network services. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS). USENIX, Berkeley, CA.
28. LEVIS, P., LEE, N., WELSH, M., AND CULLER, D. 2003. Tossim: Accurate and scalable simulation of entire Tinyos applications. In SenSys '03: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY, 126-137.
29. MADDEN, S., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2002a. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI). ACM Press, New York, NY, 131-146.
30. MADDEN, S., FRANKLIN, M. J., HELLERSTEIN, J. M., AND HONG, W. 2003. The design of an acquisitional query processor for sensor networks. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY, 491-502.
31. MADDEN, S., SZEWCZYK, R., FRANKLIN, M. J., AND CULLER, D. 2002b. Supporting aggregate queries over ad-hoc wireless sensor networks. In Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications (WMCSA). IEEE Computer Society Press, Los Alamitos, CA, 49.
32. MANJHI, A., NATH, S., AND GIBBONS, P. B. 2005. Tributaries and deltas: Efficient and robust aggregation in sensor network streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY
33. MUKHOPADHYAY, S., PANIGRAHI, D., AND DEY, S. 2004. Model based errer correction for wireless sensor networks. In Proceedings of the First IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON). IEEE Computer Society Press, Los Alamitos, CA.
34. MUTHUKRISHNAN, S. 2003. Data streams: Algorithms and applications. Tech. rep. Rutgers University, Piscataway, NJ.
35. NATH, S. 2005. Exploiting redundancy for robust sensing. Ph.D. dissertation. Carnegie Mellon University, Pittsburgh, PA. (Also Tech. rep. CMU-CS-05-166 at Carnegie Mellon University.)
36. PALMER, C. R., GIBBONS, P. B., AND FALOUTSOS, C. 2002. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the ACM KDD. ACM Press, New York, NY, USA.
37. POLASTRE, J., HUI, J., LEVIS, P., ZHAO, J., CULLER, D., SHENKER, S., AND STOICA, I. 2005. A unifying link abstraction for wireless sensor networks. In SenSys '05: Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY, 76-89.
38. PRZYDATEK, B., SONG, D., AND PERRIG, A. 2003. SIA: Secure information aggregation in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY.
39. STANN, F. AND HEIDEMANN, J. 2003. RMST: Reliable data transport in sensor networks. In Proceedings of 1st IEEE International Workshop on Sensor Net Protocols and Applications (SNPA). IEEE Computer Society Press, Los Alamitos, CA.
40. TAO, Y., KOLLIOS, G., CONSIDINE, J., LI, F., AND PAPADIAS, D. 2004. Spatio-temporal aggregation using sketches. In Proceedings of the 20th International Conference on Data Engineering (ICDE). IEEE Computer Society Press, Los Alamitos, CA, 214.
41. VOGELS, W., VAN RENESSE, R., AND BIRMAN, K. 2003. The power of epidemics: Robust communication for large-scale distributed systems. SIGCOMM Comput. Commun. Rev. 33, 1, 131-135.
42. WAN, C.-Y., CAMPBELL, A. T., AND KRISHNAMURTHY, L. 2004. Reliable transport for sensor networks. In Wireless Sensor Networks. Springer, New York, NY, 153-182.
43. WATSON, E. J. 1962. Mathematics of Computation. Vol. 16. American Mathematical Society, Providence, RI, 368-369.
44. YAO, Y. AND GEHRKE, J. 2003. Query processing in sensor networks. In Proceedings of the First Conference on Innovative Data Systems Research (CIDR). Morgan Kaufmann, San Francisco, CA.
45. ZHANG, R., KOUDAS, N., OOI, B. C., AND SRIVASTAVA, D. 2005. Multiple aggregations over data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY.
46. ZHAO, J. AND GOVINDAN, R. 2003. Understanding packet delivery performance in dense wireless sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY.
47. ZHAO, J., GOVINDAN, R., AND ESTRIN, D. 2003. Computing aggregates for monitoring wireless sensor networks. In Proceedings of 1st IEEE International Workshop on Sensor Network Protocols and Applications. IEEE Computer Society Press, Los Alamitos, CA.