Abstract
We present a graph-theoretic model for the frequency assignment problem in cellular phone networks. Obeying several technical and legal restrictions, frequencies have to be assigned to transceivers so that interference is as small as possible. This optimization problem is NP-hard. Good approximation cannot be guaranteed unless P = NP. We describe several assignment heuristics. These heuristics are simple and not too hard to implement. We give an assessment of the heuristics' efficiency and practical usefulness. For this purpose, typical instances of frequency assignment problems with up to 4240 transceivers and 75 frequencies of a German cellular phone network operator are used. The results are satisfying from a practitioner's point of view. The best performing heuristics were integrated into a network planning system used in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Aardal, A. Hipolito, C. van Hoesel, B. Jansen, C. Roos and T. Terlaky, EUCLID CALMA Radio Link Frequency Assignment Project: A branch-and-cut algorithm for the frequency assignment problem, Technical Annex T-2.2.1 A, T.U. Eindhoven RLFAP Group and T.U. Delft RLFAP Group, 1995.
R.K. Ahuja, T. Magnanti and J.B. Orlin, Network Flows, Prentice-Hall, 1992.
M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs and non-approximability - towards tight results, in: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computational Science, IEEE Computer Society, 1995, pp. 422 - 431.
D.P. Bovet and P. Crescenzi, Introduction to the Theory of Complexity, Series in Computer Science, Prentice-Hall, 1994.
D. Brélaz, New methods to color the vertices of a graph, Communication of the ACM 224(1979)169 - 174.
M. Carlsson and M. Grindal, Automatic frequency assignment for cellular telephones using constraint satisfaction techniques, in: Proceedings of the 10th International Conference on Logic Programming, 1993.
D. Castelino, S. Hurley and N. Stephens, A tabu search algorithm for frequency assignment, Annals of Operations Research 63(1996)301 - 319.
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1990.
D. Costa, On the use of some known methods for T-colorings of graphs, Annals of Operations Research 41(1993)343 -358.
M. Cozzens and F.S. Roberts, T-colorings of graphs and the channel assignment problem, Congr. Numerantium 35(1982)191 - 208.
M.B. Cozzens and D. Wang, The general channel assignment problem, Congr. Numerantium 41 (1984)115 - 129.
P. Crescenzi and V. Kann, A compendium of NP optimization problems, URL: http: yywww.nada.kth.seynadaytheoryyproblemlist.html, 1995.
D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discrete Appl. Math. 49(1994)165 - 174.
M. Duque-Antón, D. Kunz and B. Rüber, Channel assignment for cellular radio using simulated annealing, IEEE Transactions on Vehicular Technology 42(1993)14 - 21.
M. Fischetti, C. Lepschy, G. Minerva, G.R. Jacur and E. Toto, Frequency assignment in mobil radio systems using branch-and-cut techniques, Technical Report, Dipartimento di Matematica e Informatica, Università di Udine, Italy, 1997.
A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Transactions on Vehicular Technology VT-35(1986)8 - 14.
M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NPCompleteness, W.H. Freeman, 1979.
D. Haberland, Azyklische Subdigraphenprobleme und Frequenzzuweisung im Mobilfunk, Master’s Thesis, Technische Universität Berlin, Fachbereich Mathematik, 1996.
W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68(1980)1497 - 1514.
M. Hebermehl, Heuristische Algorithmen zur Lösung von Färbungsproblemen im Mobilfunk, Master’s Thesis, Technische Universität Berlin, Fachbereich Mathematik, 1996.
C. Hurkens and S. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical Report, Eindhoven University of Technology, The Netherlands, 1995.
S. Hurley, D. Smith and S. Thiel, FASoft: A software system for frequency assignment, Radio Science 32(1997)1921 - 1939.
M. Jünger, A. Martin, G. Reinelt and R. Weismantel, Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits, Mathematical Programming 63(1994)257 - 279.
A. Löbel, MCF Version 1.0 - A Network Simplex Implementation, 1997. Available for academic use free of charge via WWW at URL: http:yywww.zib.deyOptimization.
K. Mehlhorn, S. Näher and C. Uhrig, The LEDA User Manual Version 3.4, Max-Planck-Institut für Informatik, D-66123 Saarbrücken, Germany, 1996.
M. Mouly and M.-B. Pautet, The GSM System for Mobile Communications, Cell & Sys, France, 1992.
C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
J. Plehn, Applied frequency assignment, in: Proceedings of the 44th IEEE Vehicular Technology Conference, IEEE, 1994, pp. 853 - 857.
K. Schneider, Frequenzzuweisung im Mobilfunk mittels lokaler Suche, Master’s Thesis, Technische Universität Berlin, Fachbereich Mathematik, 1997.
S. Tiourine, C. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Technical Report, Eindhoven University of Technology, The Netherlands, 1995.
Rights and permissions
About this article
Cite this article
Borndörfer, R., Eisenblätter, A., Grötschel, M. et al. Frequency assignment in cellular phone networks. Annals of Operations Research 76, 73–93 (1998). https://doi.org/10.1023/A:1018908907763
Issue Date:
DOI: https://doi.org/10.1023/A:1018908907763