Pages that link to "Item:Q732821"
From MaRDI portal
The following pages link to Improved algorithm for minimum data aggregation time problem in wireless sensor networks (Q732821):
Displaying 15 items.
- Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna (Q391234) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks (Q897385) (← links)
- Collision-free path coloring with application to minimum-delay gathering in sensor networks (Q1026148) (← links)
- The minimum scheduling time for convergecast in wireless sensor networks (Q1736606) (← links)
- A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff (Q1736674) (← links)
- Layer-based data aggregation and performance analysis in wireless sensor networks (Q1789963) (← links)
- Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks (Q2026168) (← links)
- Accurate data aggregation created by neural network and data classification processed through machine learning in wireless sensor networks (Q2148901) (← links)
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks (Q2266832) (← links)
- An improved distributed data aggregation scheduling in wireless sensor networks (Q2444150) (← links)
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks (Q2637250) (← links)
- Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks (Q2830947) (← links)
- Minimum-latency aggregation scheduling in wireless sensor network (Q5963622) (← links)
- Aggregation tree construction using hierarchical structures (Q6134051) (← links)
