Continuous aggregation in dynamic ad-hoc networks

DOI10.1007/978-3-319-09620-9_16MaRDI QIDQ5496159zbMATH OpenOpenAlexFDO

Authors Sebastian Abshoff, Friedhelm Meyer auf der Heide

Publication date 7 August 2014

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09620-9_16

zbMATH Keywords

aggregationdynamic networkstoken dissemination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Aggregation in dynamic networks
• Efficient Dynamic Aggregation
• Distributed computation in dynamic networks
• Deterministic distributed data aggregation under the SINR model
• The complexity of data aggregation in static and dynamic wireless sensor networks

Cited in

(7)

• Aggregation in intersection region for distributed heterogeneous mobile sensor networks
• Continuous monitoring in the dynamic sensor field model
• The complexity of data aggregation in static and dynamic wireless sensor networks
• Data aggregation in mobile wireless sensor networks represented as stationary edge-Markovian evolving graphs
• Aggregation in dynamic networks
• Efficient Dynamic Aggregation
• The complexity of data aggregation in static and dynamic wireless sensor networks

This page was built for publication: Continuous aggregation in dynamic ad-hoc networks

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