Static Frequency Assignment in Cellular Networks

A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the network, and has associated with it an integer weight that represents the number of calls that must be served at the vertex by assigning distinct frequencies per call. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. The static frequency nt problem can be abstracted as a graph multicoloring problem. We describe an e cient algorithm to optimally multicolor any weighted even or odd length cycle representing a cellular network. This result is further extended to any outerplanar graph. For the problem of multicoloring an arbitrary connected subgraph of the triangular lattice, we demonstrate an approximation algorithm which guarantees that no more than 4=3 times the minimumnumber of required colors are used. Further, we show that this algorithm can be implemented ...

• Type: Conference
• Year: 1997
• Where: SIROCCO
• Authors: Lata Narayanan, Sunil M. Shende
• Keywords: Cellular Network, SIROCCO 1997, SIROCCO 2007, Static Frequency, Triangular Lattice