A TDMA time slot single decision and keep-alive allocation method, device and storage medium

Abstract

The application discloses a TDMA time slot single decision and keep-alive allocation method and device and a storage medium, belongs to the TDMA communication technical field, and aims at the pain points of poor link fluctuation adaptability, frequent allocation decision interaction failure, insufficient service continuity guarantee and missing link keep-alive capability of TDMA time slot allocation under a wireless unstable link environment. Through whole-process closed-loop time slot allocation control, efficient and reliable single decision allocation of the TDMA time slot under the wireless unstable scene is realized, and a whole-link keep-alive mechanism is built in to guarantee the node access stability and service continuity during link fluctuation.

Description

Technical Field

[0001] This invention relates to the field of TDMA communication technology, and in particular to a TDMA time slot single-time decision-making and keep-alive allocation method, device and storage medium. Background Technology

[0002] In TDMA networking, the central node typically receives requests from nodes and then performs time slot allocation. Existing solutions, in resource-constrained scenarios, often employ direct rejection or repeated attempts to reallocate slots.

[0003] In a stable wired environment, multiple retries are acceptable. However, in unstable wireless links, multiple retries increase interaction uncertainty, easily leading to configuration asynchrony, service jitter, and decreased system stability. Engineering practice shows that node service continuity usually takes precedence over strictly meeting all requirements in a single attempt. Therefore, an allocation mechanism is needed that can still strive to meet time slot resource allocation requests under single decision constraints and can keep the system alive in case of failure.

[0004] In daily practice, the existing technical solutions have been found to have the following problems: In unstable wireless link environments, TDMA time slot allocation suffers from several pain points, including poor adaptability to link fluctuations, frequent and easily failed allocation decision interactions, insufficient service continuity assurance, and lack of link keep-alive capability.

[0005] Therefore, it is necessary to provide a new technical solution to solve the above problems. Summary of the Invention

[0006] To address the aforementioned technical problems, this application provides a TDMA time slot single-shot decision and keep-alive allocation method, device, and storage medium, which are applied in unstable wireless links and can solve at least one of the aforementioned technical problems.

[0007] A TDMA time slot single-call decision and keep-alive allocation method is proposed, which adopts TDMA periodic scheduling. The time slot lengths of different types of time slots can vary. Downsizing only reduces the number of slots without changing the type or single time slot length. Furthermore, a final result must be generated within a single call, including: S1. Based on the maximum allocability of the time slot category, the TDMA time slot allocation control parameters are constrained and modified to ensure that the time slot allocation scheduling is within the executable range; S2. Back up the historical configuration of the target node, clear the old occupancy of the corresponding category of the target node, and form the baseline for this round of allocation; S3. Using the number of time slots to be allocated as the initial target, execute the hierarchical downsizing main loop to obtain the best and most effective time slot allocation result; S4. After the graded downgrade cycle is completed, the best effective result of time slot allocation is determined and handled in a unified graded manner according to the preset priority order. S5. Output TDMA time slot allocation decision results and execution status information.

[0008] Optionally, TDMA time slot allocation control parameters include: the number of time slots to be allocated, the minimum acceptable number, the downsizing step size, the time slot category, and the node identifier.

[0009] Optionally, the TDMA time slot allocation decision results and execution status information include: the number of time slots to be allocated, the minimum acceptable number, the final allocation number, whether downsizing has occurred, and the final status code.

[0010] Optionally, step S3 includes: Perform a full trial allocation according to the current objective; record the results of the current round and analyze them. If the results are better than the best historical results, update the best record; if the current round has met the objective, end the loop; if the quantity has been reduced to the minimum acceptable quantity, end the loop; otherwise, enter the next round of the tiered downsizing main loop.

[0011] Optionally, during the main cycle of tiered downsizing with the number of time slots to be allocated as the initial target, when the number of allocations in the current round is zero and still far from the minimum target, the fixed step size linear downsizing is no longer used, but a half-interval rapid downsizing is adopted.

[0012] Optionally, in step S4, when performing unified hierarchical judgment and corresponding processing on the best effective result of time slot allocation according to a preset priority order, the preset priority order includes: If a valid best result exists, submit the best result. If the optimal result reaches the number of time slots to be allocated, it is considered fully satisfied; If the optimal result is less than the number of time slots to be allocated but greater than zero, it is considered to be partially satisfied. If no valid new results are found but the historical configuration is available, rollback is executed and the system is determined to rollback and keep alive. If no valid new results are found and the historical configuration is unavailable, the process is considered a failure.

[0013] Optionally, in step S5, when outputting the TDMA time slot allocation decision result and execution status information, additional alarm information is provided for the upper-layer system to perform code rate adjustment, retry rhythm control, and operation and maintenance alarms.

[0014] Optionally, during the main cycle of tiered downsizing with the number of time slots to be allocated as the initial target, when the number of allocations in the current round is zero and still far from the minimum target, the downsizing strategy can adopt one of the following: exponential, segmented, or priority-weighted downsizing to replace the half-range rapid downsizing.

[0015] According to another aspect of this application, a computing device is also provided, comprising: a processor and a memory storing a computer program, wherein the computer program, when executed by the processor, performs the TDMA time slot single decision and keep-alive allocation method.

[0016] According to another aspect of this application, a computer-readable storage medium is also provided, on which computer instructions are stored, which, when executed on a computer, cause the computer to perform the TDMA slot single-decision and keep-alive allocation method.

[0017] Compared with the prior art, this application has at least the following beneficial effects: 1. This invention can improve node availability and business continuity under the constraint of a single allocation opportunity.

[0018] 2. This invention enables controlled resource reduction when resources are insufficient, avoiding direct rejection.

[0019] 3. This invention can roll back the old configuration and keep the node alive when reconfiguration is invalid, thus preventing the node from being cleared.

[0020] 4. This invention can reduce worst-case latency through a rapid downshifting mechanism, thus meeting the real-time requirements of embedded systems. Attached Figure Description

[0021] The following sections will describe some specific embodiments of the invention in detail by way of example and not limitation, with reference to the accompanying drawings. The same reference numerals in the drawings denote the same or similar parts or portions. Those skilled in the art should understand that these drawings are not necessarily drawn to scale. In the drawings: Figure 1 This is a schematic diagram of the overall process of the present invention. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0023] like Figure 1 As shown, a TDMA time slot single-call decision and keep-alive allocation method is applied to unstable wireless links. It employs TDMA periodic scheduling, allowing different time slot lengths for various time slot types. Downsizing only reduces the number of slots, without changing the type or single time slot length. Furthermore, a final result must be generated within a single call, including: S1. Based on the maximum allocability of the time slot category, the TDMA time slot allocation control parameters are constrained and modified to ensure that the time slot allocation scheduling is within the executable range.

[0024] The TDMA time slot allocation control parameters include: the number of time slots to be allocated, the minimum acceptable number, the downsizing step size, the time slot category, and the node identifier.

[0025] Specifically, the initial parameter set corresponding to this TDMA time slot allocation task is first obtained, including the number of time slots to be allocated, the minimum acceptable number, the downsizing step size, the time slot category, and the node identifier.

[0026] Subsequently, based on the preset TDMA time slot compliance verification rules adapted to unstable wireless links, constraint compliance verification was carried out on each parameter in the initial parameter set.

[0027] The system corrects non-compliant timeslot numbers, minimum acceptable numbers, downsizing steps, timeslot categories, and node identifiers identified during the verification process, providing a legal, valid, and unified parameter input basis for subsequent full-process timeslot allocation operations.

[0028] S2. Back up the historical configuration of the target node, clear the old occupancy of the corresponding category of the target node, and form the baseline for this round of allocation.

[0029] After completing the compliance correction of the time slot allocation parameters, back up the historical configuration of the target node, clear the old occupancy of the corresponding category of the target node, and form the baseline of this round of allocation. This is used to avoid old results interfering with new decisions. At the same time, if the re-allocation is invalid, perform old configuration rollback and keep-alive to prevent the node from being cleared. Specifically, this includes: Perform standardized initialization operations for the TDMA time slot allocation baseline environment adapted to unstable wireless links; first, load the preset standardized TDMA time slot allocation baseline configuration template for unstable wireless scenarios. The template contains core configurations such as standardized superframe structure definition, time slot type division rules (including service time slots, retransmission time slots, keep-alive time slots, and broadcast synchronization time slots), link status monitoring cycle, time slot allocation decision triggering conditions, keep-alive mechanism operation rules, and time slot conflict verification standards.

[0030] Based on the aforementioned revised compliant time slot allocation parameters, a unified initialization configuration was completed for allocation baseline thresholds, environmental operating variables, scheduling permission boundaries, and trial allocation execution rules. Specifically, this included upper and lower limits for time slot resource allocation baselines, real-time variable mapping for the current link status, delineation of the time slot scheduling permission of the master node and the time slot application permission of the slave node, and solidification of time slot conflict verification rules and link adaptation rules for a single trial allocation. At the same time, non-standardized environmental data, offline node temporary time slot configurations, expired link status variables, and redundant scheduling rules left over from the previous time slot allocation task were cleared. Finally, a unified, stable, reproducible, and standardized time slot allocation operating baseline environment adapted to the current wireless link status was constructed, providing a standardized operating foundation without differences for subsequent trial allocation operations and avoiding allocation decision deviations caused by random fluctuations in wireless links and historical residual configurations.

[0031] S3. Using the number of time slots to be allocated as the initial target, execute the hierarchical downsizing main loop to obtain the best and most effective time slot allocation result.

[0032] Tiered de-allocation refers to reducing the allocation quantity when resources are insufficient, without changing the time slot type or single time slot length.

[0033] Based on the standardized allocation baseline environment that has been initialized, the TDMA time slot fixed step size downgrade cyclic trial allocation process for unstable wireless links is initiated. This process is the core link of single-decision allocation, which can complete the time slot allocation decision without multiple rounds of interaction with wireless nodes, and is adapted to the interaction packet loss scenario caused by link instability.

[0034] Specifically, perform a complete trial allocation according to the current goal; record the results of the current round and analyze them. If the results are better than the best historical results, update the best record; if the current round has met the goal, end the loop; if the number has been reduced to the minimum acceptable quantity, end the loop; otherwise, enter the next round of the tiered downsizing main loop.

[0035] The number of time slots to be allocated is a non-negative integer parameter, and its effective value is constrained by the length of the allocable time window for that time slot category and the length of a single time slot for that category.

[0036] For any time slot category, let the allocatable window length for that category be... The length of a single time slot is Then the maximum number that can be allocated in this category is: ; The actual number of allocations that entered the allocation process was: ; in, Assign a quantity to the current round; As the initial goal, the current goal in the downgrade cycle is always... Monotonically decreasing within the interval; where the minimum acceptable quantity is... The following conditions must be met: .

[0037] Furthermore, during the tiered downsizing main loop, with the number of time slots to be allocated as the initial target, when the current allocation quantity is zero and still far from the minimum target, a fixed-step linear downsizing is no longer used; instead, a half-interval rapid downsizing mechanism is employed. This rapid downsizing mechanism reduces worst-case latency and meets the real-time requirements of embedded systems.

[0038] Specifically, the minimum target is the minimum acceptable quantity. This is used to limit the lower bound of the downshifting process, preventing the target number from decreasing indefinitely.

[0039] For any time slot category, let the allocatable window length for that category be... The length of a single time slot is The maximum number that can be allocated is: ; The allocation quantity is first adjusted to: ; The minimum target is revised as follows: ; Therefore, the following condition is always satisfied: ; Current goal from Starting point, only within the range Decrease internally, and adjust only once the minimum target is reached. Or, once the minimum target is reached, adjustments will be made below it, meaning further downshifting will cease and the gear will not be breached.

[0040] Furthermore, there are specific conditions for determining if the target is still far from the minimum target. The corresponding conditions are: the current round's allocation quantity is zero, and the distance between the current target and the minimum target is greater than a preset threshold (related to the downshift step size), only then is the "half-interval rapid downward movement" triggered; otherwise, it converges to the minimum target as usual.

[0041] The half-interval fast downshifting algorithm is a fast convergence algorithm for time slot downshifting based on the idea of ​​binary search. It is a targeted optimization mechanism that addresses the pain points of fixed step size linear downshifting in extreme failure scenarios, such as the current round allocation quantity being 0, the current gear being far from the minimum acceptable target, the number of invalid allocation attempts being large, the decision convergence being slow, and the time delay exceeding the standard.

[0042] Its core logic is: abandon the traversal mode of successive linear downgrading, take "the currently failed allocation level" as the upper bound of the interval and "the minimum acceptable number of time slots for the node (minimum target)" as the lower bound of the interval, and directly perform trial allocation by binary jump to the midpoint level of the current interval. Through the dynamic iterative shrinking of the interval, it can quickly locate the feasible time slot allocation level with a logarithmic convergence speed, completely skipping a large number of intermediate levels that are bound to fail, and greatly reducing the number of invalid trial allocations.

[0043] Furthermore, in step S3, when the current round allocation quantity is zero and the distance to the minimum target is still far, the downshift strategy can adopt one of the following: exponential, segmented, or priority-weighted downshift to replace the half-range rapid downward downshift.

[0044] S4. After the graded downgrade cycle ends, the best effective result of time slot allocation is determined and handled in a unified graded manner according to the preset priority order.

[0045] The preset priority order and corresponding handling include: If a valid best result exists, submit the best result. If the optimal result reaches the number of time slots to be allocated, it is considered fully satisfied; If the optimal result is less than the number of time slots to be allocated but greater than zero, it is considered to be partially satisfied. If no valid new results are found but the historical configuration is available, rollback is executed and the system is determined to rollback and keep alive. If no valid new results are found and the historical configuration is unavailable, the process is considered a failure.

[0046] The best result in this process refers to the result with the largest number of actual time slots allocated among all candidate results that meet the constraints in all trial allocation rounds of this call (including the corresponding time slot configuration table); if the number is tied, the one that is reached first is retained.

[0047] The optimal result in this process is a clearly defined and identifiable technical object, referring to the best result selected from all valid candidate results during each round of the tiered downgrade main loop in the same allocation call, i.e., each round of "trial allocation—evaluation—downgrade". The determination rule is as follows: The primary criterion is that the maximum number of time slots actually allocated is optimal. Results include not only the optimal allocation quantity, but also a complete time slot configuration table corresponding to that quantity; Validity conditions: The candidate result must meet the execution conditions such as the time slot length, allocation window range, and conflict constraints of this category; Concurrent allocation: When the actual allocation amount is the same in multiple rounds, retain the one that reached it first. This is implemented by updating the best record only if it is strictly better than the current best.

[0048] Therefore, if there is a valid best result in step S4, submitting the best result actually means submitting the time slot configuration table corresponding to the above-mentioned best candidate.

[0049] Furthermore, if the optimal result reaches the allocation quantity, it is considered fully satisfied when the optimal allocation quantity is equal to the legalized allocation quantity.

[0050] S5. Output TDMA time slot allocation decision results and execution status information.

[0051] The TDMA time slot allocation decision results and execution status information include: the number of time slots to be allocated, the minimum acceptable number, the final allocation number, whether downsizing has occurred, and the final status code.

[0052] After performing unified hierarchical judgment and corresponding processing on the best effective result of time slot allocation according to the preset priority order, the TDMA time slot allocation decision result and execution status information are output. This provides support for the standardized output of the final allocation result and the linkage support operation of the upper-layer system, realizes the seamless collaboration between the underlying time slot allocation mechanism and the upper-layer business system, and provides full-link system-level support for the keep-alive mechanism.

[0053] In this scheme, the output TDMA time slot allocation decision results and execution status information are stateful outputs, which can provide structured decision states and facilitate upper-layer strategy linkage. The stateful outputs include decision states such as "fully satisfied, partially satisfied, failed, and rollback-to-live" that can be directly used by the upper layer.

[0054] In addition, when outputting TDMA time slot allocation decision results and execution status information, alarm information can be attached for the upper-layer system to perform code rate adjustment, retry rhythm control and operation and maintenance alarms.

[0055] It should be noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the exemplary embodiments according to this application. As used herein, the singular form is intended to include the plural form as well, unless the context clearly indicates otherwise. Furthermore, it should be understood that when the terms "comprising" and / or "including" are used in this specification, they indicate the presence of features, steps, operations, devices, components, and / or combinations thereof.

[0056] It should be noted that the terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in sequences other than those illustrated or described herein.

[0057] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A TDMA slot single-shot decision and keep-alive allocation method, characterized in that, Using TDMA periodic scheduling, the lengths of different time slots can vary across multiple time slot types. Downgrading only reduces the number of slots, without changing the type or the length of a single time slot. Furthermore, a final result must be generated within a single call, including: S1. Based on the maximum allocability of the time slot category, the TDMA time slot allocation control parameters are constrained and modified to ensure that the time slot allocation scheduling is within the executable range; S2. Back up the historical configuration of the target node, clear the old occupancy of the corresponding category of the target node, and form the baseline for this round of allocation; S3. Using the number of time slots to be allocated as the initial target, execute the hierarchical downsizing main loop to obtain the best and most effective time slot allocation result; S4. After the graded downgrade cycle is completed, the best effective result of time slot allocation is determined and handled in a unified graded manner according to the preset priority order. S5. Output TDMA time slot allocation decision results and execution status information; Step S3 includes: Perform a full trial allocation based on the current objective; record the results of the current round and analyze them. If the results are better than the best historical results, update the best record; if the current round has met the objective, end the loop; if the quantity has been reduced to the minimum acceptable quantity, end the loop; otherwise, enter the next round of the tiered de-allocation main loop. When the number of time slots to be allocated is the initial target and the main loop of tiered downsizing is executed, if the number of allocations in the current round is zero and still far from the minimum target, the fixed step size linear downsizing is no longer used, but a half-interval rapid downsizing is used. The determination that the distance to the minimum target is still far also has clear conditions. The corresponding conditions are: the current round allocation quantity is zero, and the distance between the current target and the minimum target is greater than a preset threshold, then the half-interval rapid downward exploration is triggered; otherwise, it converges to the minimum target in the normal way; the preset threshold is related to the downshift step size.

2. The TDMA slot single-shot decision and keep-alive allocation method as described in claim 1, characterized in that, The TDMA time slot allocation control parameters include: the number of time slots to be allocated, the minimum acceptable number, the downsizing step size, the time slot category, and the node identifier.

3. The TDMA slot single-shot decision and keep-alive allocation method as described in claim 2, characterized in that, The TDMA time slot allocation decision results and execution status information include: the number of time slots to be allocated, the minimum acceptable number, the final allocation number, whether downsizing has occurred, and the final status code.

4. The TDMA slot single-shot decision and keep-alive allocation method as described in claim 3, characterized in that, In step S4, when performing unified hierarchical judgment and corresponding processing on the best effective result of time slot allocation according to a preset priority order, the preset priority order includes: If a best valid result exists, submit the best valid result; If the best effective result reaches the number of time slots to be allocated, it is considered fully satisfied; If the best valid result is less than the number of time slots to be allocated but greater than zero, it is determined to be partially satisfied. If no valid new results are found but the historical configuration is available, rollback is executed and the system is determined to rollback and keep alive. If no valid new results are found and the historical configuration is unavailable, the process is considered a failure.

5. The TDMA slot single-shot decision and keep-alive allocation method as described in claim 4, characterized in that, In step S5, when outputting the TDMA time slot allocation decision result and execution status information, additional alarm information is provided for the upper-layer system to perform code rate adjustment, retry rhythm control, and operation and maintenance alarms.

6. The TDMA slot single-shot decision and keep-alive allocation method as described in claim 5, characterized in that, When the number of time slots to be allocated is the initial target, and the main cycle of tiered downgrading is executed, if the number of allocations in the current round is zero and still far from the minimum target, the downgrading strategy can adopt one of the following: exponential, segmented, or priority-weighted downgrading to replace the half-range rapid downgrading.

7. A computer device, characterized in that, include: The processor and the memory storing a computer program, wherein the computer program, when executed by the processor, performs the TDMA time slot single decision and keep-alive allocation method as described in any one of claims 1 to 6.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, cause the computer to perform the TDMA slot single-decision and keep-alive allocation method as described in any one of claims 1 to 6.

Images