Semi-Deterministic Deployment based Area Coverage Optimization in Mobile WSN

Both minimal set cover and maximum 1-coverage are known to be NP-Hard when using homogeneous and heterogeneous wireless sensor networks. The proposed solutions in the literature guaranteeing k-coverage in WSN affect either the energy, the network lifetime, or the quality of service. These solutions still incur time complexity and energy overhead that increase with WSN large-scale, connectivity and size of coverage holes. To avoid these issues, this paper proposes a minimal semi-deterministic deployment model in a mobile wireless sensor network. This model is based on Pick's theorem to guarantee a maximum 1-coverage. This requires the subdivision of the area of interest into square sub-areas according to a pre-established grid, and then an initial deployment of sensor nodes randomly around each sub-area center. The main strengthen of the proposed deployment approach is the minimization of the nodes' movement from their initial positions. Where, each node moves once and remains active until it is exhausted. The results show a high efficiency in terms of increasing the network lifetime and the coverage compared to some well-known approaches.