Self-Organizing Network and Adaptive Scheduling Mechanism in 5G Wireless Networks

With the rapid development of communication technology and Internet technology, more and more emerging industries, such as 5G communication, Industry 4.0, automatic driving, Internet of Things and telemedicine, have put forward higher requirements for real-time service transmission with low delay. Traditional Ethernet best-effort service is difficult to guarantee the real-time business, but industrial Ethernet has poor compatibility, not easy to transplant and high cost. As a new generation of Ethernet technology, time-sensitive network has the advantages of high-precision time synchronization, bounded delay and zero jitter, high reliability, high compatibility, and multi-service coexistence, which has received continuous attention from academia and industry, and has potential wide application prospects in many fields such as industrial Internet and mobile prequel. However, many existing scheduling mechanisms have drawbacks. Aiming at the maximum scheduling success rate, this paper proposes and calculates the matching degree between streams and links according to the frame size and period information of known streams, and designs a routing algorithm based on this, pre-screening the paths in the routing set and reducing the search range of the dynamic scheduling algorithm. Finally, the reliability of the model is proved by experiments.