Bounds on the performance of DCA-algorithms in highway microcellular systems

This paper introduces a new method of performance analysis of cellular systems. The system is studied at a randomly chosen instant in time. At the studied instant, the number of not-served terminals for the radio resource allocation scheme under investigation. The expected fraction of terminals that is not served will be used as a performance measure. All results in the paper are derived for highway microcellular systems, which are characterized by their 1-dimensional structure. For the class of traffic-adaptive DCA-algorithms, an optimum channel assignment algorithm is identified. This algorithm is used to derive the performance bound for the class of traffic-adaptive DCA-algorithms. Further, the paper presents a bound on the performance of any general DCA-algorithm. As a comparison, DCA-algorithms adaptive to the received Signal-to-Interference Ratio (SIR) are investigated. Numerical results show that a centralized SIR-adaptive DCA-algorithm with reasonable complexity can perform close to the general performance bound.<>