Abstract
In this paper, we present a lookahead expansion algorithm (named as Shrinking and Lookahead Expansion, SLE for short) for minimum power multicast tree problem in wireless ad hoc networks. SLE adopts the powerful shrinking process from our previous work, SOR (Shrinking Overlapped Range) algorithm, and adds an intelligent lookahead process to further improve the solution quality. The lookahead process (called as lookahead expansion) expands the intermediate tree to a feasible tree by adding transmissions with minimum power, one by one. The algorithm maintains the found feasible tree with the minimum power sum in addition to the intermediate tree which is not feasible until the end. This lookahead process generates the effective diversification of the solution search space. The computational results strongly support the solid and outstanding performance of SLE owing to the lookahead process.
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, vol. 2, pp. 1001–1010 (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., 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)
Min, M., Pardalos, P.M.: Total Energy Optimal Multicasting in Wireless Ad Hoc Networks. Journal of Combinatorial Optimizations 13, 365–378 (2006)
Min, M., Pardalos, P.M.: OMEGa: an Optimistic Most Energy Gain Method for Minimum Energy Multicasting in Wireless Ad Hoc Networks. Journal of Combinatorial Optimization 16, 81–95 (2008)
Min, M.: Comparison of Iterated Algorithms for the Minimum Energy Multicast Tree Problem in Wireless Ad Hoc Networks. In: Proceedings of International Conference on Wireless Networks, pp. 215–221 (2008)
Min, M., O’Brien, A.F., Shin, S.Y.: Partitioning-Based SOR for Minimum Energy Multicast Tree Problem in Wireless Ad Hoc Networks. Technical Report, Dept. of EECS, South Dakota State University (August 2008)
Montemanni, R., Gambardella, L.M.: Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach. Mobile and Wireless Communication Networks 162, 497–508 (2005)
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
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, M., O’Brien, A.F. (2009). Lookahead Expansion Algorithm for Minimum Power Multicasting in Wireless Ad Hoc Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)