2014 • In Was, Jaroslaw; Sirakoulis, Georgios; Bandini, Stefania (Eds.) Cellular Automata: 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014 Krakow, Poland, September 22–25, 2014, Proceedings
[en] In this paper, we propose a novel distributed algorithm based on Graph Cellular Automata (GCA) concept to solve Maximum Lifetime Coverage Problem (MLCP) in Wireless Sensor Networks (WSNs). The proposed algorithm possesses all advantages of localized algorithm, i.e. using only some knowledge about the neighbors, WSN is able to self-organize in such a way to prolong its lifetime preserving at the same time required coverage ratio of a target field. The paper presents results of experimental study of the proposed algorithm and comparison of them with a centralized genetic algorithm.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
Tretyakova, Antonina; Polish-Japanese School
Seredynski, Franciszek; Cardinal Wuzynski University
BOUVRY, Pascal ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
Date de publication/diffusion :
2014
Nom de la manifestation :
ACRI 2014
Date de la manifestation :
from 22-09-2014 to 24-09-2014
Manifestation à portée :
International
Titre de l'ouvrage principal :
Cellular Automata: 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014 Krakow, Poland, September 22–25, 2014, Proceedings
