The minimum power broadcast problem in wireless networks: a simulated annealing approach

Broadcasting in wireless networks, unlike wired networks, inherently reaches several nodes with a single transmission. For onmidirectional wireless broadcast to a node, all nodes closer will also be reached. This property can be used to compute routing trees which minimize the sum of the transmitter powers. In this paper we present a mixed integer programming formulation and a simulated annealing algorithm for the problem. Extensive experimental results for the heuristic approach are presented. They show that the algorithm we propose is capable of improving the results of state-of-the-art algorithms for most of the problems considered. The solutions provided by the simulated annealing algorithm can be improved by applying a very fast post-optimization procedure. This leads to the best known mean results for the problems considered.