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

DOI10.1016/J.IC.2016.12.004zbMATH Open1371.68019OpenAlexW2523642225MaRDI QIDQ2013589FDOQ2013589

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

Recommendations

• The complexity of data aggregation in static and dynamic wireless sensor networks
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• Data aggregation in sensor networks: Balancing communication and delay costs
• Latency-constrained aggregation in sensor networks
• Latency Constrained Aggregation in Sensor Networks

zbMATH Keywords

complexitydata aggregationdynamic graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Unit disk graphs
• Planar Formulae and Their Uses
• A better heuristic for orthogonal graph drawings
• Information spreading in dynamic graphs
• Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
• Aggregation in dynamic networks
• Continuous Aggregation in Dynamic Ad-Hoc Networks
• Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
• The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks

Cited In (4)

• Convergecast Tree on Temporal Graphs
• Computing parameters of sequence-based dynamic graphs
• A Stochastic Time-Domain Model for Burst Data Aggregation in IEEE 802.15.4 Wireless Sensor Networks
• Efficient Dynamic Aggregation

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