Dynamic p-continuous CSMA algorithm adopting slip period

Abstract

The invention provides a dynamic p-continuous CSMA algorithm adopting a slip period. The dynamic p-continuous CSMA algorithm is used for a multi-host and multi-slave peer-to-peer bus type network, dynamic adjustment of the sending probability p is achieved, the data transmission efficiency can be effectively optimized, meanwhile, the network communication traffic is reduced, and therefore the buscompetition problem is solved to a certain degree. When the sending probability p of a certain data acquisition terminal is calculated, only the sending times of the data acquisition terminal in a Tmperiod and the sending times of all the data acquisition terminals in the Tm period are counted, and then the sending probability of the data acquisition terminal in the Tm period can be calculated. And after the data acquisition terminal enters the Tm + 1 period through the slip period [delta]t, the sending frequency of the data acquisition terminal in the Tm + 1 period and the sending frequencyof all terminals in the Tm + 1 period are counted again, so that the sending probability in the Tm + 1 period can be calculated. Similarly, the transmission probability of each fixed period is calculated with the slip period [delta]t as the time difference in order in a slip manner.

Description

technical field [0001] The invention relates to the technical field of multi-channel access and conflict detection methods related to data collection terminals. Background technique [0002] At present, the bus-type network is widely used in the data acquisition system. The data acquisition terminals connected to the bus are in a peer-to-peer relationship, forming a multi-master and multi-slave peer-to-peer network. Each data acquisition terminal can be used as a master at any time. Send information to the bus, and can also be used as a slave to receive instructions on the bus. If at a certain moment, there are two or more data acquisition terminals on the bus as hosts to send data to the bus at the same time in a competitive manner, all the sent data will become invalid data, so it is necessary to study a method that can effectively solve the problem of bus competition. algorithm. [0003] CSMA (Carrier Sense Multiple Access) is a distributed media access control protocol...

AI Technical Summary

Problems solved by technology

Non-persistent CSMA adopts the scheme of randomly retransmitting data to reduce the possibility of bus contention, but it may also keep the bus in an idle state, resulting in a decrease in bus usage

Images