Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks

In this paper, we present an iterated algorithm framework that can be implemented with heuristics in the literature for the minimum energy broadcasting problem in wireless ad hoc networks. We investigate three iterated algorithm implementations, IBIP, IOMEGa, ISOR, that are based on BIP, OMEGa, SOR. The algorithms run iterations to find better solutions of the problem and in each iteration, fixing the source node´s transmission power, the algorithm finds the intermediate solutions. And after all the iterations, the algorithm will give the output of the best solution so far. By fixing the source node´s transmission power we can get the effect of diverse solution search without hurting the original algorithm´s theoretical performance bound. The experimental results confirm that the iterated algorithms significantly improve the solution quality with the help of diverse search.