A data link dynamic time slot allocation method based on preemption reservation

Abstract

The scheme comprises: micro-slot network cycle structure optimization; using preemption time slot reservation method, initiating time slot reservation request in any idle micro-slot, sending while channel listening, detecting other user terminal time slot reservation request, and performing reservation conflict resolution in the time slot, deciding whether the time slot reservation is successful; using extended situation distribution method, according to current use condition and system requirement, distributing the content of the extended situation, so that it can carry additional information such as platform state, task state and link state. The present application has the beneficial effects that: using signaling time slot competition multiplexing mechanism, single reservation can be initiated in any idle time slot position, that is, the available time slot can be successfully reserved with high probability, temporary bandwidth allocation is obtained, real-time response and service access capacity of the time slot reservation mechanism are improved, the overall utilization rate of the time slot is improved in a statistical multiplexing manner, and the application of extended situation distribution and variable rate situation distribution is supported.

Description

Technical Field

[0001] This invention belongs to the field of data link communication, and in particular relates to a dynamic time slot allocation method for data links based on preemptive reservation. Background Technology

[0002] The Datalink Information Distribution System (DIDS) is an anti-jamming communication system employing a high-speed frequency-hopping architecture. It utilizes Time Division Multiple Access (TDMA) and a layered networking approach to allocate wireless channel resources, enabling distributed multiple access for multiple user terminals and multi-path parallel distribution of datalink messages. Existing DIDS systems use static time slot allocation and contention-based access mechanisms to differentiate datalink message distribution based on service type. Static time slot allocation is pre-assigned by the network center according to task planning and resource requirements, primarily used for periodic services such as synchronization control with a fixed update rate, situational awareness distribution, and target surveillance. Contention-based access pre-allocates time slot blocks for specific services without specifying access users; users randomly occupy time slots with a certain probability and randomly back off upon detecting a conflict. This mechanism is mainly used for services with late user entry and randomly arriving digital voice messages, where the access probability is unpredictable.

[0003] Traditional static time slot allocation cannot meet the dynamic capacity requirements of variable periodic services, and contention-based access mechanisms cannot meet the reliable access and latency jitter requirements of periodic services. In order to adapt to application scenarios such as dynamic formation reorganization, network member changes, and variable situational capacity under joint operations conditions, the Data Link Information Distribution System (DIDS) needs to adopt Dynamic Time Division Multiple Access (DTDMA) technology to adapt to the usage requirements of flexible networking and variable bandwidth, and provide real-time and reliable QoS guarantees for periodic services that arise unexpectedly.

[0004] Typically, Dynamic Time Division Multiple Access (DTDMA) includes three types of online update strategies: Demand Assigned Multiple Access (DAMA), Dynamic Time Division Multiple Access (DTDMA), and Collision Avoidance Time Allocation (CATA).

[0005] Demand-based Multiple Access (DAMA) is a centralized resource reallocation strategy that allows control nodes to reallocate channel resources based on the usage needs and data priorities of multiple users. The real-time performance of the DAMA method depends on the scale of channel resources and computational complexity, and it is subject to single-point failure risk.

[0006] Distributed Dynamic Time Division Multiple Access (DTDMA) is a distributed coordination mechanism that allows nodes to transmit services in allocated time slots, exchange idle time slots in control time slots, and compete for multiplexing in interrupted time slots, while also supporting high-priority access. DTDMA's idle time slot exchange requires three micro-time slots to satisfy a three-way handshake process: time slot broadcasting, time slot request, and time slot confirmation.

[0007] Collision Avoidance Slot Allocation (CATA) is a distributed reservation mechanism that supports spatial multiplexing in multi-hop networks. Each node initially reserves a slot, requiring four micro-slots to complete a four-way handshake process: slot broadcast, slot request, request response, and slot confirmation. CATA achieves maximum collision avoidance in its protocol flow, but it requires significant control slot resources and incurs substantial protocol overhead.

[0008] The aforementioned dynamic time slot allocation mechanisms all fix the location of control time slots, preventing nodes from reserving time slots anytime and anywhere, thus increasing the latency of accessing sudden services. At the same time, the signaling overhead caused by multiple handshakes also reduces the time slot utilization rate of the distributed coordination / reservation mechanism. Summary of the Invention

[0009] In view of this, the present invention aims to propose a dynamic time slot allocation method for data links based on preemptive reservation. On the one hand, it is based on a micro-time slot design to create a network loop structure, which meets the requirements of high-capacity networking and basic situational awareness exchange. On the other hand, user terminals that temporarily generate sudden situational services can initiate a single reservation at any idle time slot location, that is, they can successfully reserve available time slots with a high probability and obtain temporary bandwidth allocation. This improves the real-time response and service access capabilities of the time slot reservation mechanism, and improves the overall utilization rate of time slots through statistical reuse.

[0010] To achieve the above objectives, the technical solution of the present invention is implemented as follows:

[0011] A data link dynamic time slot allocation method based on preemptive reservation includes:

[0012] Optimization of the loop structure of the micro-slotted network;

[0013] Using the preemptive time slot reservation method, a time slot reservation request is initiated in any idle micro-time slot. While sending the request, channel listening is performed to detect time slot reservation requests from other user terminals. Within the current time slot, reservation conflict resolution is performed to determine whether the time slot reservation is successful.

[0014] By using the extended situational awareness distribution method, the content of situational awareness distribution is expanded according to the current usage conditions and system requirements, so that it can carry additional information on platform status, task status, and link status.

[0015] By utilizing a variable-rate situational information distribution method, dynamic time slots are reserved and allocated based on the current platform dynamics to carry out the distribution of situational information with a high update rate. Under the dynamic changes of the platform, the time slot occupancy ratio is dynamically adjusted at any time through a preemptive time slot reservation mechanism.

[0016] Furthermore, the optimization of the micro-timeslot network cyclic structure includes:

[0017] Combining the requirements of communication coverage and transmission efficiency, a micro-timeslot structure design is carried out to meet the carrying capacity of a single timeslot and the needs of large-capacity networking, while also meeting the needs of extended transmission capacity for micro-timeslot cascading.

[0018] Furthermore, the optimization of the micro-timeslot network cyclic structure includes:

[0019] Guarantee the protection delay (T) under specific communication coverage conditions prot The requirement is expressed as follows:

[0020] T prot ≥D max / c (1)

[0021] In the formula, D max Where c is the maximum communication distance and c is the speed of light;

[0022] The transmission efficiency of micro-slots should be no less than 50%, as expressed below:

[0023] In the formula, T tr =T ms -T prot For the effective signal transmission time, T ms This is the micro-slot width, typically 2.5ms;

[0024] Microslot transmission rate (R b It should be greater than a certain threshold value, expressed as follows:

[0025]

[0026] In the formula, B is the operating bandwidth, m is the modulation index, and R... c For coding efficiency, R h For frequency hopping rate, D h L is the pulse duty cycle; wordR represents the word length of the data link message, in bits; n represents the number of message words in the basic situational awareness message. b The typical value is 96kbps;

[0027] Micro-slot width (T) ms It is much smaller than the time slot width (T) of existing data link information distribution systems. s This allows the system to accommodate a maximum number of users (N). usr Doubling:

[0028]

[0029] In the formula, T tr =T ms -T prot For the effective signal transmission time, T ms For the micro-slot width, the typical value of k is 3, meaning that the user capacity under the micro-slot cyclic structure can reach 3 times that of the slot cyclic structure;

[0030] By using the time slot concatenation method, several consecutive micro-time slots are concatenated to form a single time slot to carry more than n message words, enabling richer information content-based situational sharing and improving the system's network information exchange capability. The advantage of using time slot concatenation is that it can reduce the overhead of time slot protection intervals and improve transmission efficiency.

[0031]

[0032] In the formula, M represents the number of cascaded time slots, with a value ranging from 1 to 2. m ;γ cas For cascaded time slot transmission efficiency, when M > 4, γ cas It will be greater than 90%, gradually approaching 1.

[0033] Furthermore, preemptive time slot reservation methods are employed, including:

[0034] Signaling slot contention multiplexing:

[0035] Multiple users send frequency hopping pulses at different start times in the same time slot. The frequency hopping patterns of each user are orthogonal or weakly correlated in the time domain. At the receiving end, the frequency hopping signals of different users can be distinguished by parallel reception.

[0036] The probability that n users can transmit simultaneously without collision in the same time slot is:

[0037]

[0038] The number of requesting users that can be accommodated in a contention-based micro-slot is:

[0039] N tol =1+log(1-P)c_tol ) / log(1-T h / T jit (7)

[0040] In the formula, T h T is the pulse period of the synchronous frequency hopping system. jit For the delay jitter window, N tol To determine the maximum tolerable number of users, when the number of users N... tol As the number of collisions increases, the probability of collision (P) c_tol It will grow exponentially;

[0041] When the conflict probability P c_tol =0.1, pulse period T h = 6.4us, latency jitter window T jit At 0.64ms, a micro-slot can accommodate a maximum of 11 users' slot requests;

[0042] Idle micro-slot listening:

[0043] During the operation of each user terminal on the network, it continuously listens for idle micro-time slots in the network and stores them in the idle micro-time slot table. The micro-time slot listening is periodic with time slots as the time slots. The micro-time slot status packets in the idle time slot table are fixed in terms of allocation, occupation status, and idle status.

[0044] When a user generates a sudden surge in business, the bandwidth, business update rate, and duration required for that business are first estimated and used to populate the fields in the time slot reservation request.

[0045] Then, the reservation request is encapsulated according to the information, a message priority field is attached, and the slot reservation request is sent in the nearest available micro-slot.

[0046] Appointment Conflict Analysis:

[0047] In the latter half of the same micro-slot, users participating in slot reservation can receive data in parallel, distinguish the reservation request signals of multiple users, and resolve reservation conflicts based on the reservation request information of each user.

[0048] Perform data transmission and micro-timeslot release.

[0049] Furthermore, the fixed-allocation micro-time slots are micro-time slots that are fixedly allocated to specific users in the network. They are used for network operation and maintenance, such as synchronization time slots, network management time slots, and voice slots, and are not allowed to be dynamically allocated.

[0050] The occupancy status of dynamically allocated micro-time slots refers to the fact that micro-time slots that have been occupied by other users need to wait for the user to finish using them and release them before they can enter the idle time slot pool.

[0051] The idle state of dynamically allocated micro-time slots refers to micro-time slots that are not occupied by other users, forming an available idle time slot pool that can be used to respond to sudden user requests and for flexible dynamic use.

[0052] Furthermore, the reservation conflict resolution includes:

[0053] a) If there are no other users making reservation requests, the user making the reservation will have priority to occupy the current free time slot and the free micro time slot they applied for, and other users will update the free time slot table according to their reservation requests.

[0054] b) If the current micro-slot contains two or more user reservation requests, each user will parse the business priority of multiple user reservations. The user with the highest priority will occupy the reservation micro-slot first, and other users will update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-slot.

[0055] c) If there are multiple users with the highest priority, the first-come, first-served (FIFO) method is adopted. The decision is made based on the sending time (Tx_Stamp) of each user. The user who sends first has priority to occupy the reserved micro-time slot. Other users update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-time slot.

[0056] Furthermore, the method of utilizing extended situational awareness distribution includes:

[0057] By reserving consecutive micro-slots through a preemptive micro-slot reservation mechanism, cascading slot expansion can be formed, thereby enabling the carrying of more data link message content and enriching the information for situational distribution.

[0058] Furthermore, the variable-rate situational awareness distribution method includes:

[0059] When the platform dynamics or target update rate of a specific user in the network change, the time slots are dynamically allocated based on the current platform dynamics to carry the distribution of situational information with a high update rate. Under the condition of platform dynamic changes, the time slot occupancy ratio is dynamically adjusted at any time through a preemptive time slot reservation mechanism.

[0060] Furthermore, this solution discloses a server, including at least one processor and a memory communicatively connected to the processor, the memory storing instructions executable by the at least one processor, the instructions being executed by the processor to cause the at least one processor to execute a data link dynamic time slot allocation method based on preemptive reservation.

[0061] Furthermore, this solution discloses a computer-readable storage medium storing a computer program, which, when executed by a processor, implements a data link dynamic time slot allocation method based on preemptive reservation.

[0062] Compared with existing technologies, the data link dynamic time slot allocation method based on preemptive reservation described in this invention has the following advantages:

[0063] (1) The present invention provides a data link dynamic time slot allocation method based on preemptive reservation, a signaling time slot contention multiplexing mechanism, and a frequency hopping and time hopping mechanism for simultaneous transmission and reception of wireless signals by multiple users. Multiple users send frequency hopping pulses at different start times in the same time slot. The frequency hopping patterns of each user are orthogonal or weakly correlated in the time domain. At the receiving end, the frequency hopping signals of different users can be distinguished by parallel reception.

[0064] (2) The data link dynamic time slot allocation method based on preemptive reservation described in this invention is based on a micro-time slot network loop structure. Combining the requirements of communication coverage and transmission efficiency, a micro-time slot structure design is carried out. On the one hand, it meets the carrying capacity of a single time slot, and on the other hand, it meets the requirements of large-capacity networking. At the same time, it can meet the requirements of extended transmission capacity for micro-time slot cascading.

[0065] (3) The present invention provides a data link dynamic time slot allocation method based on preemptive reservation. The preemptive time slot reservation method allows user terminals that temporarily generate sudden situation services to initiate a single reservation at any idle time slot position, that is, to successfully reserve available time slots with a high probability and obtain temporary bandwidth allocation, thereby improving the real-time response and service access capability of the time slot reservation mechanism, and improving the overall utilization rate of time slots through statistical reuse.

[0066] (4) The data link dynamic time slot allocation method based on preemptive reservation described in this invention supports the extended situational distribution application of the data link information distribution system on the one hand. Users can expand the content of situational distribution according to the current usage conditions and system requirements, so that it can carry additional information such as platform status, task status, and link status. On the other hand, it also supports the variable rate situational distribution application of the data link information distribution system. Users can reserve and use dynamically allocated time slots according to the current platform dynamics, so that it can carry high update rate situational information distribution, and dynamically adjust the time slot occupancy ratio at any time through the preemptive time slot reservation mechanism under the dynamic changes of the platform. Attached Figure Description

[0067] The accompanying drawings, which form part of this invention, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an undue limitation of the invention. In the drawings:

[0068] Figure 1 This is a schematic diagram of the micro-slotted network loop structure described in an embodiment of the present invention;

[0069] Figure 2 This is a schematic diagram of the preemptive time slot reservation process described in an embodiment of the present invention. Detailed Implementation

[0070] It should be noted that, unless otherwise specified, the embodiments and features described in the present invention can be combined with each other.

[0071] The present invention will now be described in detail with reference to the accompanying drawings and embodiments.

[0072] The existing Data Link Information Distribution System (DIDS) mainly uses static allocation for time slot resources, which cannot meet the dynamic bandwidth allocation requirements of small-scale flexible networking and sudden situational services. The existing distributed dynamic time slot allocation method uses fixed control time slots and multiple handshake mechanisms for time slot reservation, which has problems such as extended access waiting time and large signaling overhead, reducing the time slot utilization rate of the distributed coordination / reservation mechanism.

[0073] To address this, the present invention provides a distributed dynamic time slot reservation method based on preemptive reservation. On the one hand, it designs a network loop structure based on micro-time slots to meet the needs of large-capacity networking and basic situational exchange. On the other hand, user terminals that temporarily generate sudden situational services can initiate a single reservation at any idle time slot location, that is, successfully reserve available time slots with a high probability and obtain temporary bandwidth allocation, thereby improving the real-time response and service access capabilities of the time slot reservation mechanism, and improving the overall utilization rate of time slots through statistical reuse.

[0074] Typically, the steps of the "data link dynamic time slot allocation method based on preemptive time slot reservation" are as follows:

[0075] 1) Signaling slot contention multiplexing

[0076] The preemptive time slot reservation mechanism selects any idle micro-time slot to send a time slot reservation request. It needs to perform channel reconnaissance simultaneously within the current micro-time slot to listen for potential reservation requests from other user terminals. To address this, this invention proposes a frequency hopping and time hopping mechanism for simultaneous transmission and reception of wireless signals by multiple users. The principle is that multiple users send frequency hopping pulses at different start times within the same time slot. The frequency hopping patterns of each user are orthogonal or weakly correlated in the time domain, allowing the receiver to distinguish the frequency hopping signals of different users through parallel reception.

[0077] Typically, the probability of n users transmitting simultaneously without collision in the same time slot is:

[0078]

[0079] The number of requesting users that can be accommodated in a contention-based micro-slot is:

[0080] N tol =1+log(1-P) c_tol ) / log(1-T h / T jit (7)

[0081] In the formula, T h T is the pulse period of the synchronous frequency hopping system. jit For the delay jitter window, N tol This represents the maximum tolerable number of users. When the number of users N... tol As the number of collisions increases, the probability of collision (P) c_tol It will grow exponentially.

[0082] Typically, when the conflict probability P c_tol =0.1, pulse period T h = 6.4us, latency jitter window T jit At 0.64ms, a micro-slot can accommodate a maximum of 11 users' slot requests.

[0083] 2) Idle micro-timeslot listening

[0084] To ensure the effectiveness of distributed dynamic time slot reservation, each user terminal continuously monitors idle micro-time slots in the network during operation and stores them in the Idle_Slot_Table. Micro-time slot monitoring is periodic, and the micro-time slot state (Slot_State) in the Idle_Slot_Table includes three items: Dedicated, Used, and Idle.

[0085] a) Fixed-allocation microtime slots are microtime slots that are fixedly allocated to specific users in the network. They are used for network operation and maintenance, such as synchronization time slots, network management time slots, and voice, and are not allowed to be dynamically allocated.

[0086] b) The occupancy status of dynamically allocated micro-slots refers to the fact that micro-slots that have been occupied by other users need to wait for the user to finish using them and release them before they can enter the idle slot pool;

[0087] c) Dynamically allocating the idle state of micro-time slots refers to micro-time slots that are not occupied by other users, forming an available idle time slot pool that can be used to respond to sudden user requests and for flexible dynamic use.

[0088] 3) Time slot reservation request

[0089] When a user generates a sudden surge in service requests, the bandwidth (BW), service update rate (Duration), and duration (Period) required for that service are first estimated and then used to populate the fields in the time slot reservation request.

[0090] Then, based on the above information, the reservation request is encapsulated, a message priority field is attached, and the slot reservation request is sent in the nearest available micro-slot.

[0091] The preemptive time slot reservation allocation method sends a time slot reservation request in any idle micro-time slot, which can shorten the access waiting latency for sudden services.

[0092] 4) Reservation Conflict Analysis

[0093] In the latter half of the same micro-time slot, users participating in the time slot reservation can receive data in parallel, distinguish the reservation request signals of multiple users, and perform reservation conflict resolution based on the reservation request information of each user, including the following three aspects:

[0094] a) If there are no other users making reservation requests, the user making the reservation will have priority to occupy the current free time slot and the free micro time slot they applied for, and other users will update the free time slot table according to their reservation requests.

[0095] b) If the current micro-slot contains two or more user reservation requests, each user will parse the business priority of multiple user reservations. The user with the highest priority will occupy the reservation micro-slot first, and other users will update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-slot.

[0096] c) If there are multiple users with the highest priority, the first-come, first-served (FIFO) method is adopted. The decision is made based on the sending time (Tx_Stamp) of each user. The user who sends first has priority to occupy the reserved micro-time slot. Other users update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-time slot.

[0097] 5) Data transmission

[0098] Users who have obtained time slot reservations can send data for bursty services within their newly acquired time slots, supporting bursty short packet services, bursty situational services, and extended situational distribution services.

[0099] 6) Micro-timeslot release

[0100] To ensure fair competition and prevent users from permanently occupying dynamically allocated time slots, the system sets a maximum occupation period (Max_Tms_Period) for dynamically allocated time slots, ensuring that occupied micro-time slots are released promptly after service transmission is completed or micro-time slot occupation times out.

[0101] Through the preemptive time slot reservation mechanism based on signaling micro-time slot contention multiplexing, the distributed dynamic time slot allocation method can realize dynamic time slot reservation anytime and anywhere. It exchanges the improved time slot resource reuse rate and reduced access waiting latency with an extremely low probability of conflict, thereby improving the service throughput of the entire synchronous frequency hopping communication network.

[0102] Those skilled in the art will recognize that the units and method steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0103] In the several embodiments provided in this application, it should be understood that the disclosed methods and systems can be implemented in other ways. For example, the division of units described above is merely a logical functional division, and in actual implementation, there may be other division methods. For instance, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. The aforementioned units may or may not be physically separated. The components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments of the present invention according to actual needs.

[0104] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention, and they should all be covered within the scope of the claims and specification of the present invention.

[0105] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A data link dynamic time slot allocation method based on preemptive reservation, characterized in that, include: Optimization of the loop structure of the micro-timeslot network; Using the preemptive time slot reservation method, a time slot reservation request is initiated in any idle micro-time slot. While sending the request, channel listening is performed to detect time slot reservation requests from other user terminals. Within the current time slot, reservation conflict resolution is performed to determine whether the time slot reservation is successful. By utilizing the extended situational awareness distribution method, the content of situational awareness distribution is expanded according to the current usage conditions and system requirements, so that it can carry additional information on platform status, task status, and link status. By utilizing the variable-rate situational information distribution method, dynamic time slots are reserved and allocated according to the current platform dynamics to carry out the distribution of situational information with a high update rate. Under the dynamic changes of the platform, the time slot occupancy ratio is dynamically adjusted at any time through a preemptive time slot reservation mechanism. The optimization of the micro-timeslot network loop structure includes: Guarantee protection delay under specific communication coverage conditions. The requirement is expressed as follows: (1) In the formula, For maximum communication distance, The speed of light; The transmission efficiency of micro-slots should be no less than 50%, as expressed below: (2) In the formula, For effective signal transmission time, This is the micro-slot width, typically 2.5ms; The transmission rate of micro-slots ( It should be greater than a certain threshold value, as expressed below: (3) In the formula, For operating bandwidth, The modulation index, For coding efficiency, For frequency hopping rate, This refers to the pulse duty cycle. The word length of the data link message, in bits; The number of words in the basic situational information message. The typical value is 96kbps; Micro-slot width ( ) is much smaller than the time slot width of existing data link information distribution systems ( This allows the system to accommodate a certain number of users ( Doubling: (4) In the formula, For effective signal transmission time, For the micro-slot width, the typical value of k is 3, meaning that the user capacity under the micro-slot cyclic structure can reach 3 times that of the slot cyclic structure; By using the time slot concatenation method, several consecutive micro-time slots are concatenated to form a single time slot to carry more than n message words, enabling richer information content-based situational sharing and improving the system's network information exchange capability. The advantage of using time slot concatenation is that it can reduce the overhead of time slot protection intervals and improve transmission efficiency. (5) In the formula, M represents the number of cascaded time slots, with a value ranging from 1 to 2. m ; For cascaded time slot transmission efficiency, when M > 4, It will be greater than 90%, gradually approaching 1.

2. The data link dynamic time slot allocation method based on preemptive reservation according to claim 1, characterized in that, The optimization of the micro-timeslot network loop structure includes: Combining the requirements of communication coverage and transmission efficiency, a micro-timeslot structure design is carried out to meet the carrying capacity of a single timeslot and the needs of large-capacity networking, while also meeting the needs of extended transmission capacity for micro-timeslot cascading.

3. The data link dynamic time slot allocation method based on preemptive reservation according to claim 1, characterized in that, The method of using preemptive time slot reservation includes: Signaling slot contention multiplexing: Multiple users send frequency hopping pulses at different start times in the same time slot. The frequency hopping patterns of each user are orthogonal or weakly correlated in the time domain. At the receiving end, the frequency hopping signals of different users can be distinguished by parallel reception. The probability that n users can transmit simultaneously without collision in the same time slot is: （6） The number of requesting users that can be accommodated in a contention-based micro-slot is: （7） In the formula, T h T is the pulse period of the synchronous frequency hopping system. jit For the delay jitter window, N tol To determine the maximum tolerable number of users, when the number of users N... tol As the number of collisions increases, the probability of collision (P) c_tol It will grow exponentially; When the conflict probability P c_tol =0.1, pulse period Delay jitter window At any given time, a micro-slot can accommodate a maximum of 11 users' slot requests; Idle micro-slot listening: During the operation of each user terminal on the network, it continuously listens for idle micro-time slots in the network and stores them in the idle micro-time slot table. The micro-time slot listening is periodic with time slots as the time slots. The micro-time slot status packets in the idle time slot table are fixed in terms of allocation, occupation status, and idle status. When a user generates a sudden surge in business, the bandwidth, business update rate, and duration required for that business are first estimated and used to populate the fields in the time slot reservation request. Then, the reservation request is encapsulated according to the information, a message priority field is attached, and the slot reservation request is sent in the nearest available micro-slot. Appointment Conflict Analysis: In the latter half of the same micro-slot, users participating in slot reservation can receive data in parallel, distinguish the reservation request signals of multiple users, and resolve reservation conflicts based on the reservation request information of each user. Perform data transmission and micro-timeslot release.

4. The data link dynamic time slot allocation method based on preemptive reservation according to claim 3, characterized in that: The fixed-allocation microtime slots are microtime slots that are fixedly allocated to specific users in the network. They are used for network operation and maintenance, including synchronization time slots, network management time slots, and voice. Dynamic allocation is not allowed. The occupancy status of dynamically allocated micro-time slots refers to the fact that micro-time slots that have been occupied by other users need to wait for the user to finish using them and release them before they can enter the idle time slot pool. The idle state of dynamically allocated micro-time slots refers to micro-time slots that are not occupied by other users, forming an available idle time slot pool that can be used to respond to sudden user requests and for flexible dynamic use.

5. The data link dynamic time slot allocation method based on preemptive reservation according to claim 3, characterized in that, The scheduling conflict resolution includes: a) If there are no other users making reservation requests, the user making the reservation will have priority to occupy the current free time slot and the free micro time slots they have applied for, and other users will update the free time slot table according to their reservation requests. b) If the current micro-slot contains two or more user reservation requests, each user will parse the business priority of multiple user reservations. The user with the highest priority will occupy the reservation micro-slot first, and other users will update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-slot. c) If there are multiple users with the highest priority, the first-come, first-served (FIFO) method is adopted. The decision is made based on the sending time (TxStamp) of each user. The user who sends first has priority to occupy the reserved micro-time slot. Other users update the idle time slot table according to their reservation requests and initiate a new reservation request in the next idle micro-time slot.

6. The data link dynamic time slot allocation method based on preemptive reservation according to claim 1, characterized in that, The method of utilizing extended situational awareness distribution includes: By reserving consecutive micro-slots through a preemptive micro-slot reservation mechanism, cascading slot expansion can be formed, thereby enabling the carrying of more data link message content and enriching the information for situational distribution.

7. The data link dynamic time slot allocation method based on preemptive reservation according to claim 1, characterized in that, The variable-rate situational awareness distribution method includes: When the platform dynamics or target update rate of a specific user in the network change, the time slots are dynamically allocated based on the current platform dynamics to carry the distribution of situational information with a high update rate. Under the condition of platform dynamic changes, the time slot occupancy ratio is dynamically adjusted at any time through a preemptive time slot reservation mechanism.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by the processor, it implements the data link dynamic time slot allocation method based on preemptive reservation as described in any one of claims 1-7.

Images