Minimum Cost Deployment of Bistatic Radar Sensors for Perimeter Barrier Coverage of Critical Square Grids

In applications of wireless sensor networks, barrier coverage is an important coverage problem that monitors a boundary to detect intruders. Bistatic radar sensors are widely discussed and applied in barrier coverage for reducing deployment cost. In previous works, how to efficiently use bistatic radar sensors to provide a barrier coverage for the perimeter of a continuous area is widely studied. However, in reality, the monitored area may be not continuous, that is, there exist multiple disjoint areas that are required to be surrounded by bistatic radar sensors. In this paper, we study how to deploy bistatic radar sensors with minimum cost to provide a full perimeter barrier coverage of a given critical square grids, termed the Minimum Cost Perimeter Barrier Coverage (MCPBC) problem. We first propose functions used to determine the perimeter barriers with minimum total length. We then indicate the optimal sequence of bistatic radar sensors with the given technical parameters and the cost of radar sensors. Eventually, based on the determined perimeter barriers and the optimal sequence of bistatic radar sensors, the Perimeter-Minimization-Based-Algorithm, termed the PMBA, is proposed for the MCPBC problem. Simulation results demonstrate that the PMBA provides a significantly lower deployment cost than existing solutions.