Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks

Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.