Abstract—In distributed system environment like human life environment we need a manager to coordinate the job of all processes. We call this process as a Leader. The problem occurs when the coordinator process fails; so that these processes must work together in order to elect a leader. There is many algorithms discussed leader’s election such as bully algorithm and modified bully algorithm. In our paper we will propose a new election algorithm to solve leader failure. The proposed algorithm is based on using successor (Vice coordinator (leader)) in order to reduce massage passing and time complicity and overcome the disadvantages and limitations of previous algorithms

Index Terms—bully algorithms, coordinator, election massage, ok massages.

Cite: Basim Alhadidi, Laith H.Baniata, Mohammad H.Baniata, and Mohammad Al-Sharaiah, "Reducing Massage Passing and Time Complexity in Bully Election Algorithms Using Two Successors," International Journal of Electronics and Electrical Engineering, Vol. 1, No. 1, pp. 1-4, March 2013. doi: 10.12720/ijeee.1.1.1-4