Distributed online frequency assignment in cellular networks
Journal of Algorithms
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
2-Local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Information Processing Letters
Worst-case analysis of a dynamic channel assignment strategy
Discrete Applied Mathematics
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Journal of Algorithms
Greedy online frequency allocation in cellular networks
Information Processing Letters
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Frequency allocation problems for linear cellular networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
SIGACT news online algorithms column 14
ACM SIGACT News
Three results on frequency assignment in linear cellular networks
Theoretical Computer Science
1-local 17/12-competitive algorithm for multicoloring hexagonal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Better bounds for incremental frequency allocation in bipartite graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Better bounds for incremental frequency allocation in bipartite graphs
Theoretical Computer Science
Hi-index | 0.00 |
In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., 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 give a 1-local 4/3-competitive distributed algorithm for multicoloring a triangle-free hexagonal graph, which is a special case. Based on this result, we then propose a 1-local 13/9-competitive algorithm for multicoloring the (general-case) hexagonal graph, thereby improving the previous 1-local 3/2-competitive algorithm.