Graph Cellular Automata approach to the Maximum Lifetime Coverage Problem in wireless sensor networks

Abstract

In this paper, we propose a distributed algorithm based on a generalization of the Cellular Automata concept called Graph Cellular Automata (GCA) to solve the Maximum Lifetime Coverage Problem (MLCP) in wireless sensor networks (WSNs). In GCA, we adapt life-like state transition functions inspired by Conway’s Game of Life in order to solve the problem. The goal of this paper is to study the quality of state transition functions for an objective provided by the MLCP in WSNs. The proposed algorithm possesses all the advantages of a localized algorithm, i.e., using only some knowledge about neighbors, a WSN is able to self-organize in such a way as to prolong its lifetime, at the same time preserving the required coverage ratio of the target field. Our experimental results show that certain rules are better solvers of the given problem than others. The paper also presents the results of an experimental study of the proposed algorithm and comparison with a centralized Genetic Algorithm.