A combinatorial approximation algorithm for CDMA downlink rate allocation

Richardus J. Boucherie, A.F. Bumb, A.I. Endrayanto, Gerhard Woeginger

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

137 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationTelecommunications Planning: Innovations in pricing, network design and management
EditorsS. Raghavan, G. Anandalingam
Place of PublicationBerlin
Number of pages19
ISBN (Print)978-0-387-29222-9
Publication statusPublished - 2006

Publication series

NameOperations Research/Computer Science Interfaces
ISSN (Print)1387-666X


  • CDMA
  • IR-69807
  • Knapsack
  • EWI-16538
  • Multiple-choice
  • Downlink rate allocation
  • Approximation scheme
  • Feasibility transmit power


Dive into the research topics of 'A combinatorial approximation algorithm for CDMA downlink rate allocation'. Together they form a unique fingerprint.

Cite this