Abstract
Energy is a scarce resource in ad hoc wireless networks and it is of paramount importance to use it efficiently when establishing communication patterns. In this work we study algorithms for computing energy-efficient multicast trees in ad hoc wireless networks. Such algorithms either start with an empty solution which is gradually augmented to a multicast tree (augmentation algorithms) or take as input an initial multicast tree and ’walk’ on different multicast trees for a finite number of steps until some acceptable decrease in energy consumption is achieved (local search algorithms).
We mainly focus on augmentation algorithms and in particular we have implemented a long list of existing such algorithms in the literature and new ones. We experimentally compare all these algorithms on random geometric instances of the problem and obtain results in terms of the energy efficiency of the solutions obtained. Additional results concerning the running time of our implementations are also presented. We also explore how much the solutions obtained by augmentation algorithms can be improved by local search algorithms. Our results show that one of our new algorithms and its variations achieve the most energy-efficient solutions while being very fast. Our investigations shed some light to those properties of geometric instances of the problem which make augmentation algorithms perform well.
This work was partially supported by the European Union under IST FET Project CRESCCO and RTN Project ARACNE.
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: Proc. of the 8th ACM International Conference on Mobile Networking and Computing (Mobicom 2002), pp. 172–182 (2002)
Cǎlinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114–126. Springer, Heidelberg (2003)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: New Results for Energy- Efficient Broadcasting in Wireless Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 332–343. Springer, Heidelberg (2002)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-Efficient Wireless Network Design. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 585–594. Springer, Heidelberg (2003)
Cartigny, J., Simplot, D., Stojmenovic, I.: Localized minimum energy broadcasting in ad hoc networks. In: Proc. of IEEE INFOCOM 2003 (2003)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)
Clementi, A.E.F., Di Ianni, M., Silvestri, R.: The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science 299(1-3), 751–761 (2003)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150(1), 57–74 (1999)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science 243(1-2), 289–305 (2000)
Klein, P.N., Ravi, R.: A Nearly Best Possible Approximation Algorithm for Node-Weighted Steiner Trees. Journal of Algorithms 19(1), 104–115 (1995)
Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: Proc. of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), pp. 112–122 (2002)
Mavinkurve, P., Ngo, H.Q., Mensa, H.: MIP3S: Algorithms for Power-conserving Multicasting in Wireless Ad Hoc Networks. In: Proc. of the 11th IEEE International Conference on Networks, ICON 2003 (2003)
Wan, P.-J., Cǎlinescu, G., Li, X.-Y., Frieder, O.: Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks 8(6), 607–617 (2002)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of IEEE INFOCOM 2000, pp. 585–594 (2000)
Verma, V., Chandak, A., Ngo, H.Q.: DIP3S: A Distributive Routing Algorithm for Power-Conserving Broadcasting in Wireless Ad Hoc Networks. In: Proc. of the Fifth IFIP-TC6 International Conference on Mobile and Wireless Communications Networks (MWCN 2003), pp. 159–162 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P. (2004). Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2004. Lecture Notes in Computer Science, vol 3158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28634-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-28634-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22543-0
Online ISBN: 978-3-540-28634-9
eBook Packages: Springer Book Archive