Packet sending method based on prediction in communication channel

Abstract

The invention provides a packet sending method capable of predicting the arrival time of user business packet accurately so as to effectively resolve the packet collision in a communication channel. The packet sending method is as follows: in order to resolve the collision better in the packet sending process, establishing a mathematical model described by time for an arrival time sequence of the user business packet by user business modeling, facilitating the prediction on the arrival time sequence of the user business packet in future, and when a plurality of packets need to be sent and generate collision, and the packets can be decomposed according to the predicted result. The key points in the invention are as follows: an assignment interval for packet transmission in the current time slot is determined by predicting the arrival time of next user business packet, and decides the packet which is sent in the current time slot and arrives in the time duration of the assignment interval. In the invention, the adopted fractal autoregressive integrated moving average (FARIMA) model can be well matched with the current wireless network environment, and by combination with the whole packet transmission method, the packet time delay can be effectively reduced and the network throughput rate can be improved.

Description

technical field [0001] The invention belongs to the field of using wireless network technology, such as wireless sensor network, wireless self-organizing network, wireless local area network, satellite network, etc., and especially relates to the multiple access technology of wireless shared channel. Background technique [0002] A wireless channel is a shared transmission medium. Therefore, when multiple users communicate on the channel at the same time, collisions will inevitably occur, thereby reducing the throughput rate of the system. How to avoid data collision on the broadcast channel and improve link utilization is a core issue of multiple access. At present, there are mainly three types of multiple access algorithms: fixed allocation, on-demand allocation, and random contention. Due to the distributed nature and temporary nature of the network, as well as the bursty nature of the business, neither the fixedly allocated multiple access protocol nor the demand alloc...

AI Technical Summary

Problems solved by technology

[0008] The above-mentioned conflict resolution algorithm has the following disadvantages: tree conflict resolution relies solely on random decomposition, and when a large number of packet collisions occur, the performance of the algorithm drops significantly; FCFS relies too much on time conditions to decompose collision packets, When it is very strong, the efficiency of the algorithm decreases; the limitation of HSA is too strong, it needs to assume that the user business model is a Poisson process, when the real user business does not meet this assumption, its application range is limited

Images