The Research On Resource Scheduling Of Wireless Mobile Communication Network

In the past few decades,the development of wireless mobile communication technologies has been changing with each passing day.However,due to the scarcity of resources and the high cost,how to effectively utilize channel resources and computing resources has become a hot research topic at home and abroad.The scheduling problems of channel resources and computing resources have been focused in this paper.The channel resource scheduling is to reasonably allocate power and frequencies and other channel resources for users in wireless mobile communication networks to reduce system interference and improve spectral efficiency.The computing resource scheduling is to use the multi-core processors to map the computing tasks to each processor,and achieve realtime and high-speed information processing.This paper has carried out the following work on the scheduling of channel resources and computing resources:1.Scheduling channel resources to improve spectral efficiency.Facing the competition of increasingly crowded spectrum resources,multi-cell cooperative systems have become the inevitable development of wireless mobile communication systems because of their ability to efficiently use spectrum resources.However,it is the expansion of the scale of the system and the congestion of resources that cause the severe interference problem of multi-cell cooperative systems.Aiming at the problem of channel resource scheduling in multi-cell cooperative systems with severe interference,this paper proposes a method to efficiently utilize channel resources.With the idea of clustering and the construction of the interference graph,a two-step clustering algorithm is proposed to reduce the interference between users.The simulations are carried out under various practical communication networks.The results show that the two-step clustering algorithm has satisfactory results in terms of network capacity and spectral efficiency when the channel resources are limited or sufficient.Compared with the existing resource scheduling algorithms,the results show that the two-step clustering algorithm can significantly improve the spectral efficiency under the premise of maintaining good QoS.2.Scheduling computing resources to achieve real-time and high-speed information processing.Multi-core processors have a wide range of applications in the field of communication information processing because of their high cache and high throughput.The realization of a real-time and high-speed information processing by utilizing the advantages of a multi-core array parallel processing has been analyzed,and the problem of scheduling communication task sets to a multi-core array is studied.This paper presents the introduction of typical computing resource scheduling algorithms,including the list scheduling and the genetic algorithm with minimum delay.At the same time,in order to effectively utilize the parallelism of computing resources,this paper introduces the chunking splicing algorithm and improves it for real-time information processing.For a variety of communication computing tasks,this paper carries out software simulations and hardware implementations.The results show that under various multi-core array architectures,all three algorithms can realize the real-time and high-speed scheduling,and meet the requirements of the millisecond-level mapping scheduling,and the improved chunking splicing algorithm has a great advantage in scheduling delay performance.