JOURNAL ARTICLE

Downlink resource allocation for data traffic in heterogenous cellular CDMA networks

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:
Telecommunications link Knapsack problem Computer science Base station Resource allocation Cellular network Heuristic Utility maximization Computer network Mathematical optimization Channel allocation schemes Maximization Utility maximization problem Resource management (computing) Algorithm Mathematics Wireless Telecommunications

Metrics

14
Cited By
1.42
FWCI (Field Weighted Citation Impact)
18
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Wireless Communication Networks Research
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.