Latency-constrained aggregation in sensor networks

DOI10.1145/1644015.1644028MaRDI QIDQ2930288zbMATH OpenOpenAlexFDO

Authors Luca Becchetti, Andrea Vitaletti, Peter Korteweg, Alberto Marchetti-Spaccamela, L. Stougie, Martin Skutella

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/7e7324cb-e274-4808-91d3-641b8fe2fb1c

zbMATH Keywords

competitive analysisdata aggregationdistributed algorithmswireless sensor networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Approximation algorithms (68W25)

Recommendations

• Latency Constrained Aggregation in Sensor Networks
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• Data aggregation in sensor networks: Balancing communication and delay costs
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• The complexity of data aggregation in static and dynamic wireless sensor networks

Cited in

(28)

• Data aggregation in sensor networks: Balancing communication and delay costs
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• Aggregation in intersection region for distributed heterogeneous mobile sensor networks
• A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff
• New results on multi-level aggregation
• The complexity of data aggregation in static and dynamic wireless sensor networks
• A PTAS for the horizontal rectangle stabbing problem
• Dynamic timeout for data aggregation in wireless sensor networks
• Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
• Scale-free aggregation in sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks
• Tight analysis of shortest path convergecast in wireless sensor networks
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• Energy-optimal batching periods for asynchronous multistage data processing on sensor nodes: foundations and an mPlatform case study
• Online Algorithms for Multilevel Aggregation
• The complexity of data aggregation in static and dynamic wireless sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• Latency Constrained Aggregation in Sensor Networks
• An algorithm of data aggregation based on data compression for sensor networks
• Message batching in wireless sensor networks -- a perturbation analysis approach
• Joint replenishment meets scheduling
• A PTAS for the horizontal rectangle stabbing problem
• Online multi-level aggregation with delays and stochastic arrivals
• Data relaying with constraints in hierarchical sensor networks

This page was built for publication: Latency-constrained aggregation in sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930288)