Preselection Based Leader Election in Distributed Systems

AbstractThis work presents a self-stabilizing leader election algorithm for arbitrary network topology. Here, we introduce the concept of the provisional leader that helps to improve the system performance. The proposed algorithm identifies r comparatively higher potential leader capable nodes in the system and designates the highest potential node among them as the leader. To reduce the time complexity and the message complexity of the election process, based on the eccentricity of the nodes, we divide a distributed system into two layers (i.e., inner-layer and outer-layer). Only the inner-layer nodes take part to identify the list of potential nodes. We also simulate the proposed algorithm on several arbitrary network topologies and compare the results with existing well-known algorithms.