Dynamic frequency management and electromagnetic interference deconfliction for mobile units executing unplanned maneuvers

We consider the problem of dynamic frequency management in a military mobile communications network focusing on the case where maneuvers of mobile units deviate from pre-mission plans. The dynamic frequency management problem is NP-hard which motivates the development of suboptimal algorithms that provide good solutions and are yet computationally efficient. We propose two algorithms that utilize dynamic graph coloring techniques to manage frequency assignments in a dynamic manner. Our algorithms address four conflicting objectives: (1) eliminate interference in real-time, (2) minimize the number of frequency reassignments required, (3) minimize the total number of frequency bands required at any time, and (4) maximize computational efficiency. The first algorithm is a rule-based myopic algorithm whereas the second algorithm is a non-myopic (look-ahead) algorithm that uses information on predicted network state. Simulation results show that the proposed algorithms combined with different initialization schemes provide excellent solutions that offer various system tradeoffs in terms of the aforementioned objectives for the network system manager.