Packet Scheduling Method Based on Statistical Load in Competitive Multiple Access

Abstract

The invention discloses a packet scheduling method based on statistical load in competitive multiple access, which mainly solves the technical problems of the existing channel load jitter and the probability of successful packet transmission decreasing. The implementation steps are as follows: 1) The node starts up and counts the high-priority packet load; 2) According to the interruption period, it is judged whether the node enters the interruption of the calculation scheduling time interval, if it is performed in step 3), otherwise it is performed in step 5); 4) calculate the low-priority packet scheduling interval according to the low-priority packet traffic and the remaining bandwidth; 5) judge whether the node enters the transmission interruption according to the transmission interruption condition, if so, perform step 6), otherwise , return to 2); 6) The node schedules packets according to the scheduling time interval, and accesses these packets to the channel. The invention reduces packet collision and load jitter in the channel, effectively improves the probability of successful packet transmission, and can be used for packet transmission.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a packet scheduling method, which can be used for packet transmission. Background technique [0002] In the statistical load contention multiple access protocol, the method of low priority packet scheduling is the direct factor affecting the network throughput and packet delay. In an airborne network, how to schedule low-priority packet channel access to avoid conflicts while keeping the network throughput close to the threshold is an important issue. [0003] In the traditional statistical load contention multiple access protocol, the scheduling method of low-priority packets is mainly based on the backoff time. When the network load exceeds the threshold, the low-priority packets of each node are backed off according to the backoff time to reduce the load in the network. Increase the probability of successful packet transmission. Common backoff times include binar...

AI Technical Summary

Problems solved by technology

However, the shortcomings of this method are: the node will only detect the channel status when the group is connected to the channel, and cannot predict the relationship between the current channel load and the threshold, which will increase the time for group access and reduce the success rate of the group. The transmission probability and throughput, and once the packet is successfully connected to the channel, the backoff window will be reset to the minimum value, without considering the correlation between the front and back traffic flows

However, this method still has deficiencies. The backoff mechanism cannot control the low-priority packet scheduling of a single node, which will cause the channel load to increase rapidly in a short period of time. If the threshold is exceeded, the probability of successful packet transmission and the throughput of the network will decrease. When the channel load exceeds the threshold, the nodes will continuously switch rapidly between back-off and access states, causing channel load to fluctuate and the entire network to be unstable

Images