The complexity of data aggregation in static and dynamic wireless sensor networks
From MaRDI portal
Publication:2013589
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
Cites work
- A better heuristic for orthogonal graph drawings
- 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
- The complexity of data aggregation in static and dynamic wireless sensor networks
- Unit disk graphs
Cited in
(10)- Continuous aggregation in dynamic ad-hoc networks
- Convergecast tree on temporal graphs
- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
- The complexity of data aggregation in directed networks
- Aggregation in dynamic networks
- A Stochastic Time-Domain Model for Burst Data Aggregation in IEEE 802.15.4 Wireless Sensor Networks
- Efficient Dynamic Aggregation
- Computing parameters of sequence-based dynamic graphs
- 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
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)