Abstract
This 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biswas, A., Dutta, A.: A timer based leader election algorithm. In: 2016 International IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld), pp. 432–439. IEEE (2016)
Biswas, A., Maurya, A.K., Tripathi, A.K., Aknine, S.: Frlle: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems. J. Supercomput. 77(1), 751–779 (2021)
Biswas, A., Tripathi, A.K., Aknine, S.: Lea-tn: leader election algorithm considering node and link failures in a torus network. J. Supercomput. 1–38 (2021)
Dagdeviren, O., Erciyes, K.: A hierarchical leader election protocol for mobile ad hoc networks. In: International Conference on Computational Science, pp. 509–518. Springer, Berlin (2008)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Prog. Lang. Syst. (TOPLAS) 5(1), 66–77 (1983)
Krnc, M., Sereni, J.S., Škrekovski, R., Yilma, Z.B.: Eccentricity of networks with structural constraints. Discussiones Mathematicae Graph Theory (2018)
Maurya, A.K., Tripathi, D., Biswas, A., Tripathi, A.K.: Design issues in distributed software. In: 2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC), pp. 563–567. IEEE (2018)
Raychoudhury, V., Cao, J., Niyogi, R., Wu, W., Lai, Y.: Top k-leader election in mobile ad hoc networks. Pervasive Mobile Comput. 13, 181–202 (2014)
Santoro, N.: Design and Analysis of Distributed Algorithms, vol. 56. Wiley, New York (2006)
Tanenbaum, A.S., Van Steen, M.: Distributed Systems: Principles and Paradigms. Prentice-Hall, Hoboken (2007)
Vasudevan, S., Kurose, J., Towsley, D.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004, pp. 350–360. IEEE (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Biswas, A., Tripathi, A.K. (2022). Preselection Based Leader Election in Distributed Systems. In: Camacho, D., Rosaci, D., Sarné, G.M.L., Versaci, M. (eds) Intelligent Distributed Computing XIV. IDC 2021. Studies in Computational Intelligence, vol 1026. Springer, Cham. https://doi.org/10.1007/978-3-030-96627-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-96627-0_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-96626-3
Online ISBN: 978-3-030-96627-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)