A Self-Stabilizing Leader Election Algorithm for Tree Graphs

Abstract

We propose a self stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction. 
DOI: 10.1006/jpdc.1996.0059

Topics

2 Figures and Tables

Cite this paper

@article{Antonoiu1996ASL, title={A Self-Stabilizing Leader Election Algorithm for Tree Graphs}, author={Gheorghe Antonoiu and Pradip K. Srimani}, journal={J. Parallel Distrib. Comput.}, year={1996}, volume={34}, pages={227-232} }