An Improved Leader Election Algorithm for Distributed Systems

Leader Election Algorithm , not only in distributed systems but in any communication network, is anessential matter for discussion. Tremendous amount of work are happening in the research community onthis Election, because many network protocols are in need of a coordinator process for the smooth runningof the system. These socalled Leader or Coordinator processes are responsible for the synchronization ofthe system. If there is no synchronization, then the entire system would become inconsistent which internmakes the system to lose its reliability. Since all the processes need to interact with the leader process, theyall must agree upon who the present leader is. Furthermore, if the leader process crashes, the new leaderprocess should take the charge as early as possible. New leader is one among the currently runningprocesses with the highest process id. In this paper we have presented a modified version of ring algorithm.Our work involves substantial modifications of the existing ring election algorithm and the comparison ofmessage complexity with the original algorithm. Simulation results show that our algorithmminimizes thenumber of messages being exchanged in electing the coordinator