Two new algorithms for the min-power broadcast problem in static ad hoc networks

DOI10.1016/j.amc.2007.02.062zbMath1143.94029OpenAlexW2061773779MaRDI QIDQ2383911

S. Mehdi Hashemi, Ahmad Moradi, Mohsen Rezapour

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.062

zbMATH Keywords

simulated annealingad hoc networkstopology controlpower consumptionminimum power broadcast

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Optimization by Simulated Annealing
• A Shifting Algorithm for Min-Max Tree Partitioning
• Equation of State Calculations by Fast Computing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two new algorithms for the min-power broadcast problem in static ad hoc networks