The complexity of data aggregation in static and dynamic wireless sensor networks

DOI10.1007/978-3-319-21741-3_3MaRDI QIDQ5207896zbMATH OpenOpenAlexFDO

Authors Quentin Bramas, Sébastien Tixeuil

Publication date 14 January 2020

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

Full work available at URL https://hal.sorbonne-universite.fr/hal-01419900/file/Bramas_The_complexity_of.pdf

zbMATH Keywords

complexitydata aggregationdynamic graphs

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of data aggregation in static and dynamic wireless sensor networks
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Latency-constrained aggregation in sensor networks
• Latency Constrained Aggregation in Sensor Networks

Cites work

• Aggregation in dynamic networks
• Characterizing topological assumptions of distributed algorithms in dynamic networks
• Continuous aggregation in dynamic ad-hoc networks
• Planar Formulae and Their Uses
• Shortest, fastest, and foremost broadcast in dynamic networks
• Unit disk graphs

Cited in

(13)

• Data aggregation in sensor networks: Balancing communication and delay costs
• The complexity of data aggregation in static and dynamic wireless sensor networks
• Dynamic timeout for data aggregation in wireless sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks
• Latency-constrained aggregation in sensor networks
• A Stochastic Time-Domain Model for Burst Data Aggregation in IEEE 802.15.4 Wireless Sensor Networks
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• Latency Constrained Aggregation in Sensor Networks
• Stand up indulgent gathering
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks

This page was built for publication: The complexity of data aggregation in static and dynamic wireless sensor networks

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