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

DOI10.1016/j.ic.2016.12.004zbMath1371.68019OpenAlexW2523642225MaRDI QIDQ2013589

Quentin Bramas, Sébastien Tixeuil

Publication date: 8 August 2017

Published in: Information and Computation (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) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Computing parameters of sequence-based dynamic graphs ⋮ Convergecast Tree on Temporal Graphs

Cites Work

• Unit disk graphs
• A better heuristic for orthogonal graph drawings
• 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
• The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks
• Continuous Aggregation in Dynamic Ad-Hoc Networks
• Information spreading in dynamic graphs

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