Hierarchical In-Network Data Aggregation with Quality Guarantees

  • Antonios Deligiannakis
  • Yannis Kotidis
  • Nick Roussopoulos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)

Abstract

Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor networks. The key idea is to build an aggregation tree, in which parent nodes aggregate the values received from their children. Nevertheless, for large sensor networks with severe energy constraints the reduction obtained through the aggregation tree might not be sufficient. In this paper we extend prior work on in-network data aggregation to support approximate evaluation of queries to further reduce the number of exchanged messages among the nodes and extend the longevity of the network. A key ingredient to our framework is the notion of the residual mode of operation that is used to eliminate messages from sibling nodes when their cumulative change is small. We introduce a new algorithm, based on potential gains, which adaptively redistributes the error thresholds to those nodes that benefit the most and tries to minimize the total number of transmitted messages in the network. Our experiments demonstrate that our techniques significantly outperform previous approaches and reduce the network traffic by exploiting the super-imposed tree hierarchy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barbará, D., Garcia-Molina, H.: The Demarcation Protocol: A Technique for Maintaining Linear Arithmetic Constraints in Distributed Database Systems. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, Springer, Heidelberg (1992)Google Scholar
  2. 2.
    Cerpa, A., Estrin, D.: ASCENT: Adaptive Self-Configuring sEnsor Network Topologies. In: INFOCOM (2002)Google Scholar
  3. 3.
    Chen, J., Dewitt, D.J., Tian, F., Wang, Y.: NiagaraCQ:A Scalable Continuous Query System for Internet Databases. In: ACM SIGMOD (2000)Google Scholar
  4. 4.
    Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Evaluating Probabilistic Queries over Imprecise Data. In: ACM SIGMOD Conference, pp. 551–562 (2003)Google Scholar
  5. 5.
    Considine, J., Li, F., Kollios, G., Byers, J.: Approximate Aggregation Techniques for Sensor Databases. In: ICDE (2004)Google Scholar
  6. 6.
    Estrin, D., Govindan, R., Heidermann, J., Kumar, S.: Next Century Challenges: Scalable Coordination in Sensor Networks. In: MobiCOM (1999)Google Scholar
  7. 7.
    Heidermann, J., Silva, F., Intanagonwiwat, C., Govindanand, R., Estrin, D., Ganesan, D.: Building Efficient Wireless Sensor Networks with Low-Level Naming. In: SOSP (2001)Google Scholar
  8. 8.
    Intanagonwiwat, C., Estrin, D., Govindan, R., Heidermann, J.: Impact of Network Density on Data Aggregation in Wireless Sensor Networks. In: ICDCS (2002)Google Scholar
  9. 9.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tag: A Tiny Aggregation Service for ad hoc Sensor Networks. In: OSDI Conf. (2002)Google Scholar
  10. 10.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: The Design of an Acquisitional Query processor for Sensor Networks. In: ACM SIGMOD Conf. (June 2003)Google Scholar
  11. 11.
    Olston, C., Jiang, J., Widom, J.: Adaptive Filters for Continuous Queries over Distributed Data Streams. In: ACM SIGMOD Conference, pp. 563–574 (2003)Google Scholar
  12. 12.
    Sharaf, M.A., Beaver, J., Labrinidis, A., Chrysanthis, P.K.: TiNA: A Scheme for Temporal Coherency-Aware in-Network Aggregation. In: MobiDE (2003)Google Scholar
  13. 13.
    Soparkar, N., Silberschatz, A.: Data-value Partitioning and Virtual Messages. In: Proceedings of PODS, Nashville, Tennessee, April 1990, pp. 357–367 (1990)Google Scholar
  14. 14.
    Terry, D.B., Goldberg, D., Nichols, D., Oki, B.M.: Continuous Queries over Append-Only Databases. In: ACM SIGMOD (1992)Google Scholar
  15. 15.
    Yao, Y., Gehrke, J.: The Cougar Approach to In-Network Query Processing in Sensor Networks. SIGMOD Record 31(3), 9–18 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Antonios Deligiannakis
    • 1
  • Yannis Kotidis
    • 2
  • Nick Roussopoulos
    • 1
  1. 1.University of MarylandCollege ParkUSA
  2. 2.AT&T Labs-ResearchFlorham ParkUSA

Personalised recommendations