Graph-Based Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks

In this paper, we propose a novel localized algorithm based on Graph Cellular Automata concept to solve Maximum Lifetime Coverage Problem (MLCP) in Wireless Sensor Networks (WSNs). The proposed algorithm possesses all advantages of localized algorithm, i.e. based only on some knowledge about the neighbors, WSN can be reorganized preserving required coverage ratio and prolonging lifetime of the WSN. The paper presents results of experimental study of the proposed algorithm and comparison with recently proposed centralized evolutionary algorithms [1]. The first simulation results show that the proposed algorithm in some cases achieves the same results as centralized algorithm in terms of Lifetime(q) metric presented recently in [2] and [3].