Online Interleaving Task Scheduling for Digital Array Radar

doi:10.3969/j.issn.0372-2112.2019.06.011

您当前的位置：

首页 >

文章列表页 >

Online Interleaving Task Scheduling for Digital Array Radar

更新时间：2025-07-02

- Online Interleaving Task Scheduling for Digital Array Radar
- Acta Electronica Sinica Vol. 47, Issue 6, Pages: 1260-1266(2019)
- 作者机构：
  
  1. 空军工程大学防空反导学院,陕西,西安,710051
  2. 94873部队,福建,福州,350315
  3. 94710部队,江苏,无锡,214000
  4. 95899部队,北京,100085
  5. 空军工程大学防空反导学院,陕西,西安,710051
  6. 94873部队,福建,福州,350315
  7. 94710部队,江苏,无锡,214000
  8. 95899部队,北京,100085
- 作者简介：
- 基金信息：
  
  Youth Fund of National Natural Science Foundation of China (No.61503408)
- DOI：10.3969/j.issn.0372-2112.2019.06.011
  CLC： TN954.2
- Published：2019
- 稿件说明：
移动端阅览
Online Interleaving Task Scheduling for Digital Array Radar[J]. Acta Electronica Sinica, 2019, 47(6): 1260-1266.
DOI：

Online Interleaving Task Scheduling for Digital Array Radar[J]. Acta Electronica Sinica, 2019, 47(6): 1260-1266. DOI： 10.3969/j.issn.0372-2112.2019.06.011.

摘要

传统相控阵雷达中的调度算法难以充分发挥数字阵列雷达的多功能优势.针对这一问题，结合数字阵列雷达的任务结构，提出一种在线交错调度算法.通过将交错调度分析分解为时间资源约束分析和能量资源约束分析，算法能够对所有满足约束的任务进行交错调度：利用任务中的等待期来交错执行其它任务的发射期或接收期，并且不同任务的接收期可实现相互交叠.仿真结果表明，由于雷达任务中等待期和接收期得到充分利用，相比于三种传统的调度算法，所提算法的调度成功率、实现价值率和时间利用率均得到有效提升.

Abstract

Traditional scheduling algorithms in the phased array radar cannot be utilized to fully release multi-function potential of digital array radar.Aiming at this problem

an online interleaving scheduling algorithm is proposed on the basis of the task internal structure.By decomposing the interleaving scheduling analysis into the time resource constraint analysis and the energy resource constraint analysis

the algorithm is able to interleave all kinds of tasks as far as they meet the resource constraints.Thereby not only the waiting duration is utilized to execute other task's transmitting duration or receiving duration

but also receiving durations of different tasks are able to be overlapped.The simulation results show that

due to the efficient usage of the waiting duration and the receiving duration

the proposed algorithm effectively improves the successful scheduling ratio

the high value ratio and the time utilization ratio compared with the three existing algorithms.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Task Segmentation and Path Optimization in Heterogeneous Cloud-Edge-End Computing Power Network

Task Scheduling Algorithm Based on Dynamic Potential Game for Edge Compute First Networking

A Dynamic Task Scheduling for Wireless Sensor and Actuator Networks

Related Author

CHENG Ting

HE Zi-shu

LI Hui-yong

LI Chuan-huang

MA Bo

YU Ying-jie

WU Sha-chen

NI Chang

Related Institution

Dept.of Electronic Engineering,University of Electronics Science and Technology of China

School of Information and Electronic Engineering, Zhejiang Gongshang University

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

State Key Laboratory for Novel Software Technology at Nanjing UniversityNanjingJiangsu 210093China

College of ComputerNanjing University of Posts and TelecommunicationsNanjingJiangsu 210003China

⁰