An Efficient Cellular Automata Based Leader Election Scheme

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.

Provided by: International Journal of Computer Applications Topic: Data Management Date Added: Nov 2012 Format: PDF

Find By Topic