| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] |
¡@
Rei-Heng Cheng, Chang Wu Yu+ and Tung-Kuang Wu++
Department of Information Management
Hsuan Chuang University
Hsinchu, 300 Taiwan
E-mail: rhc@hcu.edu.tw
+Department of Computer Science and Information Engineering
Chung Hua University
Hsinchu, 300 Taiwan
E-mail: cwyu@chu.edu.tw
++Department of Information Management
Ming Hsin University of Science and Technology
Hsinchu, 304 Taiwan
E-mail: tkwu@mis.must.edu.tw
A critical task in the design of a cellular radio network is to determine a spectrum-efficient and conflict-free allocation of channels among the cells. In this paper, we propose a new approach to the Fixed Channel Assignment (FCA) problem. By preserving the co-site channel constraint throughout our algorithm and adopting a fine-tuning procedure to escape from a local minimum, we reduce the overall execution time and improve the convergence rate. Simulation results show that our algorithm achieves a very high rate of convergence to solutions for eight benchmark problems. Furthermore, the number of iterations our algorithm requires is fewer than previous results.
Received June 4, 2002; revised February 17 & November 17, 2003; accepted April 15, 2004.
Communicated by Nen-Fu Huang.
* This research was supported by the National Science Council, Taiwan, R.O.C., under grant NSC 89-2213-E-364-002.