A Viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks

A new channel assignment algorithm, called the Viterbi (1967) -like algorithm (VLA), is proposed to solve the channel assignment problem in cellular radio networks. The basic idea of the proposed algorithm is step-by-step (sequential) channel assignment with the objectives of minimum bandwidth required at every step, subject to adjacent channel and cochannel separation constraints. The VLA provides the benefits of minimum required bandwidth, stability of solution, and fast execution time. The performance of the VLA is evaluated by computer simulation, applied first to 19 benchmark problems on channel assignment and then applied to study cellular radio network performance. Results from computer simulation studies show that bandwidth requirements by VLA closely match or are sometimes better than those of the existing channel assignment algorithms. Furthermore, it is found that execution of VLA is approximately two times faster than the local search algorithm-the existing channel assignment algorithm with the least bandwidth requirements. The combined advantages of minimum required bandwidth, stability of solution, and fast execution time make the VLA a useful candidate for cellular radio network planning.