Comparison of Iterated Algorithms for the Minimum Energy Multicast Tree Problem in Wireless Ad Hoc Networks

In this paper, the authors compare the iterated algorithms that are based on the heuristics in the literature for the minimum energy multicasting problem in wireless ad hoc networks. They investigate eight iterated algorithm implementations, IBIPp, IMIP, IOMEGap, IOMEGa, ISORp, ISOR, IEWMAp and IMIPF that are based on BIP/MIP, OMEGa, SOR, EWMA and MIPF, respectively. For the broadcast heuristics such as EWMA, the authors used pruning after each iteration to compute the multicast tree and for the multicast heuristics such as MIP, OMEGa and SOR, they used both approaches: pruning after each iteration and multicast tree construction in each iteration.