Dynamic channel assignment in cellular radio

Abstract

Dynamic channel assignment algorithms for cellular systems are developed. The algorithms are compared with an easily simulated bound. Using this bound, it is demonstrated that in the case of homogeneous spatial traffic distribution, some of these algorithms are virtually unbeatable by any channel assignment algorithm. These algorithms are shown to be feasible for implementation in current cellular systems. For the examples considered, in the interesting range of blocking probabilities (2-4%), the dynamic channel assignment algorithms yielded an increase of 60-80% in the carried traffic over the best-known fixed channel assignment.<>