A Packet Scheduling Method Based on Probabilistic Retransmission in Wireless Networks

Abstract

The invention discloses a packet scheduling method based on probabilistic retransmission in a wireless network. When setting the scheduling right, the method considers two factors of link state and queue congestion: the link state is estimated by setting each queue The retransmission probability is determined by the measurement factor, and the retransmission probability takes into account the specific queue congestion situation. The entire scheduling process proposes a probabilistic retransmission mechanism to avoid the queue head blocking problem. In addition, the scheduling algorithm also compensates the queues that failed to send packets before to ensure fairness. Under the protection of the probabilistic retransmission mechanism, the present invention can "choose the best" to schedule the queue data packets to be sent, and because the queue situation at the base station is considered for scheduling, the accumulated pressure of the data packets at the bottleneck node is relieved. This method has broad application prospects for the research of wireless network scheduling methods.

Description

technical field [0001] The invention relates to the research field of wireless network scheduling algorithms, in particular to a packet scheduling method based on probability retransmission in a wireless network. Background technique [0002] With the development of wireless technology, wireless network plays an increasingly important role in daily life. In a wireless network, the characteristics of limited bandwidth resources, the dependence of channel location and the burstiness of channel errors determine that the design of a good wireless network scheduling algorithm plays an important role in improving the overall performance of the network. [0003] Many wired scheduling algorithms have been proposed in the prior art, but these algorithms are often not applicable to wireless networks, and the evaluation indicators of the two are not the same. For example, in wired networks, packet loss is used to estimate network performance, but in wired networks. In addition to cong...

AI Technical Summary

Problems solved by technology

Many traditional retransmission methods limit the number of consecutive retransmission visits by setting the retransmission counter (MAX_RETRANSMISSION_TIMES). Considering that the link may be continuously in a bad state and data packets continue to arrive at the current queue, the traditional retransmission method is not effective at this time. Solve the head-of-line blocking problem (HOL), which limits the transmission of the remaining packets and causes the arriving packets to be lost due to the full buffer, which increases the delay, but does not significantly improve the throughput

[0007] Therefore, it is of great application value to propose a probabilistic retransmission method based on the captain to solve the problem of unsuccessful packet sending in the scheduling process, and to solve the problem of data packet accumulation and low throughput caused by HOL as much as possible.

Images