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 UHVXOWV VKRZ WKDW WKH *5$%.3 VFKHPH FDQ HIIHFWLYHO\ LQFUHDVH V\VWHP SUR¿W DQG GHFUHDVH WKH GURSSLQJ SUREDELOLW\ FRPSDUHG 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.