Latency Constrained Aggregation in Sensor Networks

DOI10.1007/11841036_11MaRDI QIDQ5449519zbMATH OpenOpenAlexFDO

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

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

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) 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

(21)

• Data aggregation in sensor networks: Balancing communication and delay costs
• Layer-based data aggregation and performance analysis in wireless sensor networks
• The complexity of data aggregation in static and dynamic wireless sensor networks
• A weakly robust PTAS for minimum clique partition in unit disk graphs
• Continuous data aggregation and capacity in probabilistic wireless sensor networks
• Contour maps: monitoring and diagnosis in sensor networks
• Scale-free aggregation in sensor networks
• Latency-constrained aggregation in sensor networks
• Clique partitioning of interval graphs with submodular costs on the cliques
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
• The submodular joint replenishment problem
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• 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
• Message batching in wireless sensor networks -- a perturbation analysis approach
• Clique clustering yields a PTAS for max-coloring interval graphs
• Data relaying with constraints in hierarchical sensor networks
• QoS and data relaying for wireless sensor networks
• Capacitated max-batching with interval graph compatibilities

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 Q5449519)