Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1900, Issue , 2000, Pages 600-604

  Gupta, Sandeep K S ^a   Bouabdallah, Abdelmadjid ^b   Srimani, Pradip K ^a,b  

^a Colorado State University   (United States)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Convergence; Distributed system; Fault tolerance; Multi cast protocol; Self stabilizing protocol; System graph

Indexed keywords

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; ROUTING PROTOCOLS; WIRELESS NETWORKS;

CONVERGENCE; DISTRIBUTED SYSTEMS; NETWORK TOPOLOGY; SELF STABILIZATION; SELF-STABILIZING PROTOCOL; SHORTEST PATH TREE; SYSTEM GRAPH; TOPOLOGY CHANGES;

GRAPH THEORY;

EID: 84937391914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44520-x_83     Document Type: Conference Paper

References (4)

1. 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.
2. K. Chao and K. P. Birman. A group communication approach for mobile communication. In Proc. Mobile Computing Workshop, Santa Cruz, CA, December 1994.
3. 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.
4. R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, New York, 1972.