Research On Wireless Network Slice Resource Allocation Algorithm Based On Game Theor

With the official commercialization of the fifth-generation mobile communication technology,the scale of communication services continues to expand,and the diversity of users’ demands for network services has further increased.However,the traditional network is difficult to deal with the differentiation of user needs.Therefore,network slicing technology,which can be customized flexibly and can be networked on demand,has become a hotspot in the industry.Although network slicing technology can improve the efficiency of resource allocation between service providers and users through dynamic resource sharing,it may lead to an increase in service providers’ operating costs.Therefore,this paper combined game theory with network slicing technology to study the interaction between participants in the network slicing resource allocation scenario,and obtained the following results:(1)Aiming at the traditional static network slicing resource allocation scenario,the utility function information of each participant is not open to each other,and a network slicing resource allocation algorithm based on the generalized Kelly mechanism is proposed.This algorithm can solve the resource allocation problem between infrastructure providers and service providers without knowing the utility function of the participants.Simulation results show that the algorithm can quickly complete resource allocation and converge to Nash equilibrium.(2)Aiming at the problem that user demand and user location will change with time in dynamic network slice resource allocation scenario,a user request queue is established,and a network slice resource allocation algorithm based on generalized Kelly mechanism and queue optimization theory is proposed.The algorithm uses lyapunov queue optimization theory to optimize the user queue.Simulation results show that the algorithm can complete resource allocation under the premise of ensuring the stability of the user queue and realize the maximum of social welfare.(3)Aiming at the network fragmentation resource allocation scenario with multiple service providers and users,a Stackelberg game algorithm based on multiple leaders and multiple followers was proposed.In this algorithm,service providers,as the leader,lease resources to users to obtain benefits,and users,as followers,maximize their utility within a fixed budget.Simulation results show that this algorithm can effectively improve the benefits of service providers and make the game converge to Stackelberg equilibrium.Finally,summarize and analyze the research results of this article,and look forward to the shortcomings.