CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Efficient Cellular Automata based Leader Election Scheme

by Monalisa Dey, Prasenjit Dey
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 10
Year of Publication: 2012
Authors: Monalisa Dey, Prasenjit Dey
10.5120/9322-3555

Monalisa Dey, Prasenjit Dey . An Efficient Cellular Automata based Leader Election Scheme. International Journal of Computer Applications. 58, 10 ( November 2012), 41-46. DOI=10.5120/9322-3555

@article{ 10.5120/9322-3555,
author = { Monalisa Dey, Prasenjit Dey },
title = { An Efficient Cellular Automata based Leader Election Scheme },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 10 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 41-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number10/9322-3555/ },
doi = { 10.5120/9322-3555 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:02:08.680882+05:30
%A Monalisa Dey
%A Prasenjit Dey
%T An Efficient Cellular Automata based Leader Election Scheme
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 10
%P 41-46
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. P. K. Sinha, Distributed Operating Systems Concepts and Design, Prentice-Hall of India Private Ltd. , March 2002
  2. G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems Concepts and Design, Pearson Education, 2003
  3. Ernest Chang and Rosemary Roberts, "An improved algorithm for decentralized extrema-finding in circular configurations of processes," Commun. ACM, vol. 22, pp. 281-283, May 1979.
  4. Kalyan Mahata, Meghnath Saha, and Sukanta Das, "Cellular Automata Based Coordinator Selection Scheme in Distributed System," in Proceedings of CSC, 2009, pp. 304-310, 2009
Index Terms

Computer Science
Information Sciences

Keywords

Distributed systems cellular automata

Powered by PhDFocusTM