Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
| Hi-index | 0.00 |
In this paper, we present an iterated algorithm framework that can be implemented with heuristics in the literature for the minimum energy multicasting problem in wireless ad hoc networks to improve the solution quality. 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 prunes the broadcast tree into a multicast tree and gives the output of the best solution so far. By fixing the source node's transmission power we can achieve the 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.