Linear models for the total coverage problem in wireless sensor networks

In this paper, we consider the total grid coverage problem in wireless sensor networks. Our proposal aims to determine the optimal number of sensors and their positions in a sensing area represented by a grid. The deployed sensors should achieve the total grid point coverage. The problem is proved NP-complete in [15]. We propose two mathematical linear models to solve optimally two problem cases. In the first case, the connectivity between deployed sensors is not required. However, in the second case, the sensors should communicate with each other. Computational experiments are generated on different grid sizes and multiple sensor ranges. The results show that the proposed linear models can produce appropriate solutions for the two problem cases.