Abstract
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.
Research is supported by NSF Award CCF-0729182.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues. In: Proceedings of the international conference on Mobile computing and networking, pp. 172–182 (2002)
Cheng, M.X., Sun, J., Min, M., Du., D.-Z.: Energy-efficient Broadcast and Multicast Routing in Ad Hoc Wireless Networks. In: Proceedings of the IEEE International Conference on Performance, Computing, and Communications Conference, pp. 87–94 (2003)
Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.: Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations. In: Proceedings of INFOCOM 2003 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco (1979)
Min, M., Pardalos, P.M.: OMEGa: an Optimistic Most Energy Gain Method for Minimum Energy Multicasting in Wireless Ad Hoc Networks (in submission, 2006)
Min, M., Pardalos, P.M.: Total Energy Optimal Multicasting in Wireless Ad Hoc Networks. Journal of Combinatorial Optimization (accepted, 2006)
Min, M., Prokopyev, O., Pardalos, P.M.: Optimal Solutions to Minimum Total Energy Broadcasting Problem in Wireless Ad Hoc Networks. Journal of Combinatorial Optimization, Special Issue on Wireless Network Applications 11, 59–69 (2006)
Montemanni, R., Gambardella, L.M.: Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach. In: Proceedings of IEEE International Conference on Mobile and Wireless Communication Networks (2004)
Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks 8, 607–617 (2002)
Wan, P.-J., Calinescu, G., Yi, C.-W.: Minimum-Power Multicast Routing in Static Ad Hoc Wireless Networks. IEEE/ACM Transactions on Networking 12, 507–514 (2004)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. Mobile Networks and Applications 7, 481–492 (2002)
Yuan, D.: Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks. In: Proceedings of International symposyum on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, pp. 323–331 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, M. (2008). A Simple Yet Effective Diversifying Improvement of the Minimum Power Multicast Tree Algorithms in Wireless Ad Hoc Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)