Data link message access control method based on channel load statistics

Abstract

The application discloses a data link message access control method based on channel load statistics. In the method, data link messages to be transmitted by members in the network are respectively entered into different priority data queues according to priorities; the system searches the priority data queues with data link messages in turn according to the order from high to low priority, and compares the priority threshold v i of the data queue with the current channel load value β; if v i < β, the priority data queue is backed off according to a back-off algorithm; if v i > β, the data link message in the priority data queue is allowed to access the channel; the data size of the accessed channel is determined by calculating the residual load value, the average load value and the access load value. The technical scheme disclosed by the application improves the success probability of data link message transmission and the channel utilization efficiency, solves the "starvation" problem of low-priority data queues, and further improves the real-time performance of important information transmission.

Description

Technical Field

[0001] This invention relates to a message access control method for data links, belonging to the field of communication technology. Background Technology

[0002] Data links are crucial tools for control and intelligence systems, and the foundation for the integrated construction and digital integration of sensors, command and control systems, and strike platforms. They ensure information sharing, shorten command and decision-making time, and enable rapid strike operations. Data link messages are transmitted and exchanged accurately, rapidly, and encrypted according to prescribed message formats, thereby enabling situational information sharing. This allows commanders to issue more effective operational deployments and improves coordination and overall combat capabilities among all members.

[0003] In datalink network protocols, the Media Channel Access Control (MSA) protocol operates above the MAC layer and is the direct controller of datalink message interaction on the channel. Its performance directly affects the strength of datalink communication transmission capabilities and the flexibility of network topology. Random access protocols, represented by SPMA (Statistical Priority Multiple Access Protocol), can significantly improve the networking flexibility of datalink networks and represent the future development trend of datalink MSA protocols. The SPMA protocol uses channel load statistics for access control, comparing the priority threshold of the data queue with the channel load value to determine whether to send the current data queue. After a datalink message enters the priority queue, the current channel load statistics are compared with the priority threshold of the data queue. If the current channel load is less than the priority threshold, the datalink message is sent; if the current channel load is greater than the priority threshold, a backoff algorithm is used. After the backoff is complete, the above determination is repeated. By backing down low-priority channel access, the probability of successful transmission of high-priority data is guaranteed. When the low-priority data backoff ends, if the channel load value is less than the low-priority threshold, then low-priority data transmission is allowed. However, when multiple members within a hop have a large amount of low-priority data waiting to be sent, a large amount of data will simultaneously access the channel in a short period of time, causing the channel load to rise rapidly. This inevitably leads to severe collisions, reducing the probability of successful information transmission and channel utilization efficiency, and affecting the real-time performance of data link message transmission and network transmission performance. Therefore, existing technologies can only control the timing of low-priority data accessing the channel, but cannot control the amount of data accessed or the access rate, resulting in low channel utilization, low probability of successful information transmission, and reduced real-time information interaction among network members.

[0004] Therefore, how to control the amount of data accessed by network members to improve the success rate of data link message transmission and channel utilization efficiency is a difficult problem that needs to be solved in the existing data link field. Summary of the Invention

[0005] The purpose of this invention is to control the amount of data accessed by network members to improve the information transmission success rate and channel utilization efficiency, and reduce the probability of channel collisions among network members.

[0006] To achieve the objectives of this invention, a data link message access control method based on channel load statistics is provided. In this method, data link messages to be transmitted by network members are entered into different priority data queues according to their priorities. The system searches for priority data queues containing data link messages sequentially from highest to lowest priority, and sets the priority threshold v of the data queue accordingly. i Compare with the current channel load value β; if v i If v ≤ β, then the priority data queue backs off according to the backoff algorithm. i If the priority data queue is greater than β, then the data link messages in the priority data queue are allowed to access the channel. The amount of data accessed to the channel is determined by the following steps:

[0007] Step 1: Calculate the remaining load value μ, μ = (v0 - β) × C, where v0 is the priority threshold of the highest priority data queue, β is the current channel load value, and C is the system's maximum throughput;

[0008] Step 2: Calculate the average load limit ε within a one-hop range:

[0009]

[0010] In the formula, N represents C within a one-hop range. 2 The number of members, M represents the number of non-C members within a hop range. 2 The number of members, where α represents the weight;

[0011] Step 3: Calculate C within one hop range 2 Members and non-C 2 The member's access load limit value p, if this member is C 2 For a member, the access load limit is: p = (1 + α)ε. If this member is not a C... 2 For members, the access load limit value is: p = ε;

[0012] Step 4: Determine the data volume of the access channel based on the relationship between the data volume z of the priority queue and the access load quota value p.

[0013] Furthermore, in the technical solution disclosed in this invention, the method for determining the data volume of the access channel based on the relationship between the data volume z of the priority data queue and the access load quota value p is as follows:

[0014] If the data volume z of the priority data queue and the access load quota p satisfy the relationship z≤pT, then the data volume of the access channel is z. If the data volume z of the priority data queue and the access load quota p satisfy the relationship z>pT, then the data volume of the access channel is pT, where T is the access channel duration.

[0015] Furthermore, in the technical solution disclosed in this invention, the data link messages to be transmitted by the network members are respectively entered into different priority data queues according to their priorities. The priority data queues also include a sorting mechanism that ranks the data link messages in the queue from high to low according to their transmission entropy Γ, where the transmission entropy Γ is:

[0016]

[0017] In the formula, σ represents the information residual, τ represents the data link message update period, and θ represents the data link message update period. a θ represents the initial number of words in the data link message. b θ represents the number of extended words in a data link message. c This represents the number of words in the data link message.

[0018] Furthermore, in the technical solution disclosed in this invention, in addition to the highest priority data queue, other priority data queues are equipped with timers to calculate the waiting time before a data link message is sent after entering the queue. When the waiting time before a data link message is sent exceeds one-quarter of its maximum waiting time, the data link message is removed from the current queue and inserted into a higher priority data queue. The timer is restarted in the new queue. If the waiting time exceeds one-quarter of the maximum waiting time again, the above operation is repeated until it is inserted into the next highest priority data queue.

[0019] Furthermore, in the technical solution disclosed in this invention, the statistical method for the current channel load value β is as follows:

[0020] Within a statistical time window, network members calculate the channel load value β by counting the number of data link pulse signals transmitted in the statistical channel. The channel load β can be expressed as:

[0021]

[0022] Among them, f i This represents the i-th frequency hopping point of the data link terminal in this member. This indicates that the data link terminal of this member is at the i-th frequency hopping point f. i The number of pulses received from other members within a one-hop range. This indicates that the data link terminal of this member is at the i-th frequency hopping point f. iThe number of pulses sent, K represents the total number of frequency hopping points of this member data link terminal, and T represents the number of pulses sent. p T represents the period time of the data link pulse. s This indicates the duration of the statistical time window.

[0023] Furthermore, in the technical solution disclosed in this invention, the priority threshold v of the data queue i The setup method is as follows:

[0024]

[0025] Among them, v i v represents the priority threshold of the data queue with priority i. L-1 This represents the priority threshold for a data queue with priority L-1, where priorities are listed in descending order as 0, 1, ..., L-1, with 0 being the highest priority and L-1 the lowest priority. j This represents the proportion of linked data messages contained in the data queue with priority j out of all data queues with priority.

[0026] Furthermore, in the technical solution disclosed in this invention, the priority threshold v of the data queue i Compare with the current channel load value β, if v i If the value is less than or equal to β, then the priority data queue will back off according to the backoff algorithm, which is a binary backoff algorithm.

[0027] Preferably, in the technical solution disclosed in this invention, the weight α = 0.5.

[0028] Furthermore, in the technical solution disclosed in this invention, the statistical time window is a sliding time window.

[0029] Furthermore, in the technical solution disclosed in this invention, the priority threshold v of the lowest priority L-1 data queue... L-1 for:

[0030] In Aloha channel access mode, the channel load value corresponding to a 99% data link message transmission success probability is the priority threshold v of the lowest priority L-1 data queue. L-1 .

[0031] Compared with the prior art, the present invention has the following beneficial effects:

[0032] (1) Improved the success rate of data link message transmission and channel utilization efficiency.

[0033] Existing technologies can only control the timing of low-priority data access to the channel, but cannot control the amount of data accessed or the access rate. This results in low channel utilization, low probability of successful information transmission, and reduced real-time information exchange among network members. In the technical solution disclosed in this invention, the amount of data accessed by network members is determined by calculating the remaining load value, average load capacity value, and access load capacity value. This prevents large amounts of data from multiple members from simultaneously flooding the channel and causing congestion. Under the premise of not exceeding system load, the remaining load value of the channel is rationally utilized, thereby ensuring smooth information exchange among network members and improving the probability of successful transmission and channel utilization efficiency.

[0034] (2) Solved the "starvation" problem of low-priority data queues.

[0035] In existing technologies, when the channel load exceeds the high-priority threshold, low-priority data from various network members is backed up according to a backoff algorithm to reduce channel access volume and ensure the successful transmission probability of high-priority data. The purpose of the backoff algorithm is to prevent different members from accessing a large amount of low-priority data at a given time, ensuring that the channel access volume does not exceed the threshold. However, it cannot control the amount of low-priority data accessed by network members at a given time. Therefore, when network members have a large amount of low-priority data, congestion can occur in a short period, causing the channel load to rise rapidly and exceed the low-priority threshold, thus continuing to back off low-priority data. After the backoff ends, if a large amount of low-priority data still accesses the channel simultaneously, congestion will continue, repeating the above process, resulting in low-priority data being unable to be successfully transmitted for a long time, causing a "starvation" effect. In the technical solution disclosed in this invention, not only is the timing of low-priority data access controlled, but the amount of data accessed by network members is also controlled in conjunction with the load, thereby avoiding a large influx of data into the channel simultaneously and solving the "starvation" effect problem of low-priority data.

[0036] (3) Further improved the real-time performance of important information transmission.

[0037] In existing technologies, user-to-be-transmitted data link messages enter various data queues according to priority. Within these queues, a FIFO (First Input First Output) scheduling method is used to control the transmission order of data link messages, meaning they are sent in queuing order based on the time they entered the queue. However, the importance of data link messages in each queue depends not only on their generation time but also on factors such as information residuals, update cycles, and data length. If the transmission order only considers generation time, important information will inevitably be sent after less important information, making it difficult to guarantee the real-time transmission of important information. In the technical solution disclosed in this invention, data in the data queues is sorted using information transmission entropy, thereby ensuring the real-time transmission of important information. Detailed Implementation

[0038] The present invention will be further described in detail below with reference to embodiments, so that those skilled in the art can implement it based on the description.

[0039] In existing technologies, only the timing of low-priority data access to the channel can be controlled, not the amount of data or the access rate. This results in low channel utilization, low probability of successful information transmission, and reduced real-time performance of information exchange among network members. To address the problems in existing technologies, this invention discloses a data link message access control method based on channel load statistics. In this method, data link messages to be transmitted by network members are entered into different priority data queues according to their priority. The system searches for priority data queues containing data link messages sequentially from high to low priority and sets the priority threshold v of the data queue. i Compare with the current channel load value β; if v i If v ≤ β, then the priority data queue backs off according to the backoff algorithm. i If the priority data queue is greater than β, then the data link messages in the priority data queue are allowed to access the channel. The amount of data accessed to the channel is determined by the following steps:

[0040] Step 1: Calculate the remaining load value μ, μ = (v0 - β) × C, where v0 is the priority threshold of the highest priority data queue, β is the current channel load value, and C is the system's maximum throughput;

[0041] Step 2: Calculate the average load limit ε within a one-hop range:

[0042]

[0043] In the formula, N represents C within a one-hop range. 2 The number of members, M represents the number of non-C members within a hop range. 2 The number of members, where α represents the weight;

[0044] Step 3: Calculate C within one hop range 2 Members and non-C 2 The member's access load limit value p, if this member is C 2 For a member, the access load limit is: p = (1 + α)ε. If this member is not a C... 2 For members, the access load limit value is: p = ε;

[0045] Step 4: Determine the data volume of the access channel based on the relationship between the data volume z of the priority queue and the access load quota value p.

[0046] In the technical solutions disclosed in the embodiments of the present invention, how to prioritize the data link messages is a matter of existing knowledge and common technical means for those skilled in the art, and will not be elaborated here.

[0047] In the technical solution disclosed in this invention embodiment, the remaining load and the average load quota within a one-hop range are calculated and then allocated to members within that one-hop range. In practical applications, the identity types of network members are differentiated, typically categorized as command and control members and non-command and control members, abbreviated as C, C, and C, respectively. 2 Members and non-C 2 Member. C 2 Members are used for command and control of non-C 2 Members that send large volumes of data link messages and have high transmission requirements should be assigned a larger transmission capacity. In the technical solution disclosed in this invention embodiment, the access load quota is adjusted by allocating weights. 2 Members and non-C 2 The access load limits for members are (1+α)ε and ε, respectively. Preferably, the weight α = 0.5. The weight value can be adjusted according to the actual application scenario and experience accumulation, which is a common technique used by those skilled in the art and will not be elaborated here.

[0048] Furthermore, in the technical solution disclosed in the embodiments of the present invention, the method for determining the data volume of the access channel based on the relationship between the data volume z of the priority queue and the access load quota value p is as follows:

[0049] If the data volume z of the priority data queue and the access load quota p satisfy the relationship z≤pT, then the data volume of the access channel is z. If the data volume z of the priority data queue and the access load quota p satisfy the relationship z>pT, then the data volume of the access channel is pT, where T is the access channel duration.

[0050] In the technical solution disclosed in this invention, by comparing the amount of data z in the priority data queue with the allocated access load data amount pT, the amount of data accessed by network members to the channel is controlled. This prevents a large amount of data from multiple members from simultaneously flooding the channel and causing congestion. Under the premise of not exceeding the system load, the remaining channel load value is rationally utilized, thereby ensuring smooth information interaction among network members and improving the probability of successful transmission and channel utilization efficiency. In contrast, existing technologies can only control the timing of low-priority data access to the channel, not the amount of data accessed or the access rate, resulting in low channel utilization, low probability of successful information transmission, and reduced real-time information interaction among network members.

[0051] In existing technologies, since the amount of low-priority data accessed by network members at a certain point in time cannot be controlled, when network members have a large amount of low-priority data, they will simultaneously access the channel in a short period of time, causing congestion and a rapid increase in the channel load value, exceeding the low-priority threshold. As a result, low-priority data will continue to be backed up. After the back-up ends, if a large amount of low-priority data still accesses the channel simultaneously, it will continue to cause congestion, repeating the above process. This results in low-priority data being unable to be successfully transmitted for a long time, causing a "starvation" effect. In the technical solution disclosed in the embodiments of the present invention, the access timing of data link messages of network members is controlled based on the comparison of channel load and priority threshold. On this basis, parameters such as remaining load, average load quota, and access load quota are compared with the amount of data in the priority data queue to control the number of low-priority data members accessing the channel. This keeps the overall load of network members running in a stable state and avoids the jitter phenomenon of sudden rises and falls in channel load. It not only controls the timing of low-priority access to the channel, but also controls the amount of data accessed by network members, thereby avoiding a large amount of data from flooding into the channel at the same time and solving the "starvation" effect problem of low-priority data.

[0052] In existing technologies, user-to-be-transmitted data link messages enter each data queue according to priority. Within the data queue, a FIFO (First Input First Output) scheduling method is used to control the sending order of data link messages, that is, they are sent in order of their entry into the queue. However, in each data queue, the importance of data link messages is not only related to the time order of their generation, but also to factors such as the information residual, update cycle, and data length. If the sending order only considers the time order, it will inevitably cause important information to be sent after unimportant information, making it difficult to guarantee the real-time transmission of important information.

[0053] Furthermore, in the technical solution disclosed in this embodiment of the invention, the data link messages to be transmitted by the network members are respectively entered into different priority data queues according to their priorities. The priority data queues also include a sorting mechanism that sorts the data link messages in the queue in descending order of their transmission entropy Γ, where the transmission entropy Γ is:

[0054]

[0055] In the formula, σ represents the information residual, τ represents the data link message update period, and θ represents the data link message update period. a θ represents the initial number of words in the data link message. b θ represents the number of extended words in a data link message. c The number of continuation words in a data link message. The information residual is used to represent the difference between two data link messages. It refers to the bitwise XOR operation performed between the data link message to be sent and the previously sent data link message. If the two data link messages have different lengths, zeros are padded to the shorter data bits before the XOR operation. Finally, the results of the bitwise operations are summed in decimal, and the sum is the information residual value. This parameter indicates that the larger the information residual, the greater the transmission entropy of the data link message to be sent, and the higher it should be sent. τ is the data link message update period. The larger the update period, the lower the real-time requirement for data link message transmission, and vice versa. Therefore, the smaller the update period, the greater the transmission entropy of the data link message, and the higher it should be sent. Data link messages are typically constructed using message words, such as the US military's TTNT data link and Link-16 data link. The message structure uses words as the basic unit, with each word being 75 bits in size. Word formats include three types: initial word, extended word, and continuation word. The initial word contains the most basic data information of the message; the extended word transmits information logically related to the basic data, and the extended word format is unique for the same type of message; the continuation word transmits corresponding additional information, and the same type of message can have multiple different continuation word formats. The fewer the number of initial words, extended words, and continuation words, the smaller the amount of data contained in the data link message, and the greater its transmission entropy. Therefore, it should be sent first, i.e., data link messages with smaller data volumes should be sent first. Thus, the technical solution disclosed in this embodiment of the invention can further measure the importance of data link messages to be sent in each priority data queue through information transmission entropy, and sort them accordingly, thereby ensuring that important data link messages are sent first. Compared with the existing FIFO method, this greatly improves the real-time performance of sending important data link messages.

[0056] Real-time performance is the most important metric for evaluating the performance of a data link system. In existing technologies, data link messages are prioritized based on channel load and a priority threshold comparison to ensure that high-priority messages are transmitted first. Low-priority messages are only sent if the priority threshold exceeds the channel load. Furthermore, with data collisions occurring during channel access, it is difficult to guarantee the real-time transmission of low-priority data. Typically, data link messages entering each priority queue have a maximum waiting time, i.e., the maximum tolerable waiting time before transmission. For example, the maximum waiting time for periodic data link messages is usually their update cycle time. Exceeding this maximum waiting time renders the data link message invalid and meaningless for transmission. To reduce the probability of low-priority data link messages failing and enhance their real-time transmission performance, the technical solution disclosed in this invention includes timers for all priority data queues except the highest priority data queue. These timers calculate the pre-send waiting time for a data link message after it enters the queue. When the pre-send waiting time exceeds one-quarter of the maximum waiting time, the data link message is removed from the current queue and inserted into a higher-priority data queue. The timer restarts in the new queue. If the waiting time again exceeds one-quarter of the maximum waiting time, the above operation is repeated until the message is inserted into the next highest priority data queue. In this invention, the maximum waiting time and the priority of the data link message are linked. The longer the waiting time, the higher the priority, thus increasing the probability of accessing the channel for transmission and ensuring real-time transmission performance.

[0057] In the technical solutions disclosed in the embodiments of this invention, accurately calculating the channel load value is crucial for determining whether a data link message should be sent. In existing technologies, broadcast messages are typically used, where members within a one-hop range of the network broadcast the number of pulses sent over a period of time to other nodes in the network to calculate the channel load value. However, sending broadcast messages inevitably occupies a certain amount of channel bandwidth, reducing channel resource utilization efficiency. Furthermore, the broadcast message transmission also increases the end-to-end latency of data between members, reducing the real-time performance of information transmission. To improve the accuracy of the channel load statistics, the technical solutions disclosed in the embodiments of this invention provide a method for calculating the channel load value. The method for calculating the current channel load value β is as follows:

[0058] Within a statistical time window, network members calculate the channel load value β by counting the number of data link pulse signals transmitted in the statistical channel. The channel load β can be expressed as:

[0059]

[0060] Among them, f iThis represents the i-th frequency hopping point of the data link terminal in this member. This indicates that the data link terminal of this member is at the i-th frequency hopping point f. i The number of pulses received from other members within a one-hop range. This indicates that the data link terminal of this member is at the i-th frequency hopping point f. i The number of pulses sent, K represents the total number of frequency hopping points of this member data link terminal, and T represents the number of pulses sent. p T represents the period time of the data link pulse. s This indicates the duration of the statistical time window. Preferably, in the technical solution disclosed in this embodiment of the invention, the statistical time window uses a sliding time window method to perform channel load statistics. Typically, the size of the statistical time window is 100ms.

[0061] Furthermore, in the technical solution disclosed in the embodiments of the present invention, messages of different priorities have different sending thresholds. The priority threshold v of the data queue i The setup method is as follows:

[0062]

[0063] In the formula, v i v represents the priority threshold of the data queue with priority i. L-1 This represents the priority threshold for a data queue with priority L-1, where priorities are listed in descending order as 0, 1, ..., L-1, with 0 being the highest priority and L-1 the lowest priority. j This represents the proportion of data chain messages contained in the data queue with priority j out of all priority data queues. Typically, in Aloha channel access mode, when the message transmission success probability is 99%, the channel load value is 4%, meaning the priority threshold of the lowest priority data queue is 4%, or v. L-1 =4%.

[0064] In the technical solution disclosed in this embodiment of the invention, when the data link messages to be sent by network members are divided into 8 priorities, the priorities are arranged in descending order as 0, 1, 2, ..., 7, where 0 is the highest priority and 7 is the lowest priority. Typically, the proportion of data link messages contained in each priority data queue to the total data, from highest to lowest, is as follows: ρ0 = 5%, ρ1 = 10%, ρ2 = 10%, ρ3 = 15%, ρ4 = 15%, ρ5 = 15%, ρ6 = 15%, ρ7 = 15%. At this time, according to the priority threshold v of the data queue... iThe setting method yields the following priority thresholds for each priority data queue, from highest to lowest: v0 = 80%, v1 = 26.7%, v2 = 16%, v3 = 10%, v4 = 7.3%, v5 = 5.7%, v6 = 4.7%, and v7 = 4%.

[0065] In the technical solution disclosed in the embodiments of the present invention, the priority threshold v of the data queue i Compare with the current channel load value β, if v i If the value is less than or equal to β, then the priority data queue backs off according to the backoff algorithm, which is a binary backoff algorithm. The binary backoff algorithm is existing knowledge for those skilled in the art and will not be described further here.

[0066] Although embodiments of the present invention have been disclosed above, they are not limited to the applications listed in the specification and embodiments. It can be applied to various fields suitable for the present invention. Other modifications can be readily implemented by those skilled in the art. Therefore, the present invention is not limited to the specific details without departing from the general concept defined by the claims and their equivalents.

Claims

1. A data link message access control method based on channel load statistics, characterized in that, Data link messages to be transmitted by network members are entered into different priority data queues according to their priority. The system searches for priority data queues containing data link messages in descending order of priority, and sets the priority threshold of the data queue accordingly. Compared with the current channel load value β Compare; if If the priority data queue is backed off according to the backoff algorithm, then... Then, data link messages in the priority data queue are allowed to access the channel, and the amount of data accessed to the channel is determined by the following steps: Step 1: Calculate the remaining load value μ , In the formula, The priority threshold for the highest priority data queue. β This represents the current channel load value. This represents the system's maximum throughput. Step 2: Calculate the average load limit within a one-hop range. ε : ， In the formula, N Indicates a range of hops Number of members To command and control the members, M Indicates non-one-hop range Number of members α Indicates weight; Step 3: Calculate the range within one hop Members and non Member's access load limit p If this member is For members, the access load limit value is: If this member is not For members, the access load limit value is: p = ε ; Step 4: Based on the data volume of the priority queue z and the access load limit value p The relationship determines the amount of data accessed through the channel.

2. The data link message access control method based on channel load statistics according to claim 1, characterized in that, Based on the data volume of the priority data queue z and the access load limit value p The method for determining the amount of data in the access channel is as follows: If the data volume of the priority data queue z With the access load limit value p Satisfying the relation: The amount of data accessed through the channel is z If the data volume of the priority data queue z With the access load limit value p Satisfying the relation: The amount of data accessed through the channel is In the formula, T This refers to the access channel duration.

3. The data link message access control method based on channel load statistics according to claim 1, characterized in that, The data link messages to be transmitted by members within the network are entered into different priority data queues according to their priorities. The priority data queues also contain the transmission entropy of the data link messages. The data link messages in the queue are sorted in descending order of their transmission entropy. for: ； In the formula, σ represents the information residual. For data link message update cycle, This represents the initial number of words in the data link message. θ b For the number of extended words in a data link message, θ c This represents the number of words in the data link message.

4. The data link message access control method based on channel load statistics according to claim 3, characterized in that... Except for the highest priority data queue, other priority data queues in the priority data queue are equipped with timers to calculate the waiting time before sending a data link message after it enters the queue. If the waiting time before sending a data link message exceeds one-quarter of its maximum waiting time, the data link message is removed from the current queue and inserted into a higher-priority data queue. The timer is reset in the new queue. If the waiting time exceeds one-quarter of the maximum waiting time again, the above operation is repeated until it is inserted into the next highest priority data queue.

5. The data link message access control method based on channel load statistics according to claim 1, characterized in that, Current channel load value β The statistical method is as follows: Within the statistical time window, network members calculate the channel load value by counting the number of data link pulse signals in the statistical channel. β The channel load β Represented as: ， in, This indicates the first member data link terminal. A frequency jump point This indicates that the data link end machine of this member is in the [number]th [number]. Frequency hopping points The number of pulses received from other members within a one-hop range. This indicates that the data link end machine of this member is in the [number]th [number]. Frequency hopping points The number of pulses sent. This indicates the total number of frequency hopping points of the data link terminal in this member. This indicates the period of the data link pulse. This indicates the duration of the statistical time window.

6. The data link message access control method based on channel load statistics according to claim 3, characterized in that, The priority threshold of the data queue The setup method is as follows: ， in, Priority is The priority threshold of the data queue. Priority is The priority thresholds for the data queue, where the priorities are ranked from highest to lowest as 0, 1, ... L -1, 0 is the highest priority L -1 is the lowest priority. Priority is The proportion of data chain messages contained in the data queues out of all priority data queues.

7. The data link message access control method based on channel load statistics according to claim 3, characterized in that, The priority threshold of the data queue Compared with the current channel load value β If a comparison is made, If the priority data queue is backed up according to the backoff algorithm, the backoff algorithm is a binary backoff algorithm.

8. The data link message access control method based on channel load statistics according to claim 1, characterized in that, The weight .

9. The data link message access control method based on channel load statistics according to claim 5, characterized in that, The statistical time window is a sliding time window.

10. The data link message access control method based on channel load statistics according to claim 6, characterized in that, The lowest priority Data queue priority threshold for: In Aloha channel access mode, the channel load value corresponding to a data link message transmission success probability of 99% is the lowest priority. Data queue priority threshold .

Images