Sensor Deployment Optimization Methods to Achieve Both Coverage and Connectivity in Wireless Sensor Networks
Computers & Operations Research
Abstract In this study, we aim to cover a sensing area by deploying a minimum number of wireless sensors while maintaining the connectivity between the deployed sensors. The problem may be reduced to a 2-dimensional critical coverage problem which is an NP-Complete problem. We develop an integer linear programming model to solve the problem optimally. We also propose a local search algorithm (LS) and a genetic algorithm (GA) as approximate methods. We verify by computational experiments that the integer linear model, using Cplex, is able to provide an optimal solution of all our small and medium size problems. We also show that the proposed methods outperforms some regular sensor deployment patterns.