Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction

This paper considers the leader election problem (LEP) in asynchronous complete networks with undetectable fail-stop failures. Especially, it is discussed whether presence of a global sense of direction affects the message complexity of LEP in faulty networks. For a complete network of n processors where k processors start the algorithm spontaneously and at most f p (<n/2) processors are faulty, this paper shows