A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions

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

Research output: Book/ReportReportProfessional

15 Downloads (Pure)

Abstract

This paper presents an analytical model 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 downlink rates, is maximized.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages15
Publication statusPublished - 2004

Publication series

NameMemorandum Faculty of Mathematical Sciences
PublisherUniversity of Twente, Department of Applied Mathematics
No.1728
ISSN (Print)0169-2690

Fingerprint

Code division multiple access
Analytical models
Wireless networks
Throughput

Keywords

  • MSC-90B22
  • MSC-90B18
  • METIS-218213
  • MSC-60K25
  • IR-65912
  • EWI-3548

Cite this

Endrayanto, A. I., Bumb, A. F., & Boucherie, R. J. (2004). A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions. (Memorandum Faculty of Mathematical Sciences; No. 1728). Enschede: University of Twente, Department of Applied Mathematics.
Endrayanto, A.I. ; Bumb, A.F. ; Boucherie, Richardus J. / A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions. Enschede : University of Twente, Department of Applied Mathematics, 2004. 15 p. (Memorandum Faculty of Mathematical Sciences; 1728).
@book{119f906830954f85b3b0be88e9a64d34,
title = "A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions",
abstract = "This paper presents an analytical model 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 downlink rates, is maximized.",
keywords = "MSC-90B22, MSC-90B18, METIS-218213, MSC-60K25, IR-65912, EWI-3548",
author = "A.I. Endrayanto and A.F. Bumb and Boucherie, {Richardus J.}",
note = "Imported from MEMORANDA",
year = "2004",
language = "English",
series = "Memorandum Faculty of Mathematical Sciences",
publisher = "University of Twente, Department of Applied Mathematics",
number = "1728",

}

Endrayanto, AI, Bumb, AF & Boucherie, RJ 2004, A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions. Memorandum Faculty of Mathematical Sciences, no. 1728, University of Twente, Department of Applied Mathematics, Enschede.

A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions. / Endrayanto, A.I.; Bumb, A.F.; Boucherie, Richardus J.

Enschede : University of Twente, Department of Applied Mathematics, 2004. 15 p. (Memorandum Faculty of Mathematical Sciences; No. 1728).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions

AU - Endrayanto, A.I.

AU - Bumb, A.F.

AU - Boucherie, Richardus J.

N1 - Imported from MEMORANDA

PY - 2004

Y1 - 2004

N2 - This paper presents an analytical model 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 downlink rates, is maximized.

AB - This paper presents an analytical model 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 downlink rates, is maximized.

KW - MSC-90B22

KW - MSC-90B18

KW - METIS-218213

KW - MSC-60K25

KW - IR-65912

KW - EWI-3548

M3 - Report

T3 - Memorandum Faculty of Mathematical Sciences

BT - A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Endrayanto AI, Bumb AF, Boucherie RJ. A multiple-choice knapsack based algorithm for CDMA downlink rate differentiation under uplink coverage restrictions. Enschede: University of Twente, Department of Applied Mathematics, 2004. 15 p. (Memorandum Faculty of Mathematical Sciences; 1728).