Online computation and competitive analysis
Online computation and competitive analysis
Distributed online frequency assignment in cellular networks
Journal of Algorithms
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Worst-case analysis of a dynamic channel assignment strategy
Discrete Applied Mathematics
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Online OVSF Code Assignment with Resource Augmentation
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
SIGACT news online algorithms column 14
ACM SIGACT News
A constant-competitive algorithm for online OVSF code assignment
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic on-line call control in cellular networks
Theoretical Computer Science
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.89 |
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided into cells, phone calls are served by assigning frequencies to them, and no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online setting that the calls arrive one by one, the problem is to minimize the span of the frequencies used. In this paper, we study the greedy approach for the online frequency allocation problem, which assigns the minimal available frequency to a new call so that the call does not interfere with calls of the same cell or neighboring cells. If the calls have infinite duration, the competitive ratio of greedy algorithm has a tight upper bound of 17/7, which closes the gap of [17/7,2.5) in [I. Caragiannis, C. Kaklamanis, E. Papaioannou, Efficient on-line frequency allocation and call control in cellular networks, Theory Comput. Syst. 35 (5) (2002) 521-543. A preliminary version of the paper appeared in SPAA 2000]. If the calls have finite duration, i.e., each call may be terminated at some time, the competitive ratio of the greedy algorithm has a tight upper bound of 3.