A combinatorial approximation algorithm for CDMA downlink rate allocation


Boucherie, R.J. and Bumb, A.F. and Endrayanto, A.I. and Woeginger, G.J. (2006) A combinatorial approximation algorithm for CDMA downlink rate allocation. In: S. Raghavan & G. Anandalingam (Eds.), Telecommunications planning: innovations in pricing, network design and management. Operations Research/Computer Science Interfaces, 33 . Springer, Berlin, Germany, pp. 275-293. ISBN 9780387292229

open access
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 characterized 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.
Item Type:Book Section
Copyright:© 2006 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/69807
Official URL:https://doi.org/10.1007/0-387-29234-9_14
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page