Publikace na Matematicko-fyzikální fakulta |
2011
Abstrakt
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells.
In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well.
The objective is to minimize the total number of used frequencies.