The problem of chunk-based resource allocation for the uplink of Long Term Evolution is investigated. In this paper, a combined order using the promethee method and analytic hierarchy decision for chunk allocation algorithm is proposed. The utility of each order is sorted based on promethee method approach so that the utility of each order could be approximated as the average of all criteria on each order. To decide the best allocation, analytic hierarchy process score is assigned to its order based on their decision criteria weighting factor to find the best allocation. Using a particular weighting factor, the proposed algorithms outperform the previous mean greedy algorithms which use user-order allocation in term of spectral efficiency and data rate fairness without increase the time complexity. It also outperform iterative swapping chunk algorithm in term of data rate fairness.
|Number of pages||9|
|Journal||International Journal of Communication Networks and Information Security|
|Publication status||Published - 2013|