Aggregation tree construction using hierarchical structures
From MaRDI portal
Publication:6134051
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Wireless sensor networks as related to computer science (68M18)
Recommendations
Cites work
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
- Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks
- Improved algorithm for minimum data aggregation time problem in wireless sensor networks
- Introduction to Genetic Algorithms
- Optimum branchings
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- The capacity of wireless networks
- Variable neighborhood decomposition search
- Variable neighborhood search-based heuristics for MIN-power symmetric connectivity problem in wireless networks
- Variable neighborhood search: Principles and applications
This page was built for publication: Aggregation tree construction using hierarchical structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134051)