A deterministic deployment approach of nodes in wireless sensor networks for target coverage

In wireless sensor networks, since the existing method of dividing sensors based on the random deployment of nodes can not guarantee the optimal deployment to target coverage, an optimal deterministic deployment approach of sensor nodes is proposed by using the maximum multi-overlapping domains of target points and the genetic algorithm. Candidate positions where nodes will be placed to cover the target set are calculated using the concept of the maximum multi-overlapping domains of target points, and the genetic algorithm is used to find the least number of nodes to cover the target set and the optimal positions of these nodes from the candidate node positions. The determination of candidate positions simplifies the coding of the genetic algorithm, and accelerates the convergence of the algorithm by combining the effective fitness function. The genetic algorithm provides a way to find the optimal positions. Simulation results show that the proposed approach uses the least number of nodes for deployment, which is usually less than 30% of the number of target points, and guarantees users' sense demand, and that the network deployment cost is significantly reduced. The optimal allocation of space resources is realized in wireless sensor networks.