Fixed channel assignment using new dynamic programming approach in cellular radio networks

Abstract

In this paper, we propose a new approach to the fixed channel assignment problem by modifying the dynamic programming technique. This new strategy extends the already known dynamic programming so that the channel assignment solutions can be obtained. There is no need to have an initial random solution for convergence. One of the questions in the fixed channel assignment is the minimum bandwidth, which is usually unknown; the new strategy can obtain this lower bound. Parallel processing can be implemented over the proposed algorithm. The existing fixed channel assignment methods do not have all these in one place. The performance of modified dynamic programming (MDP) is evaluated by computer simulation, applied to seven well-known benchmark problems on channel assignment. The channel assignment strategies results shows that required bandwidths of modified dynamic programming are closely match or sometimes better than the algorithms that we have investigated.