Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communication Networks and Information Security (IJCNIS)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
