Node placement optimization under K-Coverage and K-Connectivity constraints in wireless sensor networks

Many wireless sensor networks (WSNs) need to cover targets in their sensor fields and ensure connectivity and fault tolerance to the base station. This is a challenging task when planning the network deployment. Sensors can help extend lifetime but also need to be well positioned to be effectively used. This paper seeks to design an efficient node localization scheme while meeting the requirements of the target coverage and connectivity in the network. The problem is approached in two phases. The first phase solves the K-Coverage constraint, which is a metric closely related to lifetime, using two novel heuristic methods named KGCA and IKGCA. The second phase ensures the connection to the base station using a modified version of Dijkstra algorithm. Experimental results show notable improvements in solution quality and running time for the proposed approaches compared to an existing approach to the problem,