An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem

Jiahai WANG  Zheng TANG  Hiroki TAMURA  Xinshun XU  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E87-A   No.8   pp.2092-2099
Publication Date: 2004/08/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Nonlinear Problems
Keyword: 
channel assignment problem,  expanded maximum neural network,  transient chaos,  NP-complete problem,  

Full Text: PDF(920.5KB)>>
Buy this Article




Summary: 
In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.