Efficient Dynamic Aggregation

  • Yitzhak Birk
  • Idit Keidar
  • Liran Liss
  • Assaf Schuster
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4167)


We consider the problem of dynamic aggregation of inputs over a large fixed graph. A dynamic aggregation algorithm must continuously compute the result of a given aggregation function over a dynamically changing set of inputs. To be efficient, such an algorithm should refrain from sending messages when the inputs do not change, and should perform local communication whenever possible.

We present an instance-based lower bound on the efficiency of such algorithms, and provide two algorithms matching this bound. The first, MultI-LEAG, re-samples the inputs at intervals that are proportional to the graph size, achieving quiescence between samplings, and is extremely message efficient. The second, DynI-LEAG, more closely monitors the aggregate value by sampling it more frequently, at the cost of slightly higher message complexity.


Wireless Sensor Network Aggregation Function Output Stabilization Aggregate Result Aggregation Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Birk, Y., Keidar, I., Liss, L., Schuster, A., Wolff, R.: Veracity radius - capturing the locality of distributed computations. In: PODC (to appear, 2006)Google Scholar
  2. 2.
    Madden, S., Franklin, M., Hellerstein, J., Hong, W.: Tag: a tiny aggregation service for ad-hoc sensor networks. In: Proc. of the 5th Annual Symposium on Operating Systems Design and Implementation (OSDI) (2002)Google Scholar
  3. 3.
    Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D.: Wireless sensor networks for habitat monitoring. In: Proc. of the ACM Workshop on Sensor Networks and Applications (2002)Google Scholar
  4. 4.
    van Renesse, R., Birman, K., Vogels, W.: Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems (2003)Google Scholar
  5. 5.
    The Condor Project,
  6. 6.
    Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of the Sixth Annual Intl. Conf. on Mobile Computing and Networking (2000)Google Scholar
  7. 7.
    Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proceedings of Fundamentals of Computer Science (2003)Google Scholar
  8. 8.
    Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report, Stanford University, Database group (2003), Available from:
  9. 9.
    Considine, J., Li, F., Kollios, G., Byers, J.: Approximate aggregation techniques for sensor databases. In: Proc. of ICDE (2004)Google Scholar
  10. 10.
    Zhao, J., Govindan, R., Estrin, D.: Computing aggregates for monitoring wireless sensor networks. In: Proc. of SNPA (2003)Google Scholar
  11. 11.
    Bawa, M., Gionis, A., Garcia-Molina, H., Motwani, R.: The price of validity in dynamic networks. In: Proc. of ACM SIGMOD (2004)Google Scholar
  12. 12.
    Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995)Google Scholar
  13. 13.
    Kutten, S., Peleg, D.: Tight fault-locality. In: Proc. of the 36th IEEE Symposium on Foundations of Computer Science (1995)Google Scholar
  14. 14.
    Kutten, S., Patt-Shamir, B.: Time-adaptive self-stabilization. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 149–158 (1997)Google Scholar
  15. 15.
    Azar, Y., Kutten, S., Patt-Shamir, B.: Distributed error confinement. In: Proc. of the 22nd Annual Symp. on Principles of Distributed Computing (2003)Google Scholar
  16. 16.
    Li, J., Jannotti, J., Couto, D.D., Karger, D., Morris, R.: A scalable location service for geographic ad hoc routing. In: Proc. of the 6th ACM Intl. Conf. on Mobile Computing and Networking (2000)Google Scholar
  17. 17.
    Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 359–368 (2004)Google Scholar
  18. 18.
    Liss, L., Birk, Y., Wolff, R., Schuster, A.: A local algorithm for ad hoc majority voting via charge fusion. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In: Proc. of the IEEE Conference on Data Mining (ICDM) (2003)Google Scholar
  20. 20.
    Birk, Y., Keidar, I., Liss, L., Schuster, A.: Efficient dynamic aggregation. CCIT Technical Report 589, EE Department, Technion (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yitzhak Birk
    • 1
  • Idit Keidar
    • 1
  • Liran Liss
    • 1
  • Assaf Schuster
    • 1
  1. 1.Technion – Israel Institute of TechnologyHaifaIsrael

Personalised recommendations