Abstract
A GRA-BKP (Grey Relational Analysis-Bounded Knapsack Problem) scheme was proposed for the radio resource management of the 5G networks. It consists of two steps, access selection and admission control. The former step was executed via GRA, whereas the latter problem was formulated as a bounded knapsack problem. Accordingly, an optimal solution of the BKP was given for access selection a greedy algorithm, GRA-Greedy, was proposed for admission control. The simulation results show that the GRA-BKP scheme can effectively increase system profit and decrease the drop-ping probability compared with the existing scheme. In addition, GRA-Greedy achieves comparable perform-ance with the optimal solution GRA-DP, but its computational complexity is much lower than that of the latter.
Sign-in/Register to access full text options 
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: Journal of Communications and Information Networks
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.
