Leader election in the presence of link failures
G. Singh · IEEE Transactions on Parallel and Distributed Systems · 1996
We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2-1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N/sup 2/).