Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Srimani, Pradip K ^a  

^a AMRL   (United States)

Author keywords

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

Indexed keywords

AD HOC NETWORKS; COMPLEX NETWORKS; DISTRIBUTED PARAMETER NETWORKS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

CONVERGENCE; DISTRIBUTED SYSTEMS; MAXIMAL INDEPENDENT SET; SELF-STABILIZING ALGORITHM; SELF-STABILIZING DISTRIBUTED ALGORITHM; SELF-STABILIZING PROTOCOL; SYSTEM GRAPH; TIME COMPLEXITY ANALYSIS;

ALGORITHMS;

EID: 84947286561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213302     Document Type: Conference Paper

References (16)

1. S Dolev, DK Pradhan, and JL Welch. Modified tree structure for location management in mobile environments. Computer Communications, 19:335-345, 1996.
2. S Dolev and JLWelch. Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46:14-26, 1997.
3. H Abu-Amara, B Coan, S Dolev, A Kanevsky, and JL Welch. Self-stabilizing topology maintenance protocols for high-speed networks. IEEE/ACM Transactions on Networking, 4(6):902-912, 1996.
4. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Mc-Graw Hill, 1998.
5. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
6. S. Fujita, T. Kameda, and M. Yamashita. A resource assignment problem on graphs. In Proceedings of the 6th International Symposium on Algorithms and Computation, pages 418-427, Cairns, Australia, December 1995.
7. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Fault tolerant distributed coloring algorithms that stabilize in linear time. In Proceedings of the IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, pages 1-5, 2002.
8. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
9. E. W. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1(1):5-6, 1986.
10. S Dolev. Self-Stabilization. MIT Press, 2000.
11. Y Afek and S Dolev. Local stabilizer. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pages 74-84, 1997.
12. S. Shukla, D. Rosenkrantz, and S. Ravi. Developing self-stabilizing coloring algorithms via systematic randomization. Proc. Internat. Workshop on Parallel Processing, pages 668-673, 1994.
13. SKS Gupta and PK 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, pages 67-84, Rutgers University, NJ, 1999.
14. SKS Gupta, A Bouabdallah, and PK Srimani. Selfstabilizing protocol for shortest path tree for multi-cast routing in mobile networks (research note). In Euro-Par'00 Parallel Processing, Proceedings LNCS:1900, pages 600-604, 2000.
15. Su-Chu Hsu and Singh-Tsaan Huang. A selfstabilizing algorithm for maximal matching. Inform. Process. Lett., 43:77-81, 1992.
16. J Beauquier, AK Datta, M Gradinariu, and F Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer LNCS:1914, pages 223-237, 2000.