Research On Network Slicing Resource Allocation Based On Non-Orthogonal Multiple Access

The fifth-generation communication technology has been developing rapidly in recent years.It has also led to the rise of mobile Internet and related derivative industries,and the amount of data on the network is increasing day by day.The high transmission rate,low latency,and massive device access of mobile devices are increasingly becoming issues that everyone is concerned about.Traditional orthogonal resource allocation is very limited,and it is difficult to meet these needs.In order to solve these increasingly prominent problems,non-orthogonal multiple access(NOMA)technology came into being.Non-orthogonal multiple access technology improves the throughput of the system,reducing the system delay and increasing the number of access devices by increasing the complexity of the receiver.This article is to study the resource allocation in NOMA-based network slicing.This thesis proposes three network slicing scenarios,which are power domain non-orthogonal multiple access(PD-NOMA)based multi-service network slicing scenario,sparse code multiple access(SCMA)based multi-service network slicing scenario,and cooperative cognitive radio-based PD-NOMA multi-service network slicing scenario.Under the constraints of meeting the user's rate and delay,the proportional fair rate sum,energy efficiency and rate sum are studied respectively.The effectiveness of the algorithms is proved through experimental simulations.In the PD-NOMA based multi-service network slicing scenario,there are several enhanced mobile broadband(eMBB)slice users and ultra reliable low latency communication(URLLC)slice users in the system,and the optimization goal is the proportional fair sum rate of the system.On this issue,the user-pair intra-group power allocation algorithm and heuristic user-pairing algorithm are proposed.The first step is to design the optimal solution expression of the optimal power allocation factor through mathematical monotonicity and derivative analysis to obtain the intra-group power allocation algorithm.The second step uses heuristic algorithm of the first step.At the same time,a sub-optimal user matching plan is obtained with the help of the greedy algorithm.Compared with the orthogonal multiple access(OMA)scheme,it is found that a higher proportional fair sum rate can be achieved.In the SCMA-based multi-service network slicing scenario,different users are assigned different codebooks so that they can be transmitted on the same time-frequency resources at the same time.The receiving terminal distinguishes different users through the codebook,and the optimization goal is the energy efficiency of the system.In this problem,a heuristic greedy algorithm and a power allocation algorithm based on Karush-Kuhn-Tucker conditions(KKT)are proposed.The first step is to obtain the sub-optimal user allocation plan by improving the greedy algorithm,and the second step is to convert the non-convex optimization problem into a convex optimization problem by the Dinkelbach algorithm.And then obtain the optimal solution of power allocation by the KKT condition.It is found that the SCMA scheme can achieve higher energy efficiency compared with the OMA scheme.In the collaborative PD-NOMA-based multi-service cognitive radio network slicing scenario,there are multi-service users among the secondary users.The base station transmits signals to the users through the relay node,and the signals between the secondary users are superimposed using PD-NOMA technology.The secondary user is connected to the sub-carrier without affecting the primary user,and the optimization target is the sum of the rate of the edge user.In response to this problem,a user pairing algorithm and a power allocation algorithm are proposed.Due to the complexity of the system model,the first step is to sort users according to their channel quality,and an intuitive sub-optimal user pairing scheme is adopted.The second step uses the KKT condition to solve the power allocation.Comparing the method of using the relay node and the method of not using the relay,it is found that the edge users can achieve higher sum rate.