Abstract
Our objective is to view the topology change as a change in the node adjacency information at one or more nodes and utilize the tools of self-stabilization to converge to a stable global state in the new network graph. We illustrate the concept by designing a new efficient distributed algorithm for multi-cast in a mobile network that can accommodate any change in the network topology due to node mobility.
Chapter PDF
References
A. Acharya and B. R. Badrinath. A framework for delivering multicast messages in networks with mobile hosts. ACM/Baltzer Journal of Mobile Networks and Applications, 1:199–219, 1996.
K. Chao and K. P. Birman. A group communication approach for mobile communication. In Proc. Mobile Computing Workshop, Santa Cruz, CA, December 1994.
S. K. S. Gupta and P. K. Srimani. Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks. In Proc. DIMACS Workshop on Mobile Networks and Computing, Rutgers University, NJ, March 1999.
R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, New York, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, S.K.S., Bouabdallah, A., Srimani, P.K. (2000). Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_83
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive