Combinatorial evolution strategy-based implementation of dynamic channel assignment in cellular communications
Harilaos G. Sandalidis · 1998
Dynamic channel assignment (DCA) problem has been extensively studied and tried to be solved by various algorithmic methods. However, the majority of the above techniques suffers by the high degree of computational cost that decreases the possibility of hardware implementation of a DCA controller for on-line operation in geographic cellular environments. In order to overcome the above problem, various heuristic methods have been suggested in literature. In this paper an efficient heuristic approach called combinatorial evolution strategy (CES) is applied to a DCA problem. CES belongs to the general category of the so called evolutionary algorithms (EAs) that try to solve difficult problems by mimic the process of natural evolution. Comparisons with various channel assignment schemes show the superior performance of CES-DCA for both models with uniform and non-uniform traffic distribution.