Location based coordinator election algorithm in distributed environment

In distributed computing, a task is divided into subtasks and each task is processed by one of the computers available in the network. These computers communicate with each other through message passing. Also, it is necessary to achieve synchronization between these multiple nodes. In order to achieve the same and coordination, there is a need of coordinator node also known as leader node. Now, to elect node we have several algorithms proposed by various researchers and over the past years several changes have been take place over these algorithms to optimize the algorithmic complexity (in term of time, number of messages and robustness). In this paper we propose a location and priority based approach to select the coordinator node among diverse nodes present in a distributed environment. Based on our experimental results, the proposed approach reduces the network traffic by reducing number of messages in the network. Furthermore, this approach is justified by comparing it with previously proposed election algorithms with respect to the number of messages passed for election process.