LPI optimization framework for search radar network based on information fusion

This paper addresses the problem of joint power management and radar assignment to detect multiple targets in surveillance region for a distributed mono-static radar network while a low probability of interception (LPI) has been attained. Based on detection probabilities and target location estimates, the targeted problem is formulated as a combinatorial non-convex optimization problem which needs exhaustive search through all assignment schemes to reach optimal solution. Due to NP-hardness and non-convexity of the problem, some relaxations are proposed to transform the problem to a more tractable form. The main problem can be considered from two viewpoints, without information fusion and with information fusion. As another relaxation, we separated power allocation from radar assignments through two sub-problems in which first, the optimum power allocation is obtained for each assignment scheme and second, the target assignment schemes are selected based on the allocated powers. Simulation results show that our proposed algorithms not only guarantee detection performances but also considerably improve LPI specification in comparison with benchmark algorithms.