Self-stabilizing multicast protocols for ad hoc networks

Journal of Parallel and Distributed Computing

Volumn 63, Issue 1, 2003, Pages 87-96

  Gupta, Sandeep K S ^a,c   Srimani, Pradip K ^b  

^a Colorado State University   (United States)

^b AMRL   (United States)

^c ARIZONA STATE UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

EID: 0038625208     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(02)00029-1     Document Type: Article

References (15)

1. T. Ballardie, P. Francis, J. Crowcroft, Core based trees (CBT): an architecture for scalable inter domain multicast routing, in: SIGCOMM, ACM, 1993, pp. 85-95.
2. S. Chandrasekar, P.K. Srimani, A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms Appl. 4 (1&2) (1994) 125-137.
3. S.E. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, L. Wei, The PIM architecture for wide-area multicast routing, IEEE/ACM Trans. Networking 4 (2) 1996) 153-162.
4. S.K.S. Gupta, A. Bouabdallah, P.K. Srimani, Self-stabilizing protocol for shortest path tree for multicast routing in mobile networks, Lecture Notes in Computer Science, vol. 1900, Springer, Berlin, April 2000, pp. 600-604.
5. S.K.S. Gupta, P.K. Srimani, Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks, in: Proceedings of the DIMACS Workshop on Mobile Networks and Computing, Rutgers University, NJ, March 1999.
6. Z. Haas, J. Deng, B. Liang, P. Papadimitratos, S. Sajama, Wireless ad hoc networks in: J. Proakis (Ed.), Encyclopedia of Telecommunications, Wiley, New York, 2002.
7. E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, MD, 1984.
8. R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, Plenum Press, New York, 1972.
9. S. Keshav, An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network, Addison-Wesley, Reading, MA, 1997.
10. A. Khanna, J. Zinky, The revised arpanet routing metric, in: ACM SIGCOMM'89, August 1989.
11. B.M. Maggs, S.A. Plotkin, Minimum-cost spanning tree as a path finding problem, Inform. Process. Lett. 26 (1988) 291-293.
12. L.L. Peterson, B.S. Davie, Computer Networks, 2nd Edition, Morgan Kaufmann, Los Altos, CA, 1996.
13. C. Perking (Ed.), Ad Hoc Networking, Addison-Wesley, Reading, MA, 2001.
14. M. Schneider, Self-stabilization, ACM Comput. Surveys 25 (1) (1993) 45-67.
15. I. Stojmenovic (Ed.) Handbook of Wireless Networks and Mobile Computing, Wiley, New York, 2002.