A synod based deterministic and indulgent leader election protocol for asynchronous large groups

This paper presents a deterministic and indulgent algorithm for leader election. Our algorithm is adapted to large-scale systems with the primary objective of faster execution time to elect a leader. We modify the singledecree Paxos consensus (Synod) algorithm such that proposers proposing the same value do not conflict with each other. Although any process in the system can initiate election, we restrict the decision making on electing the leader to a select set of processes A, called acceptors. For a given k (= vertical bar A vertical bar) acceptors in the system, our algorithm can tolerate up to f = inverted right perpendiculark/2 - 1inverted left perpendicular failures in A, and any number of process failures outside A. The restriction on decision making allows our algorithm to scale without compromising on performance. Experimental results show that our algorithm is faster to elect a leader than existing algorithms which are optimised for largescale systems. We also adapt our algorithm for leader election in Wireless Sensor Networks (WSNs) and Internet of Things (IoTs) and show that it performs better than the existing graph-based techniques employed in these systems. [GRAPHICS] .