Efficient Channel Management for Cellular Mobile Communication Systems

다국어 초록 (Multilingual Abstract)

The minimum span problem (MSP) and minimum blocking problem (MBP) for cellular mobile systems with nonuniform traffic distributions are considered. MSP minimizes the span, i.e., the number of channels, necessary to satisfy a given grade of service (GOS) for the system subject to the co-channel, adjacent and co-site interference constraints. MBP minimizes the average blocking probability of the system subject to the interference constraints, given the number of available channels. In this paper, we suggest an efficient heuristic algorithm for MSP which sues a GOS value updating scheme, and compare the algorithm with existing other ones. Computational experiments show that this algorithm provides solutions with much smaller span than others. We also show that a simple modification of that algorithm provides encouraging computational results for MBP.