P. O. Box: 14115-143, Tehran, Iran
Abstract: (3763 Views)
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.
Received: 1901/12/14 | Accepted: 1901/12/14 | Published: 2009/07/26