Chapter 1 A COMBINATORIAL APPROXIMATION ALGORITHM FOR CDMA DOWNLINK RATE ALLOCATION

Abstract This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are charac-terized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression for the so-called Perron-Frobenius eigenvalue of that matrix, which provides a quick assessment of the feasibility of the power assignment for a given downlink rate allocation. Based on the Perron-Frobenius eigenvalue, we reduce the downlink rate allocation problem to a set of multiple-choice knapsack problems. The solution of these problems provides an approximation of the optimal downlink rate allocation and cell borders for which the system throughput, expressed in terms of utility functions of the users, is maximized