| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652705 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
