Self-Organizing Transient Chaotic Neural Network for Cellular Channel Assignment

This paper presents a self-organizing transient chaotic neural network to solve the channel assignment problem, one of NP-complete problems. The proposed neural network consists of two parts. The first part is the self-organizing evolution stage, which based on the mutual inhibition mechanisms of bristle differentiation and the problem's heuristic information. The second part is the transient chaotic neural network executing stage. A significant property of the TCNN model is that the chaotic neurodynamics is temporarily generated for searching and self-organizing in order to escape the local minima. In the proposed neural network, the first part is used to improve the quality of the obtained solutions. The simulating results have shown that the self-organizing transient chaotic neural network improves greatly performance through solving the well-known benchmark problems, especially for the Sivarajan's and Kunz's benchmark problems, while the performance is comparable with existing algorithms.

[1]  Kazuyuki Aihara,et al.  Global bifurcation structure of chaotic neural networks and its application to traveling salesman problems , 1995, Neural Networks.

[2]  Nirwan Ansari,et al.  Neural Networks in Telecommunications , 1994, Springer US.

[3]  Shin Ishii,et al.  Chaotic Potts Spin Model for Combinatorial Optimization Problems , 1997, Neural Networks.

[4]  Kazuyuki Aihara,et al.  Chaotic simulated annealing by a neural network model with transient chaos , 1995, Neural Networks.

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

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

[7]  Marimuthu Palaniswami,et al.  Static and Dynamic Channel Assignment Using Neural Networks , 1997, IEEE J. Sel. Areas Commun..

[8]  Richard Tateson.  Self-Organising Pattern Formation: Fruit Flies and Cell Phones , 1998, PPSN.

[9]  Nasser M. Nasrabadi,et al.  Cellular radio channel assignment using a modified Hopfield network , 1997 .

[10]  M. J. Mehler,et al.  Subspace approach to channel assignment in mobile communication networks , 1995 .

[11]  Jeannette Janssen,et al.  An optimal solution to the "Philadelphia" channel assignment problem , 1999 .

[12]  Yang Lu-xi.  A robust growing method to the satellite broadcasting schedules , 2002 .

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

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

[15]  K. Aihara,et al.  Chaotic neural networks , 1990 .

[16]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[17]  Kate Smith-Miles,et al.  On chaotic simulated annealing , 1998, IEEE Trans. Neural Networks.

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

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