Main Article Content

Md. Navid Bin Anwar
Afroza Nahar
Nashid Kamal Md.
Mehedi Hasan Shuvo


In distributed systems, a single node (referred to as a leader) coordinates all other nodes to ensure synchronization. If this node fails, another node in the system must adopt the role of leader. The classic bully algorithm suffers from some significant drawbacks, such as excessive message passing, a redundant number of election calls, and uncertainties over message delivery. The enhanced bully algorithm is one of the most recent improvements of this algorithm. However, this algorithm performs poorly in average- and worst-case scenarios. In this paper, a novel waiting time-based algorithm is proposed to improve the enhanced bully algorithm for electing a new leader during such critical scenarios. In this algorithm, if a single or multiple number of nodes discover that the leader has failed, it does not broadcast instantly. Rather, it waits for a certain period, and this waiting time is assigned to the nodes according to their load. After the timeout, the node sends its message and starts the election process. Moreover, it restricts nodes from unnecessary message passing and stops any redundant election calls. Accordingly, this algorithm detects the failure of the leader node more precisely and elects a new leader more quickly.


Download data is not yet available.

Article Details

How to Cite
Md. Navid Bin Anwar, Nahar, A., Nashid Kamal Md., & Mehedi Hasan Shuvo. (2022). A WAITING TIME-BASED BULLY ALGORITHM FOR LEADER NODE SELECTION IN DISTRIBUTED SYSTEMS. Malaysian Journal of Science, 41(3), 38–43. https://doi.org/10.22452/mjs.vol41no3.5
Original Articles


Amit B., Animesh D. (2016). A Timer Based Leader Election Algorithm, IEEE Conference.

Balmukund M., Ninni S. & Ravideep S. (2014). Master-Slave Group Based Model For Co-Ordinator Selection, An Improvement of Bully Algorithm, International Conference on Parallel, Distributed and Grid Computing, Solan, 457-460,

Beaulah SP, Thriveni J, Venugopal, K., & Patnaik LM (2013). An improved leader election algorithm for distributed systems, International Journal of Next-Generation Networks (IJNGN). 5(1): 21-29.

Garcia-Molina H, (1982). Elections in distributed computing system. IEEE Transaction on Computer C-31:48-59.

Kordafshari MS, Gholipour M., Jahanshahi M. & Haghighat AT. (2005) Modified Bully Election Algorithm in Distributed Systems. WSEAS International Conference on Computers.

Kordafshari, MS. M. Gholipour, Jahanshahi M. & Haghighat AT. (2005). Two novel algorithms for electing coordinator in distributed systems based on bully algorithm, the fourth WSEAS International Conference on Software Engineering, Parallel and Distributed Systems.

Mamun QH, Masum SH & Mustfa MA. (2017). Modified bully algorithm for electing coordinator in distributed systems, in Proc. 3rd WSEAS International Conference on Software Engineering, Parallel and Distributed Systems :22-28.

Minhaj K., Neha Agarwal & Jeeshan AK. (2017). An Enhanced Bully Algorithm for Electing a Coordinator in Distributed Systems. International Journal on Recent and Innovation Trends in Computing and Communication 5(5): 1092-1097.

Rahman M. & Nahar A. (2009). Modified Bully Algorithm using Election Commission. MASAUM Journal of Computing 1(3): 439-446,

Sathesh BM. (2015). Optimized Bully Algorithm. International. Journal of Computer Application. 121(18): 0975 – 8887.