Research On Allocation Algorithm Of D2D Multi-multiplex Communication Resource Block

In recent years,the number of cellular users has exploded,and base stations in traditional communication methods are under increasing pressure.The demand of users' communication quality is also increasing,and the contradiction between communication spectrum resources and users' number has become increasingly serious,so how to allocate the limited communication resources reasonably becomes particularly important.D2 D technology is a new technology for direct communication between users without the need of base station's transmission.It can reduce the load on base stations,shorten the distance of user communication links,and improve the efficiency of spectrum utilization.At present,there have been a lot of researches on D2 D communication resource allocation,but there are still some issues that need further research.The main overview is two points: most of the existing D2 D communication resource allocation algorithms focus on power allocation or mode selection,but the number of resource blocks obtained by multiplexing hasn't be taken into consideration;most of the existing D2 D multiplexing methods are directed to one-to-one multiplexing or one-to-many multiplexing,but the multiplexing methods are not flexible enough,and there is a lack of research on resource allocation schemes for many-to-many multiplexing.Aiming at the problem that the existing D2 D communication resource allocation algorithm does not consider resource blocks,this paper proposes a D2 D multiplexing communication resource block allocation algorithm based on non-equilibrium solution.Firstly,the algorithm introduces the idea of game theory,so the throughput obtained by D2 D user multiplexing is attributed to the multiplexed cellular users.The multiplexed cellular users are used as competitors,and the benefit function of the multiplexed cellular users is established.The NP problem of the maximum system throughput is transformed into the problem of solving the joint maximum value of the multiplexed cellular user benefit function.Secondly,the algorithm relaxes the integer programming problem of resource block allocation into a continuous function to find the joint maximum problem.Finally,by taking one-to-two and one-to-three multiplexing as examples,the corresponding resource allocation algorithm is analyzed and designed,which is further extended to the one-to-many reuse scenario,making the algorithm design more reasonable and clear.It is more reasonable to distinguishwhether the equilibrium solution exists.When the Nash equilibrium solution with the joint function maximum value does not exist,the "optimal solution" in the feasible region is solved according to the function characteristic analysis to ensure the optimality of the treatment of the unbalanced solution;when the Nash equilibrium solution exists,it is rounded.It then serves as the basis for the resource allocation algorithm and maintains its optimality.Simulation experiments and theoretical analysis show that the proposed algorithm can improve the system throughput,increase the benefit function of the reused cellular users,and improve the communication performance of the cell.Aiming at the problem that the existing communication resource allocation algorithm reuse methods are mostly limited to one-to-one or one-to-many,this paper proposes a communication resource allocation algorithm that allows many-to-many multiplexing.Firstly,the algorithm models the problem as solving the maximum throughput of multiplexed cellular users and D2 D users,introduces the influence factors of communication resource block allocation on D2 D user transmit power,simplifies the objective function and analyzes its functional characteristics,and leads to the constraints on optimal allocation about communication resource blocks.Secondly,the integer programming problem of resource block allocation is relaxed as a continuous function to solve the system throughput maximum problem.Finally,the optimal response curve of the system is analyzed,and the resource allocation algorithm model is designed in combination with the constraints,and the quality of the algorithm is enhanced with the help of halved iteration.The iterative parameters of the algorithm are selected through experimental and theoretical analysis to optimize the algorithm performance.Simulation experiments and theoretical analysis show that the proposed algorithm can reasonably allocate resource blocks under multiple reuse conditions and increase system throughput.