DocumentCode
421068
Title
Downlink resource allocation for data traffic in heterogenous cellular CDMA networks
Author
Shabany, Mahdi ; Navaie, Keivan ; Sousa, Elvino S
Author_Institution
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
Volume
1
fYear
2004
fDate
28 June-1 July 2004
Firstpage
436
Abstract
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 suboptimal 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 multidimensional 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.
Keywords
cellular radio; code division multiple access; knapsack problems; optimisation; resource allocation; telecommunication traffic; CDMA network; MMKP; NP-Hard; code division multiple access; downlink resource allocation; dynamic pricing platform; heterogeneous cellular network; multidimensional multiple-choice knapsack problem; polynomial-time suboptimal heuristic algorithm; suboptimal base-station assignment scheme; Cellular networks; Downlink; Heuristic algorithms; Multiaccess communication; Multidimensional systems; Polynomials; Pricing; Resource management; Telecommunication traffic; Utility programs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 2004. Proceedings. ISCC 2004. Ninth International Symposium on
Print_ISBN
0-7803-8623-X
Type
conf
DOI
10.1109/ISCC.2004.1358444
Filename
1358444
Link To Document