Optimal Scheduling Algorithm of Wireless Communication Packets Based on Knapsack Theory

Abstract

Due to the instability of the wireless channel, data packet loss occurs during wireless communication information transmission. Wireless communication can effectively improve transmission efficiency, study the optimal transmission method of wireless communication data packets, improve the information transmission efficiency and quality of wireless communication, and realize the optimal transmission of wireless communication data packets in order to ensure the reliable transmission of data. It is crucial for increasing wireless communication quality. Natural scheduling and priority scheduling are the only two types of wireless resource scheduling algorithms available so far. These scheduling algorithms are unable to solve the problem of executing the best scheduling under the same priority constraints. This problem is solved using the knapsack theory data knapsack filling procedure. The optimal scheduling of wireless communication packets is investigated in this study using the knapsack theory. The number of destination nodes grows from two to sixteen over time, two at a time. Set the system parameters to a total of 50 original data packets, a packet loss rate of 0.4 in the optimization process, and a packet loss probability of 0.26 in the feedback connection. The KFA approach employed in this study has the highest optimization rate in the three experiments, which can be seen to reduce data packet loss, according to the simulation test. Hybrid coding of data packet transmission is used in conjunction with the buffer feedback method to increase data transmission security. At the same time, it gives practical data for wireless reactive power coded data packet transfer using the time complexity measurement algorithm.