Joint transmitter selection and resource management strategy based on low probability of intercept optimization for distributed radar networks

In this paper, a joint transmitter selection and resource management (JTSRM) strategy based on low probability of intercept (LPI) is proposed for target tracking in distributed radar network system. The basis of the JTSRM strategy is to utilize the optimization technique to control transmitting resources of radar networks in order to improve the LPI performance, while guaranteeing a specified target tracking accuracy. The weighted intercept probability and transmit power of radar networks is defined and subsequently employed as the optimization criterion for the JTSRM strategy. The resulting optimization problem is to minimize the LPI performance criterion of radar networks by optimizing the revisit interval, dwell time, transmitter selection, and transmit power subject to a desired target tracking performance and some resource constraints. An efficient and fast three‐step solution technique is also developed to solve this problem. The presented mechanism implements the optimal working parameters based on the feedback information in the tracking recursion cycle in order to improve the LPI performance for radar networks. Numerical simulations are provided to verify the superior performance of the proposed JTSRM strategy

Joint Transmit Resource Management and Waveform Selection Strategy for Target Tracking in Distributed Phased Array Radar Network

In this paper, a joint transmit resource management and waveform selection (JTRMWS) strategy is put forward for target tracking in distributed phased array radar network. We establish the problem of joint transmit resource and waveform optimization as a dual-objective optimization model. The key idea of the proposed JTRMWS scheme is to utilize the optimization technique to collaboratively coordinate the transmit power, dwell time, waveform bandwidth, and pulse length of each radar node in order to improve the target tracking accuracy and low probability of intercept (LPI) performance of distributed phased array radar network, subject to the illumination resource budgets and waveform library limitation. The analytical expressions for the predicted Bayesian Cram\'{e}r-Rao lower bound (BCRLB) and the probability of intercept are calculated and subsequently adopted as the metric functions to evaluate the target tracking accuracy and LPI performance, respectively. It is shown that the JTRMWS problem is a non-linear and non-convex optimization problem, where the above four adaptable parameters are all coupled in the objective functions and constraints. Combined with the particle swarm optimization (PSO) algorithm, an efficient and fast three-stage-based solution technique is developed to deal with the resulting problem. Simulation results are provided to verify the effectiveness and superiority of the proposed JTRMWS algorithm compared with other state-of-the-art benchmarks

Joint Route Optimization and Multidimensional Resource Management Scheme for Airborne Radar Network in Target Tracking Application

In this article, we investigate the problem of joint route optimization and multidimensional resource management (JRO-MDRM) for an airborne radar network in target tracking application. The mechanism of the proposed JRO-MDRM scheme is to adopt the optimization technique to collaboratively design the flight route, transmit power, dwell time, waveform bandwidth, and pulselength of each airborne radar node subject to the system kinematic limitations and several resource budgets, with the aim of simultaneously enhancing the target tracking accuracy and low probability of intercept (LPI) performance of the overall system. The predicted Bayesian Cramér–Rao lower bound and the probability of intercept are calculated and employed as the metrics to gauge the target tracking performance and LPI performance, respectively. It is shown that the resulting optimization problem is nonlinear and nonconvex, and the corresponding working parameters are coupled in both objective functions, which is generally intractable. By incorporating the particle swarm optimization and cyclic minimization approaches, an efficient four-step solution algorithm is proposed to deal with the above problem. Extensive numerical results are provided to demonstrate the correctness and advantages of our developed scheme compared with other existing benchmarks

Novel Power Control Scheme for Target Tracking in Radar Network with Passive Cooperation

Distributed radar network systems (DRNS) have been shown to provide significant performance improvement. With the recent development, radar network has become an attractive platform for target tracking. In practice, the netted radars in DRNS are supposed to maximize their transmitting power to achieve better target tracking performance, which may be in contradiction with low probability of intercept (LPI). This paper investigates the problem of adaptive resource scheduling based on time difference of arrival (TDOA) cooperation for target tracking by DRNS consisting of a dedicated radar netting station and multiple netted radars. Firstly, the standard interacting multiple model (IMM) algorithm incorporating extended Kalman filter (EKF) is improved by modifying the Markov transition probability with current measurements. Then, a novel resource scheduling strategy based on TDOA cooperation is presented, in which the LPI perfor¬mance for target tracking in DRNS is improved by optimiz¬ing the radar revisit interval and the transmitted power for a predefined target tracking accuracy. The comparison of the predictive error covariance matrix and the expected error covariance matrix is utilized to control the radar netting station under intermittent-working state with TDOA cooperation. Due to the lack of analytical closed-form expression for receiver operating characteristics (ROC), we utilize several popular information-theoretic criteria, namely, Bhattacharyya distance, Kullback-Leibler (KL) divergence, J-divergence, and mutual information (MI) as the metrics for target detection performance in target tracking process. The resulting optimization problems which are associated with different information-theoretic criteria are unified under a common framework. The non¬linear programming (NP) based genetic algorithm (GA) or else known as NPGA is employed to encounter with the highly nonconvex and nonlinear optimization problems in the framework. Numerical results demonstrate that the proposed algorithm not only has excellent target tracking accuracy, but also has better LPI performance comparing to other methods

Collaborative Trajectory Planning and Resource Allocation for Multi-Target Tracking in Airborne Radar Networks under Spectral Coexistence

This paper develops a collaborative trajectory planning and resource allocation (CTPRA) strategy for multi-target tracking (MTT) in a spectral coexistence environment utilizing airborne radar networks. The key mechanism of the proposed strategy is to jointly design the flight trajectory and optimize the radar assignment, transmit power, dwell time, and signal effective bandwidth allocation of multiple airborne radars, aiming to enhance the MTT performance under the constraints of the tolerable threshold of interference energy, platform kinematic limitations, and given illumination resource budgets. The closed-form expression for the Bayesian Cramér–Rao lower bound (BCRLB) under the consideration of spectral coexistence is calculated and adopted as the optimization criterion of the CTPRA strategy. It is shown that the formulated CTPRA problem is a mixed-integer programming, non-linear, non-convex optimization model owing to its highly coupled Boolean and continuous parameters. By incorporating semi-definite programming (SDP), particle swarm optimization (PSO), and the cyclic minimization technique, an iterative four-stage solution methodology is proposed to tackle the formulated optimization problem efficiently. The numerical results validate the effectiveness and the MTT performance improvement of the proposed CTPRA strategy in comparison with other benchmarks

Interval Algebra - an effective means of scheduling surveillance radar networks

Interval Algebra provides an effective means to schedule surveillance radar networks, as it is a temporal ordering constraint language. Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion Information Group model of information fusion. In this paper, the use of Interval Algebra to schedule mechanically steered radars to make multistatic measurements for selected targets of importance is shown. Interval Algebra provides a framework for incorporating a richer set of requirements, without requiring modi cations to the underlying algorithms. The performance of Interval Algebra was compared to that of the Greedy Randomised Adaptive Search Procedure and the applicability of Interval Algebra to nimble scheduling was investigated using Monte-Carlo simulations of a binary radar system. The comparison was done in terms of actual performance as well as in terms of computation time required. The performance of the algorithms was quanti ed by keeping track of the number of targets that could be measured simultaneously. It was found that nimble scheduling is important where the targets are moving fast enough to rapidly change the recognised surveillance picture during a scan. Two novel approaches for implementing Interval Algebra for scheduling surveillance radars are presented. It was found that adding targets on the y and improving performance by incrementally growing the network is more e cient than pre-creating the full network. The second approach stemmed from constraint ordering. It was found that for simple constraint sets, the Interval Algebra relationship matrix reduces to a single vector of interval sets. The simulations revealed that an Interval Algebra algorithm that utilises both approaches can perform as well as the Greedy Randomised Adaptive Search Procedure with similar processing time requirements. Finally, it was found that nimble scheduling is not required for surveillance radar networks where ballistic and supersonic targets can be ignored. Nevertheless, Interval Algebra can easily be used to perform nimble scheduling with little modi - cation and may be useful in scheduling the scans of multifunction radars.Council for Scientific and Industrial Research, the University of Cape Town and the University of Pretoria.http://www.elsevier.com/locate/inffushb201

Electronic Warfare Receiver Resource Management and Optimization

Optimization of electronic warfare (EW) receiver scan strategies is critical to improving the probability of surviving military missions in hostile environments. The problem is that the limited understanding of how dynamic variations in radar and EW receiver characteristics has influenced the response time to detect enemy threats. The dependent variable was the EW receiver response time and the 4 independent variables were EW receiver revisit interval, EW receiver dwell time, radar scan time, and radar illumination time. Previous researchers have not explained how dynamic variations of independent variables affected response time. The purpose of this experimental study was to develop a model to understand how dynamic variations of the independent variables influenced response time. Queuing theory provided the theoretical foundation for the study using Little\u27s formula to determine the ideal EW receiver revisit interval as it states the mathematical relationship among the variables. Findings from a simulation that produced 17,000 data points indicated that Little\u27s formula was valid for use in EW receivers. Findings also demonstrated that variation of the independent variables had a small but statistically significant effect on the average response time. The most significant finding was the sensitivity in the variance of response time given minor differences of the test conditions, which can lead to unexpectedly long response times. Military users and designers of EW systems benefit most from this study by optimizing system response time, thus improving survivability. Additionally, this research demonstrated a method that may improve EW product development times and reduce the cost to taxpayers through more efficient test and evaluation techniques