Aggregation tree construction using hierarchical structures

DOI10.1007/978-3-031-35305-5_7zbMath1519.90049OpenAlexW4381956642MaRDI QIDQ6134051

Adil I. Erzin, Roman Plotnikov, Ilya Ladygin

Publication date: 21 August 2023

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_7

zbMATH Keywords

hierarchical structureconvergecastaggregation treeconflict-free aggregation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks
• Variable neighborhood decomposition search
• Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks
• Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks
• The capacity of wireless networks
• Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
• Introduction to Genetic Algorithms
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks
• Optimum branchings
• Variable neighborhood search: Principles and applications

This page was built for publication: Aggregation tree construction using hierarchical structures