Abstract
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner tree problem, and it has been widely studied before. We demonstrate in this paper, that for multihop wireless mesh networks, a Steiner tree does not offer the minimal bandwidth consumption, because it neglects the wireless multicat advantage. Thus, we re-formulate the problem in terms of minimizing the numbrer of transmissions, rather than the edge cost of multicast trees. We show that the new problem is also NP-complete and we propose heuristics to compute good approximations for such bandwidth-optimal trees. Our simulation results show that the proposed heuristics offer a lower bandwidth consumption compared with Steiner trees.
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.
Similar content being viewed by others
References
Deering, S.: Multicast Routing in a Datagram Internetwork, Ph.D. Thesis, Electrical Engineering Dept., Stanford University (December 1991)
Deering, S.-E., Cheriton, D.-R.: Multicast Routing in datagram internetworks and extended LANs. Transactions on Computer Systems 8(2), 85–110 (1990)
Moy, J.: Multicast routing extensions for OSPF. Computer communications of the ACM 37(8), 61–66 (1994)
Ballardie, T., Francis, P., Crowcroft, J.: Core Based Trees (CBT) – An architecture for scalable inter-domain multicast routing. In: Proc. of ACM SIGCOMM 1993, San Francisco, CA, pp. 85–95 (October 1993)
Deering, S., Estrin, D.-L., Farinacci, D., Jacobson, V., Liu, C.-G., Wei, L.: The PIM architecture for wide-area multicast routing. IEEE/ACM Transactions on Networking 4(2), 153–162 (1996)
Cordeiro, C., Gossain, H., Agrawal, D.: Multicast over Wireless Mobile Ad Hoc Networks: Present and Future Directions. IEEE Network (1), 52–59 (2003)
Karp, R.-M.: Reducibility among combinatorial problems. In: Complexity of computer computations, pp. 85–103. Plenum Press, New York (1975)
Waxman, B.-M.: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1998)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 2(15), 141–145 (1981)
Plesnik, J.: The complexity of designing a network with minimum diameter. Networks (11), 77–85 (1981)
Zelikovsky, A.: An 11/6-approximation algorithm for the network Steiner problem. Algorithmica (9), 463–470 (1993)
Rajagopalan, S., Vazirani, V.V.: On the bidirected cut relaxation for the metric Steiner tree problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 742–751 (1999)
Even, S.: Graph Algorithms, pp. 204–209. Computer Science Press, Rockville (1979)
Lim, H., Kim, C.: Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks. In: Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, Boston, MA, USA, pp. 61–68 (August 2000)
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
Ruiz, P.M., Gomez-Skarmeta, A.F. (2005). Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks. In: Syrotiuk, V.R., Chávez, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2005. Lecture Notes in Computer Science, vol 3738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561354_22
Download citation
DOI: https://doi.org/10.1007/11561354_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29132-9
Online ISBN: 978-3-540-32086-9
eBook Packages: Computer ScienceComputer Science (R0)