The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks

DOI10.1007/978-3-319-21741-3_3zbMath1428.68085OpenAlexW2281985112MaRDI QIDQ5207896

Sébastien Tixeuil, Quentin Bramas

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

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

Related Items (4)

Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ The complexity of data aggregation in static and dynamic wireless sensor networks ⋮ Stand up indulgent gathering

Cites Work

• Unit disk graphs
• Aggregation in dynamic networks
• Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
• Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
• Planar Formulae and Their Uses
• Continuous Aggregation in Dynamic Ad-Hoc Networks

This page was built for publication: The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks