Skip to content
Open access

Robust Resource Allocation for Distributed Radar Networks Based on Relative Entropy

2026 · IEEE Transactions on Aerospace and Electronic Systems · Vol 62, pp. 18643-18655 · 0 citations · 39 references

Abstract

Distributed multiple-input–multiple-output (MIMO) radar networks offer significant advantages in target detection and jamming through multinode cooperative sensing. However, practical scenarios present various challenges, including limited resources, node redundancy, internode interference, and steering vector mismatch. This article proposes a robust resource allocation framework designed to address these challenges. A unified detection and jamming optimization model is constructed by using relative entropy as the detection index and the signal-to-jamming-plus-noise ratio of the enemy radar to characterize the jamming effect. Binary node selection variables and a cooperative game mechanism are introduced to select the most beneficial radar nodes under a prescribed activation limit. A norm-bounded uncertainty model is further incorporated to formulate a worst-case robust objective against steering vector mismatches. The triple minimization-maximization alternating direction penalty method algorithm proposed in this article efficiently solves the resulting mixed-integer nonconvex problem. This algorithm leverages the minorize-maximization (MM) framework to construct tractable quadratic surrogate functions and jointly updates the transmit waveforms and node selection variables through alternating optimization. Simulation results demonstrate that the proposed design outperforms existing methods in terms of detection performance, interference effectiveness, and resource efficiency, and exhibits robust performance under model mismatch conditions.

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.