An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1139-1150

  Ambühl, Christoph ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; TREES (MATHEMATICS);

APPROXIMATION RATIO; BROADCAST TREES; WIRELESS NETWORKS;

COMPUTER SCIENCE;

EID: 26444440419     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_92     Document Type: Conference Paper

References (22)

1. R. Bar-Yehuda, O. Goldreich, and A. Itai. 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.
2. R. Bar-Yehuda, A. Israeli, and A. Itai. Multiple Communication in Multi-Hop Radio Networks. SIAM Journal on Computing, 22:875-887, 1993.
3. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. 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.
4. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 121-131, 2001.
5. A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. 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), pages 23-38, 2002.
6. A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven. 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.
7. A. Ephremides, G.D. Nguyen, and I.E. Wieselthier. 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), pages 585-594, 2000.
8. M. Flammini, R. Klasing, A. Navarra, and S. Perennes. Improved approximation results for the minimum energy broadcasting problem. Proceedings of the 2004 joint workshop on Foundations of mobile computing, 2004.
9. E. N. Gilbert and H. O. Pollak. Steiner minimal trees. SIAM Journal on Applied Mathematics, 16(1):1-29, 1968.
10. S. Guha and S. Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, 150:57-74, 1999.
11. Z. Haas and S. Tabrizi. On Some Challenges and Design Choices in Ad-Hoc Communications. In Proceedings of the IEEE Military Communication Conference (MILCOM), 1998.
12. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, 243:289-305, 2000.
13. R. Klasing, A. Navarra, A. Papadopoulos, and S. Perennes. Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem, pages 866-877, 2004.
14. G.S. Lauer. Packet radio routing, chapter 11 of Routing in communication networks, M. Streenstrup (ed.), pages 351-396. Prentice-Hall, 1995.
15. A. Navarra M. Flammini and S. Perennes. The "real" approximation factor of the mst heuristic for the minimum energy broadcasting, pages 22-31, 2005.
16. R. Montemanni and L.M. Gambardella. Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Computers and Operations Research, to appear.
17. R. Montemanni, L.M. Gambardella, and A.K. Das. Mathematical models and exact algorithms for the min-power symmetric connectivity problem: an overview. In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. Jie Wu ed., CRC Press, to appear.
18. A. Navarra. Tighter bounds for the minimum energy broadcasting problem, pages 313-322, 2005.
19. K. Pahlavan and A. Levesque. Wireless Information Networks. Wiley-Interscience, 1995.
20. J. M. Steele. Cost of sequential connection for points in space. Operations Research Letters, 8(3):137-142, 1989.
21. P.J. Wan, G. Cǎlinescu, X.Y. Li, and O. Frieder. 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), pages 1162-1171, 2001.
22. E. W. Weisstein. MathWorld-A Wolfram Web Resource. http://mathworld. wolfram.com.