A new approach of leader election in distributed system

In distributed computing field, there are many challenges, and one of them is leader election in distributed system. It is really tough task to find suitable and efficient algorithms for leader election. The main role of an elected leader is that it performs a centralized coordination after being selected and manages the use of a shared resource in an optimal manner. Whenever a failure occurs the new leader is elected by nodes using various algorithms so that nodes can continue working. In this paper, the proposal is a new approach, the improved heap tree mechanism for electing the coordinator. The higher efficiency and better performance in the presented algorithms with respect to the existing algorithms is validated through results.