Research On Radio Resource Management Method Based On Hypergraph And Resource Priority

In recent years,the research on radio resource management methods has attracted serious attention of scholars.With the increasing complexity of communication system models,the following problems remain to be solved:firstly,how to optimize the resource allocation at the user level and meet the service quality requirements of different businesses;secondly,how to model the multidimensional mutually exclusive conditions in the system and provide the necessary system information for resource management.In this thesis,the concepts of hypergraph and resource priority are introduced.Hypergraph is used to keep multidimensional feature relationship in system modeling.Resource priority distinguishes different business types and optimizes resource allocation scheme with users as the main body.First of all,a method of D2D resource allocation based on 3-dimentional matching is proposed in the scene of indoor wireless communication.In order to improve the overall satisfaction of users,the utility function is put in place the priority of the D2D devices in the scene.3-uniform hypergraph is used to model indoor communication system for the matching dimension of equipment is 3-dimensional.In this thesis,a local search algorithm based on hypergraph is proposed.Simulation results show that the algorithm is better than the iterative Hungarian algorithm in terms of system throughput and user satisfaction,and has more obvious advantages than the iterative Hungarian algorithm when introducing more kinds of services and more complex utility functions.Subsequently,the resource allocation problem in heterogeneous wireless networks is discussed,and a radio resource management method for services with different weights is proposed.The problem is modeled by non-uniform hypergraph for the indeterminacy of the matching dimension between data link and business node.Priority weighted delay is proposed as a quantitative tool of resource priority so that the optimization goal of communication model takes into account the real-time transmission and the importance of service.In the algorithm design phase,this paper proposes an algorithm flow based on local search to solve the minimum hyperedge weight sum of hypergraph model,which includes the greedy algorithm,the local search of time-slot and the local search of links.The simulation results show that the performance of the algorithm is better than that of greedy algorithm and random allocation.It can not only improve the transmission efficiency of essential services,but also improve the transmission efficiency of the overall services,reduce the overall packet loss rate and improve the throughput.