Optimal Placement for Barrier Coverage in Bistatic Radar Sensor Networks

By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much attention has been given to multistatic and multiple-input-multiple-output (MIMO) radar concepts, little has been paid to understanding radar networks (i. e., multiple individual radars working in concert). In this context, we study the coverage problem of a bistatic radar (BR) sensor network, which is very challenging due to the Cassini oval sensing region of a BR and the coupling of sensing regions across different BRs. In particular, we consider the problem of deploying a network of BRs in a region to maximize the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that it is optimal to place BRs on the shortest barrier if it is the shortest line segment that connects the left and right boundary of the region. Based on this, we study the optimal placement of BRs on a line segment to minimize its vulnerability, which is a nonconvex optimization problem. By exploiting certain specific structural properties pertaining to the problem (particularly an important structure of detectability), we characterize the optimal placement order and the optimal placement spacing of the BR nodes, both of which present elegant balanced structures. Our findings provide valuable insights into the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the barrier coverage of a network of BRs.