Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Downlink resource allocation for data traffic in heterogenous cellular CDMA networks
AU - Shabany, Mahdi
AU - Navaie, Keivan
AU - Sousa, Elvino S.
PY - 2004
Y1 - 2004
N2 - In this paper using the dynamic pricing platform, a novel framework for downlink resource allocation in heterogeneous cellular CDMA networks is proposed. For each user we define a utility that is a function of channel status and delay condition of that individual user as well as network load status. The network utility is then defined as the summation of the users' achieved utilities. We solve downlink resource allocation problem through maximization of total network utility. This approach results in a sub-optimal base-station assignment scheme which-unlike previous work-is network optimal instead of cell optimal. We then show that optimal base-station assignment is a Multi-dimensional Multiple- choice Knapsack Problem (MMKP). Since MMKP is NP-Hard a polynomial-time suboptimal heuristic algorithm is then employed to develop an efficient base-station assignment.
AB - In this paper using the dynamic pricing platform, a novel framework for downlink resource allocation in heterogeneous cellular CDMA networks is proposed. For each user we define a utility that is a function of channel status and delay condition of that individual user as well as network load status. The network utility is then defined as the summation of the users' achieved utilities. We solve downlink resource allocation problem through maximization of total network utility. This approach results in a sub-optimal base-station assignment scheme which-unlike previous work-is network optimal instead of cell optimal. We then show that optimal base-station assignment is a Multi-dimensional Multiple- choice Knapsack Problem (MMKP). Since MMKP is NP-Hard a polynomial-time suboptimal heuristic algorithm is then employed to develop an efficient base-station assignment.
KW - POWER-CONTROL
KW - KNAPSACK-PROBLEM
KW - ALGORITHM
U2 - 10.1109/ISCC.2004.1358444
DO - 10.1109/ISCC.2004.1358444
M3 - Conference contribution/Paper
SN - 078038623X
VL - 1
SP - 436
EP - 441
BT - Computers and Communications, 2004. Proceedings. ISCC 2004. Ninth International Symposium on
A2 - Puliafito, A.
A2 - Papavassiliiou, S.
PB - IEEE
CY - New York
T2 - 9th IEEE International Symposium on Computers Communications (ISCC 04)
Y2 - 28 June 2004 through 1 July 2004
ER -