Date Added: Nov 2012
This paper reports an efficient scheme of electing a leader, in a fully connected distributed system, having n number of nodes. In the proposed scheme, the system state is modeled using Cellular Automata. Each node is initialized with status information. This information has to be maintained by the nodes at all times so that they are aware of the current working coordinator in the system. The proposed scheme requires only O(n) messages for decision making.