An Exact Site Availability Approach to Modeling the D-FAP

The Dynamic Frequency Assignment Problem (D-FAP) was studied in the context of military exercises, where a wireless network is progressively extended to ensure communication between troops. To avoid interferences, every new link between 2 sites (location of antennas) requires the assignment of a pair of frequencies, one for each direction of communication. A greedy on-line strategy, which defines exactly the site availability is proposed. An asynchronous and a synchronous exact strategy are evaluated and compared. Numerical simulations are conducted on realistic scenarios provided by CELAR (CEntre dʹةLectronique de lʹARmement).