Redeployment Problem for Wireless Sensor Networks

One of the main design issues for wireless sensor networks (WSNs) is the sensor deployment problem. This paper mainly studies the redeployment problem for WSNs, that is, when there have been some sensor nodes (called source node) in the deployment region, how to maximize the source nodes and minimize new deployed nodes. We formulate the problem as a 0-1 programming model. Some heuristic algorithms based on the redeployment models are developed to solve the problem. At last we derive the sufficient and necessary condition that all the source nodes can be utilized. The experimental results show that the proposed methods are very effective, scalable and robust.