Title :
Self-stabilizing distributed algorithms for graph alliances
Author :
Xu, Zhenyu ; Srimani, Pradip K.
Author_Institution :
Dept. of Comput. Sci., Clemson Univ., SC
Abstract :
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms for the global offensive and the global defensive alliance in a given arbitrary graph. We also provide complete analysis of the convergence time of both the algorithms
Keywords :
distributed algorithms; fault tolerant computing; graph theory; arbitrary graph; fault tolerant algorithm; global defensive alliance; global offensive alliance; self-stabilizing distributed algorithm; symmetric graph alliance; Algorithm design and analysis; Computer science; Convergence; Design optimization; Distributed algorithms; Fault tolerance; Fault tolerant systems; Sensor systems; Wireless application protocol; Wireless sensor networks;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International
Conference_Location :
Rhodes Island
Print_ISBN :
1-4244-0054-6
DOI :
10.1109/IPDPS.2006.1639558
