K-coverage based receiver placement optimisation in passive radar network

Abstract

In passive radar network (PRN), the receiver placement optimisation which has the ability to improve the coverage performance attracts much attention recently. In this study, the K-coverage performance is considered since the pre-condition of deghosting in a radar network is that the target has to be covered by [inline-formula] bistatic pairs. Thus, a K-coverage-based receiver placement optimisation is formulated, in which a weighted M-centre model and the required radar cross section (RCS) for target detection are involved. Moreover, in order to solve this high dimensional optimisation problem, an iterative method which is based on K-order Voronoi algorithm and neighbourood search is proposed. Finally, the proposed method shows its effectiveness in solving the K-coverage optimisation problem of PRN via simulations. Specially, the probability of K-coverage is up to 99.8% with the optimal placement.

Keywords

• object detection
• radar receivers
• computational geometry
• probability
• passive radar
• optimisation
• iterative methods
• radar cross-sections
• radar signal processing
• coverage performance
• high dimensional optimisation problem
• passive radar network
• K-coverage based receiver placement optimisation
• K-order Voronoi algorithm
• target detection
• iterative method