Cellular automata rules solving the wireless sensor network coverage problem

Abstract The problem of an optimal coverage a wireless sensor network area is considered. To solve this problem, Cellular Automata (CA) approach proposed. More specifically, the objective to find CA rules which are able cover 2D space by minimum number so–called “Sensor Tiles”. A tile consists von Neumann neighborhood range 2 centered at “point” and surrounded 12 sensing “pixels”. Two probabilistic were designed that can perform task. Results experimental study show first rule evolves very fast stable sub-optimal coverings, starting from random configuration. second finds however it needs much more time for their evolution. results supported theoretical on neighborhoods borrowing either heuristics or spectral theory circulant graphs.