Abstract
Ad-hoc networks are collections of mobile nodes communicating using wireless media and without any fixed physical infrastructure. Multicast is an important application in wireless ad hoc networks. Most of the existing protocols construct a VMB (Virtual Multicast Backbone) to provide multicast services. In this paper, we will use MSCDS (Minimum Steiner Connected Dominating Set) in UDG (Unit Disk Graph) to model the optimal VMB, which aims at minimizing the number of forwarding nodes and present a centralized approximation algorithm with a PR (Performance Ratio) approaching 2c + 1 , where c is the PR of edge weighted Steiner tree algorithm, currently with c = 1.55. It is an improvement of the previous best approximation guarantee 10.
This Paper is supported by National Natural Science Foundation of China [No. 60173048].
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
Garcia-Luna-Aceves, J.J., Madruga, E.L.: The Core-Assisted Mesh Protocol. In: IEEE JSAC, August 1999, pp. 1380–1394 (1999)
Chen, K., Nahrstedt, K.: Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET. In: Proc. INFOCOM, pp. 1180–1189 (2002)
Gerla, M., Lee, S.J., Su, W.: On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks. Internet draft, draft-ietf-manet-odmrp-02.txt (2000)
Wu, J., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. In: International Conference on Parallel Processing, pp. 346–354 (2001)
Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set For-mation in Ad Hoc Wireless Networks. IEEE Trans on Parallel and Distributed Systems 15(10) (October 2004)
Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications, June 1997, pp. 376–380 (1997)
Wu, J.: Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links. IEEE Trans. on Parallel and Distributed Systems 9(3), 189–200 (2002)
Butenko, S., Cheng, X., Du, D.-Z., Pardalos, P.M.: On the con-struction of virtual backbone for ad hoc wireless networks. In: Cooperative Systems, vol. 1, ch. 1, pp. 43–54. Kluwer Academic Publishers, Dordrecht (2003)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected domi-nating set in wireless ad hoc networks. In: IEEE INFOCOM (June 2002)
Cheng, X., Huang, X., Li, D., Wu, W., Du., D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)
Wu, Y., Xu, Y., Chen, G., Wang, K.: On the Construction of Virtual Multicast Backbone for Wireless Ad Hoc Networks. In: IEEE MASS (October 2004)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770–779 (2000)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inform and Computing 150, 57–74 (1999)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM 32, 130–136 (1985)
Li, X.-y., Wang, Y.: Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. In: ACM Dial-M, Atlanta, Georgia, USA, September 28 (2002)
Wang, S.-h.: Graph Theory and its algorithm, p. 127. USTC Press (1990)
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
Xu, Cg., Xu, Yl., Wu, Jm. (2005). On the Minimization of the Number of Forwarding Nodes for Multicast in Wireless Ad Hoc Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_32
Download citation
DOI: https://doi.org/10.1007/11534310_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)