Reference : Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Ne...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/30198
Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
English
Tretyakova, Antonina mailto [Polish-Japanese School]
Seredynski, Franciszek mailto [Cardinal Wuzynski University]
Bouvry, Pascal mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2014
Cellular Automata: 11th International Conference on Cellular Automata for Research and Industry, ACRI 2014 Krakow, Poland, September 22–25, 2014, Proceedings
Was, Jaroslaw
Sirakoulis, Georgios
Bandini, Stefania
Springer
LCNS 8751
437-446
Yes
No
International
978-3-319-11519-1
ACRI 2014
from 22-09-2014 to 24-09-2014
Krakow
[en] Coverage control ; UAV ; Cellular Automata
[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.
http://hdl.handle.net/10993/30198
10.1007/978-3-319-11520-7_45

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
CA.pdfPublisher postprint500.33 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.