Tight bounds for delay-sensitive aggregation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 195-202

  Oswald, Yvonne Anne ^a   Schmid, Stefan ^b   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Aggregation; Competitive analysis; Distributed algorithms; Wireless sensor networks

Indexed keywords

AGGLOMERATION; DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; PARALLEL ALGORITHMS; SENSOR NODES; WIRELESS SENSOR NETWORKS;

COMMUNICATION COST; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; EVENT AGGREGATIONS; OBLIVIOUS ALGORITHMS; OPTIMIZATION PROBLEMS; ORGANIZATION THEORY; TRANSMISSION COSTS;

COMPUTATION THEORY;

EID: 57549109278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400778     Document Type: Conference Paper

References (17)

1. S. Albers and H. Bals. Dynamic TCP Acknowledgement: Penalizing Long Delays. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 47-55, 2003.
2. L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skutella, L. Stougie, and A. Vitaletti. Latency Constrained Aggregation in Sensor Networks. In Proc. European Symposium on Algorithms (ESA), pages 88-99, 2006.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. C. Brito, E. Koutsoupias, and S. Vaya. Competitive Analysis of Organization Networks or Multicast Acknowledgement: How Much to Wait? In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 627-635," 2004.
5. D. R. Dooly, S. A. Goldman, and S. D. Scott. On-line Analysis of the TCP Acknowledgment Delay Problem. Journals of the ACM, 48(2):243-273, 2001.
6. J. S. Frederiksen and K. S. Larsen. Packet Bundling. In Proc. 8th Scandinavian Workshop on Algorithm Theory (SWAT), pages 328-337, 2002.
7. A. R. Karlin, C. Kenyon, and D. Randall. Dynamic TCP Acknowledgement and Other Stories About e/(e-1). In Proc. 33rd ACM Symposium on Theory of Computing (STOC), pages 502-509, 2001.
8. S. Khanna, S. Naor, and D. Raz. Control message aggregation in group communication protocols. In Proc. of the International Colloquium of Automata, Languagues and Programming (ICALP), 2002.
9. P. Korteweg, A. Marchetti-Spaccamela, L. Stougie, and A. Vitaletti. Data Aggregatcion in Sensor Networks: Balancing Communication and Delay Costs. In Proc. Colloquium on Structure, Information, Communication, and Complexity (SIROCCO), 2007.
10. B. Krishnamachari, D. Estrin, and S. Wicker. The Impact of Data Aggregation in Wireless Sensor Networks. In Proc. Int. Conference on Distributed Computing Systems Workshops (ICDCSW), 2002.
11. C. H. Papadimitriou. Computational Aspects of Organization Theory. In Proc. European Symposium on Algorithms (ESA), 1996.
12. C. H. Papadimitriou and E. Servan-Schreiber. The Origins of the Deadline: Optimizing Communication in Organizations. In Manuscript, 1999.
13. I. Solis and K. Obraczka. The Impact of Timing in Data Aggregation for Sensor Networks. In Proc. IEEE Int. Conference on Communications (ICC), 2004.
14. W. R. Stevens. TCP/IP Illustrated, Vol. 1: The Protocols. Addison-Wesley, 1994.
15. P. von Rickenbach and R. Wattenhofer. Gathering Correlated Data in Sensor Networks. In Proc. ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2004.
16. O. Younis and S. Fahmy. An Experimental Study of Routing and Data Aggregation in Sensor Networks. In Proc. IEEE Int. Conference on Mobile Ad Hoc and Sensor Systems (MASS), 2005.
17. Y. Yu, B. Krishnamachari, and V. K. Prasanna. Energy-Latency Tradeoffs for Data Gathering in Wireless Sensor Networks. In Proc. Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 2004.