Approximating optimal multicast trees in wireless multihop networks

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2005, Pages 686-691

  Ruiz, Pedro M ^a   Gomez Skarmeta, Antonio F ^a  

^a UNIVERSITY OF MURCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

MESH NETWORKS; NP-COMPLETE; STEINER TREE PROBLEMS;

APPROXIMATION THEORY; BANDWIDTH; COMPUTER SIMULATION; HEURISTIC METHODS; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

MULTICASTING;

EID: 27544498772     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2005.34     Document Type: Conference Paper

References (10)

1. S. Deering, "Multicast Routing in a Datagram Inter-network," Ph.D. Thesis, Electrical Engineering Dept., Stanford University, Dec. 1991.
2. M. Ramalho, "Intra- and Inter-Domain Multicast Routing Protocols: A Survey and Taxonomy," IEEE Communications Surveys & Tutorials, vol. 3, no. 1, March 2000, pp. 2-25.
3. C. Cordeiro, H. Gossain and D. Agrawal, "Multicast over Wireless Mobile Ad Hoc Networks: Present and Future Directions" IEEE Network, no. 1, Jan 2003, pp. 52-59.
4. R.-M. Karp, "Reducibility among combinatorial problems," In Complexity of computer computations, Plenum Press, New York, 1975, pp.85-103.
5. B.-M. Waxman, "Routing of Multipoint Connections," IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, December 1998, pp. 1617-1622.
6. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, no. 15, vol. 2, 1981, pp. 141-145.
7. J. Plesnik, "The complexity of designing a network with minimum diameter," Networks, no. 11, 1981, pp. 77-85.
8. A. Zelikovsky, "An 11/6-approximation algorithm for the network Steiner problem," Algorithmica, no. 9, 1993, pp.463-470.
9. S. Even, "Graph Algorithms," Computer Science Press, 1979, pp. 204-209.
10. H. Lim and C. Kim, "Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks," Proc. MSWM'00, Boston, MA. August, 2000, pp. 61-68.