Home > Research > Publications & Outputs > An algorithm for downlink radio resource alloca...
View graph of relations

An algorithm for downlink radio resource allocation in cellular CDMA-TDMA networks

Research output: Contribution to journalLetter

Published

Standard

An algorithm for downlink radio resource allocation in cellular CDMA-TDMA networks. / Navaie, Keivan.

In: Modares Technical Journal, 03.2009, p. 103-110.

Research output: Contribution to journalLetter

Harvard

APA

Vancouver

Author

Bibtex

@article{ce6ccdfffacc4c95882f44c811cd3beb,
title = "An algorithm for downlink radio resource allocation in cellular CDMA-TDMA networks",
abstract = "It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance improvement in comparison to existing heuristic algorithms for MMKP.",
author = "Keivan Navaie",
year = "2009",
month = "3",
language = "English",
pages = "103--110",
journal = "Modares Technical Journal",

}

RIS

TY - JOUR

T1 - An algorithm for downlink radio resource allocation in cellular CDMA-TDMA networks

AU - Navaie, Keivan

PY - 2009/3

Y1 - 2009/3

N2 - It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance improvement in comparison to existing heuristic algorithms for MMKP.

AB - It is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular CDMA/TDMA networks can be mapped to a Multi-dimensional Multiple-choice Knapsack Problem (MMKP) which is NP-hard. In this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. Numerical results indicate significant computational performance improvement in comparison to existing heuristic algorithms for MMKP.

M3 - Letter

SP - 103

EP - 110

JO - Modares Technical Journal

JF - Modares Technical Journal

ER -