Abstract
Computing energy efficient broadcast trees is one of the most prominent operations in wireless networks. For stations embedded in the Euclidean plane, the best analytic result known to date is a 6.33-approximation algorithm based on computing an Euclidean minimum spanning tree. We improve the analysis of this algorithm and show that its approximation ratio is 6, which matches a previously known lower bound for this algorithm.
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
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time Complexity of Broadcast Operations in Multi-Hop Radio Networks: An Exponential Gap Between Determinism and Randomization. Journal of Computer and Systems Science 45, 104–126 (1992)
Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple Communication in Multi-Hop Radio Networks. SIAM Journal on Computing 22, 875–887 (1993)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome “Tor Vergata”, Math Department (2001)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 121–131 (2001)
Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23–38 (2002)
Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: On the Approximation Ratio of the MST-based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Wireless Networks. In: 3rd Workshop on Wireles, Mobile and Ad-Hoc Networks (WMAN) in the Proceedigs of the 17th International Parallel and Distributed Precessing Symposium, IPDPS (2003)
Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 585–594 (2000)
Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proceedings of the 2004 joint workshop on Foundations of mobile computing (2004)
Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16(1), 1–29 (1968)
Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150, 57–74 (1999)
Haas, Z., Tabrizi, S.: On Some Challenges and Design Choices in Ad-Hoc Communications. In: Proceedings of the IEEE Military Communication Conference, MILCOM (1998)
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science 243, 289–305 (2000)
Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem, pp. 866–877 (2004)
Lauer, G.S.: Packet radio routing. In: Streenstrup, M. (ed.) Routing in communication networks, ch. 11, pp. 351–396. Prentice-Hall, Englewood Cliffs (1995)
Navarra, A., Flammini, M., Perennes, S.: The “real” approximation factor of the mst heuristic for the minimum energy broadcasting, pp. 22–31 (2005)
Montemanni, R., Gambardella, L.M.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers and Operations Research (to appear)
Montemanni, R., Gambardella, L.M., Das, A.K.: Mathematical models and exact algorithms for the min-power symmetric connectivity problem: an overview. In: Wu, J. (ed.) Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. CRC Press, Boca Raton (to appear)
Navarra, A.: Tighter bounds for the minimum energy broadcasting problem, pp. 313–322 (2005)
Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley Interscience, Hoboken (1995)
Steele, J.M.: Cost of sequential connection for points in space. Operations Research Letters 8(3), 137–142 (1989)
Wan, P.J., Cǎlinescu, G., Li, X.Y., Frieder, O.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162–1171 (2001)
Weisstein, E.W.: MathWorld–A Wolfram Web Resource, http://mathworld.wolfram.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambühl, C. (2005). An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_92
Download citation
DOI: https://doi.org/10.1007/11523468_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)