一种基于贪心算法的雷达网通信资源调度策略  

A Resource Scheduling Strategy in Communication of Radar Networking Based on Greedy Algorithm

作　　者：田钢[1] 汪晋[1] 董扬[1] 朱军[1] TIAN Gang;WANG Jin;DONG Yang;ZHU Jun(Nanjing Research Institute of Electronics Technology,Nanjing 210039,China)

机构地区：[1]南京电子技术研究所,南京210039

出　　处：《现代雷达》2021年第4期46-51,共6页Modern Radar

摘　　要：针对组网雷达探测通信一体化的需求,从适应组网雷达通信拓扑时变和时间资源动态优化角度出发,提出了一种基于贪心算法的雷达组网通信资源调度策略。该方法建立了一种基于雷达时分通信的矩阵拓扑模型,用于实现通信节点应答冲突的预判与规避,同时根据通信矩阵拓扑特征,以最大时间资源节省为目标构建了贪心策略,获得了优化的时间资源调度方案。通过仿真分析表明,文中方法可有效解决组网雷达因通信时长和节点数量动态变化引起的资源规划问题,有效降低雷达时间资源消耗。In order to meet the demand of integration of radar detection and communication,a communication network resource scheduling method based on greedy algorithm is proposed to adapt to the time-varying communication topology and dynamic optimization of time resources.This method establishes a matrix topology model based on time division communication of radar,which is used to predict and avoid the communication node′s response conflict.Meanwhile,according to the topology characteristics of communication matrix,greedy strategy is constructed to maximize resource saving,and the optimal resource scheduling scheme is obtained.The simulation results show that this method can effectively solve the resource planning problem caused by the dynamic change of communication time and node number,and effectively reduce the time resource consumption of radar.

关 键 词：雷达组网 探测通信一体化 资源规划 贪心算法 

分 类 号：TN957.2[电子电信—信号与信息处理]