Leader Election in Anonymous Rings: Franklin Goes Probabilistic


We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin [22], augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm is finite-state, so that various model checking techniques can be employed to verify its correctness, that is, eventually a unique leader is elected with probability one. We also sketch a formal correctness proof of the algorithm for rings with arbitrary size.

DOI: 10.1007/978-0-387-09680-3_4

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Bakhshi2008LeaderEI, title={Leader Election in Anonymous Rings: Franklin Goes Probabilistic}, author={Rena Bakhshi and Wan Fokkink and Jun Pang and Jaco van de Pol}, booktitle={IFIP TCS}, year={2008} }