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

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.