Dwell Time Allocation for Decentralized Phased Array Radar Sensing Networks with Target Tracking

This paper proposes a parallel strategy-based dwell time allocation method for a decentralized phased array radar sensing network (PA-RSN) for target tracking. Firstly, the dwell time allocation of PA-RSN is formulated as an optimization problem that aims to maximize the overall tracking utility. To make the solution applicable to PA-RSN, the utility function is approximated as a linear combination of multiple local utility functions, allowing for the update of them at each radar without fusion center. Upon reaching a consensus through a sufficient number of iterations, a global solution to the optimization problem is achieved. Numerical simulations verify the effectiveness of the proposed approach in a decentralized PA-RSN.

I. Introduction

Radar sensing networks (RSNs) have demonstrated en-hanced performance in sensing applications, including target detection [1], localization [2], [3], and tracking [4], [5], by leveraging geographically distributed nodes. Given the limited transmit resources of RSN s, effectively allocating these resources to improve performance is critical. Traditional RSN resource allocation methods use a centralized approach, where a fusion center computes and distributes parameters. While optimal, this method requires high communication bandwidth and is vulnerable to fusion center failures.