Dynamic Frequency Assignment Method on the Battlefield with Complex Interference Constraints

The dynamic frequency assignment problem (FAP) is an inevitable research topic in future wars. In this paper, we model the dynamic FAP as a combinatorial optimization problem. We divide the dynamic FAP into two phases and present a method to solve the problem in a tactical wireless communication network. Then based on the simulated annealing algorithm (SA) and the greedy algorithm, we propose an algorithm that optimizes the neighborhood search space, thus facilitating the generation of new solutions and the process of frequency adjustment. The improvement reduces the frequency number and cuts the influence of interference. The simulation results show that the improved method can solve the dynamic FAP on the battlefield, leading to a better assignment result than the general SA.