Distributed online frequency assignment in cellular networks
Journal of Algorithms
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Journal of Algorithms
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
International Journal of Computer Mathematics
1-local 33/24-competitive algorithm for multicoloring hexagonal graphs
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
| Hi-index | 0.04 |
We consider a frequency allocation problem, in which we are given a cellular telephone network whose geographical coverage area is divided into cells in which phone calls are serviced by frequencies assigned to them, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e., to minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we present a 1-local 4/3-competitive distributed algorithm for multicoloring a hexagonal graph without certain forbidden configuration (introduced in Sparl and Zerovnik (2010) [7]).