In this paper, a quality of service (QoS) based cooperative sensor selection and dwell allocation (CSDA) strategy for maneuvering targets tracking (MTT) in airborne radar sensor network (ARSN) is proposed, which aims to ensure the scaled desired tracking accuracy while saving the resource consumption as much as possible. The intrinsic mechanism of the developed CSDA strategy is to optimize the sensor-target assignment and the dwell time allocation jointly subject to several physical limitations. More precisely, the QoS based CSDA strategy is constructed as a mathematic optimization problem model to achieve the scaled tracking accuracy of each target, and the posterior Cramér-Rao lower bound (PCRLB) is employed to characterize the tracking performance. For tackling the established nonconvex problem model, an efficient two-stage solution method incorporating the convex relaxation and the heuristic fine tuning method is developed. Some numerical results are offered to demonstrate the effectiveness of the developed CSDA strategy.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quality of Service Based Cooperative Sensor Selection and Dwell Allocation for Targets Tracking with Airborne Radar Sensor Network

  • Yang Su,
  • Shengnan Shi

摘要

In this paper, a quality of service (QoS) based cooperative sensor selection and dwell allocation (CSDA) strategy for maneuvering targets tracking (MTT) in airborne radar sensor network (ARSN) is proposed, which aims to ensure the scaled desired tracking accuracy while saving the resource consumption as much as possible. The intrinsic mechanism of the developed CSDA strategy is to optimize the sensor-target assignment and the dwell time allocation jointly subject to several physical limitations. More precisely, the QoS based CSDA strategy is constructed as a mathematic optimization problem model to achieve the scaled tracking accuracy of each target, and the posterior Cramér-Rao lower bound (PCRLB) is employed to characterize the tracking performance. For tackling the established nonconvex problem model, an efficient two-stage solution method incorporating the convex relaxation and the heuristic fine tuning method is developed. Some numerical results are offered to demonstrate the effectiveness of the developed CSDA strategy.