Frequency assignment in radio networks.

摘要

In our paper we discuss the frequency assignment problem for cellular networks. Many methods and ways have been proposed for solving this problem like neural networks, genetic algorithms, evolutionary approach, local search and integer programming. We approach the problem using a variant of graph coloring. In this method we represent a cellular network using a graph and try to color those graph nodes using minimum number of colors. Colors in graph coloring represent the frequencies used by a cellular network. In this thesis we discuss L(1), L(1,1), L(2,1), L(1,1,1) and L(2,1,1) graph coloring scenarios known from literature and propose a graph coloring function for L(3,1,1).