A randomized saturation degree heuristic for channel assignment in cellular radio networks

We investigate the channel assignment problem, that is, the problem of assigning channels (codes) to the cells of a cellular radio network so as to avoid interference and minimize the number of channels used. The problem is formulated as a generalization of the graph coloring problem. We consider the saturation degree heuristic, first proposed as a technique for solving the graph coloring problem, which was already successfully used for code assignment in packet radio networks. We give a new version of this heuristic technique for cellular radio networks, called randomized saturation degree (RSD), based on node ordering and randomization. Furthermore, we improve the solution given by RSD by means of a local search technique. Experimental results show the effectiveness of the heuristic both in terms of solution quality and computing times.

[1]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[2]  Eric J. Schwabe,et al.  Worst-case performance of cellular channel assignment policies , 1996, Wirel. Networks.

[3]  A. Gamst,et al.  Homogeneous distribution of frequencies in a regular hexagonal cell system , 1982, IEEE Transactions on Vehicular Technology.

[4]  Wei Wang,et al.  Local search for channel assignment in cellular mobile networks , 1996, Satisfiability Problem: Theory and Applications.

[5]  R.J. McEliece,et al.  Channel assignment in cellular radio , 1989, IEEE 39th Vehicular Technology Conference.

[6]  F. Box,et al.  A heuristic technique for assigning frequencies to mobile radio nets , 1978, IEEE Transactions on Vehicular Technology.

[7]  Yoshiyasu Takefuji,et al.  A neural network parallel algorithm for channel assignment problems in cellular radio networks , 1992 .

[8]  Arunabha Sen,et al.  Upper and lower bounds of a class of channel assignment problems in cellular networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[11]  D. Kunz,et al.  Channel assignment for cellular radio using neural networks , 1991 .

[12]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[13]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

[14]  Seong-Lyun Kim,et al.  A two-phase algorithm for frequency assignment in cellular mobile systems , 1994 .

[15]  Roberto Battiti,et al.  Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.

[16]  Dong-wan Tcha,et al.  A new lower bound for the frequency assignment problem , 1997, TNET.

[17]  Rudolf Mathar,et al.  Channel assignment in cellular radio networks , 1993 .

[18]  Masakazu Sengoku,et al.  Graph theoretical considerations of channel offset systems in a cellular mobile system , 1991 .