An Efficient Cellular Automata based Leader Election Scheme | Zendy

Monalisa Dey | Zendy; Prasenjit Dey | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Cellular Automata based Leader Election Scheme

Author(s) -

Monalisa Dey,

Prasenjit Dey

Publication year - 2012

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/9322-3555

Subject(s) - computer science , scheme (mathematics) , cellular automaton , automaton , theoretical computer science , algorithm , mathematics , mathematical analysis

This work 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research