Resource Factor-Based Leader Election for Ring Networks

  • Tarun BiswasEmail author
  • Anjan Kumar Ray
  • Pratyay Kuila
  • Sangram Ray
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 553)


A leader election is one of the fundamental problems in distributed systems. A node should have sufficient amount of resources to act as a leader. In this paper, we have proposed a leader election algorithm considering available resources of the nodes. All the nodes compute their resource factor (RF) value and form a process priority status queue (PPSQ) to transmit it to the next connected node. Finally, the node with highest RF value will be elected as a leader. Extensive simulations are performed, and it is shown that the proposed technique is better than the existing random leader election techniques in terms of available resources.


Process priority status queue (PPSQ) Resource factor (RF) Leader election Ring network Distributed systems 


  1. 1.
    Pradeep K Sinha. Distributed operating systems: concepts and design. PHI Learning Pvt. Ltd., 1998.Google Scholar
  2. 2.
    Ajoy K Datta, Lawrence L Larmore, and Priyanka Vemula. An o(n)-time self-stabilizing leader election algorithm. Journal of Parallel and Distributed Computing, 71(11): 1532–1544, 2011.Google Scholar
  3. 3.
    Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. Sublinear bounds for randomized leader election. Theoretical Computer Science, 561: 134–143, 2015.Google Scholar
  4. 4.
    Sung-Hoon Park. A stable election protocol based on an unreliable failure detector in distributed systems. In Information Technology: New Generations (ITNG), 2011 Eighth International Conference on, pages 979–984. IEEE, 2011.Google Scholar
  5. 5.
    Seema Balhara and Kavita Khanna. Leader election algorithms in distributed systems. 2014.Google Scholar
  6. 6.
    Ajay D Kshemkalyani and Mukesh Singhal. Distributed computing: principles, algorithms, and systems. Cambridge University Press, 2011.Google Scholar
  7. 7.
    Greg N Frederickson and Nancy A Lynch. Electing a leader in a synchronous ring. Journal of the ACM (JACM), 34(1): 98–115, 1987.Google Scholar
  8. 8.
    Hector Garcia-Molina. Elections in a distributed computing system. IEEE Transactions on Computers, 100(1):48–59, 1982.Google Scholar
  9. 9.
    Andrew Clark, Basel Alomair, Linda Bushnell, and Radha Poovendran. Minimizing convergence error in multi-agent systems via leader selection: A super modular optimization approach. IEEE Transactions on Automatic Control, 59(6):1480–1494, 2014.Google Scholar
  10. 10.
    Ernest Chang and Rosemary Roberts. An improved algorithm for decentralized extrema finding in circular configurations of processes. Communications of the ACM, 22(5):281–283, 1979.Google Scholar
  11. 11.
    Randolph Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors. Communications of the ACM, 25(5):336–337, 1982.Google Scholar
  12. 12.
    Katherine Fitch and Naomi Ehrich Leonard. Information centrality and optimal leader selection in noisy networks. In Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on, pages 7510–7515. IEEE, 2013.Google Scholar
  13. 13.
    Fu Lin, Mohammad Fardad, and Mihailo R Jovanovic. Algorithms for leader selection in stochastically forced consensus networks. Automatic Control, IEEE Transactions on, 59(7):1789–1802, 2014.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  • Tarun Biswas
    • 1
    Email author
  • Anjan Kumar Ray
    • 2
  • Pratyay Kuila
    • 1
  • Sangram Ray
    • 1
  1. 1.Department of Computer Science and EngineeringNational Institute of TechnologyRavanglaIndia
  2. 2.Department of Electrical and Electronics EngineeringNational Institute of TechnologyRavanglaIndia

Personalised recommendations