Skip to Main Content
In this paper, we tackle the wireless sensor network (WSN) planning problem considering coverage, target localization and network connectivity constraints. First, a combinatorial optimization model is proposed for this problem and next, a starting greedy heuristic is proposed followed by a tabu search metaheuristic to find “good” feasible solutions rapidly. The solutions are compared to the optimal solutions found using CPLEX. The test results show the proposed approach finds good quality solutions.