Abstract
In this paper we address the problem of establishing a cost efficient multicast tree among a group of stationary nodes in a multi-hop wireless network. The flooding of broadcast discovery messages is a major limitation to the scalability of most ad hoc protocols. To avoid massive flooding, we limit the reach of broadcast discovery messages, and consider the case were joining nodes can only learn limited information about the multicast group topology from neighbors within a fixed number of hops. We propose two algorithms that satisfy this constraint. We analyze the worst case cost of the established trees and prove that the first algorithm builds a minimal cost spanning tree, while the second builds a sub-optimal tree with a worst-case approximation ratio of O(log n/loglog n). The advantage of the second algorithm is that the communication requirement for a node to join the multicast tree is smaller. We simulate and compare the proposed algorithms. Finally, we discuss the implementation issues and scenarios for using each one of them. We also describe our secure multicast application that builds on top of the proposed protocols.
Work supported by Draper Laboratory IR&D grant under contract #523120. This work was done while Tansel Kaya was a graduate student at CCIS, Northeastern University.
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
Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. In: Proceedings of the eighth annual symposium on Computational geometry (1992)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Imase, M., Waxman, B.: Dynamic Steiner Tree Problem. SIAM J. Disc. Math (1991)
Kaya, T., Lin, G., Noubir, G., Yilmaz, A.: Secure Multicast Groups on Ad-Hoc Networks. In: ACM workshop on Security of Ad Hoc and Sensor Networks, SASN 2003 (2003)
Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. CACM (1985)
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
Kaya, T., Lin, P.J., Noubir, G., Qian, W. (2005). Efficient Multicast Trees with Local Knowledge on Wireless Ad Hoc Networks. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2005. Lecture Notes in Computer Science, vol 3510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424505_24
Download citation
DOI: https://doi.org/10.1007/11424505_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25899-5
Online ISBN: 978-3-540-32104-0
eBook Packages: Computer ScienceComputer Science (R0)