A sequential adjustable deterministic arbitration method and system based on dynamic security root and downlink implicit authorization

Abstract

The application discloses a kind of sequential adjustable certainty arbitration method and system based on dynamic security root and downlink implicit authorization, belong to wireless communication technical field.The application optimizes two-step arbitration step sequence, first carries out resource availability pre-check and introduces temporary reservation mechanism, filters the user or service flow of intended resource unavailable, then carries out conflict arbitration to candidate entity, significantly improves system efficiency.The method simultaneously supports two arbitration granularity between users and service flows, and is uniformly applied to switching scene, determines available time for each service flow of switching user by iteration arbitration, realizes fair resource competition with target cell inventory user and seamless certainty switching across cells.The application is fully compatible with existing DSF framework, can significantly reduce invalid calculation and switching interruption time.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication technology, specifically relating to a multi-user / multi-service flow access and resource scheduling method in next-generation wireless communication systems (such as 5G-Advanced and 6G), and particularly a deterministic communication method and system that optimizes the order of two-step arbitration steps and introduces a temporary reservation mechanism. Background Technology

[0002] With the rise of new scenarios such as 6G, satellite internet, and industrial internet, wireless communication has placed unprecedented demands on latency, reliability, and connection density. This applicant is dedicated to the research of the Dynamic Security Foundation (DSF) technology system, aiming to fundamentally reconstruct the underlying paradigm of wireless communication. The core idea of ​​the DSF framework is to completely decouple the logical world from the physical world, using cryptographic primitives to guarantee the determinism of communication, with the physical world only providing an execution benchmark at the moment it is momentarily preempted.

[0003] In the DSF framework, two-step deterministic arbitration is the core mechanism for resolving the "modulo funnel" effect (i.e., inevitable collisions due to limited physical resources). The traditional two-step arbitration sequence is as follows: first, arbitration is performed between users to select a winning user, and then the availability of the winning user's intended resources is checked. This sequence has been successfully applied to multi-user, scheduling-free access scenarios.

[0004] With the further development of DSF technology, the applicant has further refined the arbitration granularity from between users to between service flows (see prior application 2026102049886). Each user equipment can run multiple service flows simultaneously, and each service flow corresponds to an independent protocol security state machine with its own priority and QoS requirements. Two-step arbitration needs to be performed at the service flow level to support fine-grained scheduling of multiple service flows within the same user.

[0005] However, in actual system operation, the inventors discovered that the order of the above steps could be optimized. When there are a large number of reserved resources in the system (such as periodic reservations for high-priority services), the resource intentions of many users or service flows may directly hit unavailable resources, yet still need to participate in conflict arbitration, causing unnecessary computational overhead. If the order can be reversed, and the "resource availability check" is performed first, filtering out users or service flows with unavailable intended resources, and then arbitrating conflicts for the remaining entities, system efficiency can be significantly improved and invalid computation can be reduced. In addition, the required resource status management mechanism also differs depending on the order of the check and arbitration.

[0006] Furthermore, the application scenarios for two-step arbitration should not be limited to initial access or ordinary data transmission. During mobility management (such as handover), the target cell also needs to perform unified resource arbitration for handover users (and their multiple service flows) from the source cell and existing local users (and their service flows). How to effectively apply two-step arbitration in handover scenarios and seamlessly integrate it with the source cell's DSF context remains an unsolved technical problem in this field. Summary of the Invention

[0007] The purpose of this invention is to provide a method for optimizing the order of two-step arbitration steps. By reversing the traditional order and introducing a temporary reservation mechanism, more efficient resource conflict resolution can be achieved. At the same time, the two-step arbitration is uniformly applied to handover scenarios and supports two arbitration granularities: between users and between service flows, to achieve seamless deterministic handover across cells.

[0008] To achieve the above objectives, the present invention provides the following technical solution: A sequentially adjustable deterministic arbitration method based on dynamic security foundations and downlink implicit authorization includes: Both communicating parties operate a protocol security state machine based on a shared dynamic security foundation DSF. The DSF includes at least a security key `K_sec`, an initial anchor `Init_Anchor`, and a state transition rule identifier `Rule_ID`, and achieves synchronization on the logical timeline defined by the state machine. At each logical decision moment, the user side calculates a pair of cryptographically associated resource intentions based on the current state `S(t)` of the DSF using a predetermined cryptographic function: uplink transmission resource intention `R_u` and downlink listening resource intention `R_d`; the network side performs the same protocol security state machine evolution as the user side, and independently calculates the same resource intentions at the same logical decision moment. At each logical decision-making moment, the network side performs the following two-step deterministic arbitration for all managed user devices and their service flows: (1) Resource availability pre-check: For each user equipment or service flow's resource intention `R_u`, query the global resource calendar maintained by the network side to determine whether the resource is available within the required transmission period; if available, perform temporary reservation for the resource and mark the user equipment or service flow as a candidate entity; if unavailable, directly determine that the arbitration of the user equipment or service flow has failed. (2) Conflict arbitration between entities: For each resource unit `r` selected by at least one candidate entity in step (1), identify all user equipment or service flow sets marked as candidate entities and with resource intention `R_u` as `r`, and select a winning entity from the set according to a preset, non-random arbitration rule; Based on the arbitration result, the network side executes the downlink implicit authorization: only valid downlink data frames are sent on the downlink resource `R_d` corresponding to the winning entity that succeeded in both arbitrations; for the entity that failed the arbitration, no valid data is sent on its corresponding `R_d` or a silent instruction is sent. The user side listens to the calculated `R_d` at the time of the logical decision. If a valid downlink frame is successfully decoded, it determines that it has been authorized and sends uplink data on the paired `R_u`; otherwise, it remains silent.

[0009] Preferably, the temporary reservation is time-limited. If subsequent conflict arbitration is not completed within a preset time, the temporary reservation is automatically released to avoid resource deadlock.

[0010] Preferably, if resources are occupied by a higher priority process (such as emergency switching or high priority business preemption) between steps (1) and (2), the candidate entity's eligibility is revoked and its temporary reservation is released.

[0011] Preferably, the preset arbitration rules include at least one or a combination of fixed priority arbitration based on preset static priority, round-robin fair arbitration that provides round-robin service to historical collision entities on the same resource, and earliest deadline priority arbitration based on data packet deadline.

[0012] Preferably, the resource availability pre-check step can be based on a global resource reservation table maintained by the network side, which records the occupancy status, occupant identity, and reservation information of each physical resource block in the future.

[0013] Preferably, the method may further include: if the resource availability pre-check passes, and subsequent conflict arbitration fails, the network side automatically releases the temporary reservation; if the conflict arbitration succeeds, the temporary reservation is converted into a formal reservation.

[0014] Explanation of DSF context In this invention, the context of the Dynamic Security Foundation (DSF) includes at least the security key `K_sec` (excluding other security parameters), the current logical state `S(t)`, and the rule identifier `Rule_ID`. For multi-service flow scenarios, the DSF context can be configured independently for each service flow. Each service flow has a unique logical channel identifier (LCID) and runs its own protocol security state machine based on the shared `K_sec` and independent `Init_Anchor` and `Rule_ID`. Optionally, the DSF context also includes resource reservation information that the user equipment has reserved but not yet executed in the serving cell. This resource reservation information records the transmission resources that the user equipment or a specific service flow has determined at one or more future logical decision moments.

[0015] Two-step arbitration application in switching scenarios The two-step arbitration method of this invention is also applicable to scenarios where user equipment switches from a source network device to a target network device. This scenario works in conjunction with the inventor's previously proposed asynchronous handover patent (application number 2026101471226) and autonomous access patent (application number 2026102049886), and the specific process is as follows: Switching preparation phase (based on the three-stage iterative arbitration of asynchronous switching patents): - The source network device (such as the source base station) determines, based on measurement reports or network decisions, that user equipment needs to be switched to the target network device.

[0016] - The source network device transmits the DSF context of the user equipment to the target network device through the Xn interface or the core network; the DSF context includes at least the security key `K_sec`, the current logical state `S(t)`, and the rule identifier `Rule_ID`; for multi-service flow scenarios, the DSF context may contain independent state information of multiple service flows.

[0017] - After receiving the DSF context, the target network device reconstructs a copy of the protocol security state machine that is synchronized with the user equipment (and its various service flows) locally.

[0018] - The target network device, based on the reconstructed protocol security state machine, simulates a series of logical decision moments for user equipment and its various service flows after the handover. For each candidate moment, it performs the two-step deterministic arbitration of this invention (first checking resource availability, then conflict arbitration) to determine one or more available logical decision moments that pass arbitration and the corresponding resources `(R_u, R_d)`. This iterative process is consistent with the three-stage decision-making in the asynchronous handover patent, ensuring that the earliest available transmission opportunity is found.

[0019] - The target network device will feed back the determined available time information (including the time and resource location corresponding to each service flow) to the user device through the source network device.

[0020] Switching between execution and access: - The source network device sends a handover command to the user equipment, which includes target cell synchronization information, target cell localized resource mapping parameters, and available time information.

[0021] - User equipment completes radio frequency retuning and synchronizes with the target cell at the specified available time (or in advance) according to the handover command.

[0022] - When the physical timeline of the target cell reaches the available moment, the user equipment calculates the resource intention based on its DSF context (which is synchronized with the target base station), and the calculation result is completely consistent with the prediction of the target base station in the iterative arbitration.

[0023] At this point, the target network device can directly confirm the transmission at that moment (since it has already won in the iterative arbitration) or perform a quick secondary confirmation (such as checking whether the resource has been preempted by a higher priority). If the confirmation is successful, the target network device sends a valid downlink frame on the downlink resource `R_d` corresponding to the user equipment. The user equipment listens and determines that it has been authorized, and then sends uplink data on the paired `R_u`.

[0024] - In rare cases where resources are preempted, causing secondary confirmation to fail, the user equipment will enter a retry mechanism, waiting for the next logical decision moment of its local state machine, while the network side will restart the iterative arbitration process.

[0025] Additional notes for dual-RF scenarios: For user equipment supporting dual radio frequency links, the method described in the independent access patent (application number 2026102049886) can be used to maintain the connection with the source cell while attempting to access the target cell during the handover process. In this case, the user equipment can operate independently based on the DSF image of the target cell, and attempt to access in parallel at multiple logical decision moments. Through the two-step arbitration of this invention, authorization is obtained, achieving seamless handover.

[0026] This process ensures that the various service flows of the user being switched over compete fairly for resources with the existing users / service flows of the target cell under the same arbitration framework, and the determination of the switching time strictly follows the iterative arbitration mechanism of the asynchronous switching patent.

[0027] Beneficial effects Compared with the prior art, the present invention has the following beneficial effects: 1. Improve arbitration efficiency: By checking resource availability in advance, a large number of users or business flows that intend to use unavailable resources are filtered out in advance, reducing the number of entities involved in subsequent conflict arbitration and reducing the computational overhead on the network side.

[0028] 2. Avoid invalid arbitration: In prior applications, the winning entity may lose the arbitration due to unavailable resources, resulting in a waste of arbitration resources; this invention ensures that the intended resources of all entities participating in conflict arbitration are temporarily reserved, and the resources are available as soon as the arbitration is successful, thus eliminating invalid arbitration.

[0029] 3. Introduction of temporary reservation mechanism: This invention designs temporary reservation and its timeout release, preemption cancellation and other mechanisms to ensure the consistency of resource status and the robustness of the system.

[0030] 4. Adjustable order: This invention provides an alternative arbitration order that complements the prior application, allowing system designers to flexibly select or dynamically switch between the two orders based on actual scenarios (such as the reservation ratio or computational load) to achieve optimal performance.

[0031] 5. Supports multi-granularity arbitration: This invention supports both inter-user and inter-service flow arbitration granularities, which can meet the fine-grained scheduling requirements of different QoS needs.

[0032] 6. Unified handover processing: This invention applies two-step arbitration to the handover scenario. It determines the available time for each service flow of the handover user through iterative arbitration, so that the handover user and the existing users of the target cell can compete for resources fairly under the same framework. There is no need for a separate random access process, and the handover interruption time is reduced to the sub-millisecond level.

[0033] 7. Fully compatible with existing DSF framework: This invention does not change the core philosophy of DSF (zero signaling, logical timeline, downlink implicit authorization), but only adjusts the order of arbitration steps, and can be seamlessly integrated into existing DSF systems. Attached Figure Description

[0034] Figure 1 This is the overall flowchart of the method described in this invention.

[0035] Figure 2 This is a diagram illustrating the resource availability pre-check and temporary reservation mechanism.

[0036] Figure 3 This is a schematic diagram comparing the two sequences of the present invention and the prior application.

[0037] Figure 4 This is a flowchart of the iterative arbitration timing process applied to switching scenarios in this invention. Detailed Implementation

[0038] To make the objectives, technical solutions, and advantages of the present invention clearer, the technical solutions of the present invention will be described in detail below with reference to the accompanying drawings and embodiments.

[0039] Example 1: Efficient Arbitration in Scenarios with High Reservation Ratios (Inter-User Granularity) Suppose a smart factory has deployed a DSF system, in which high-priority control flows have pre-reserved a large amount of resources in the global resource calendar. The resource intention `R_u` calculated by ordinary sensor nodes at the time of logical decision-making is likely to fall into the pre-reserved time-frequency resources.

[0040] According to the process of this invention: - At the logical decision-making moment, the network side performs a resource availability pre-check on all nodes and queries the global resource calendar. If it finds that a large number of nodes' `R_u` has been reserved, it directly determines that the arbitration of these nodes has failed and releases their temporary reservations (if they have already been temporarily reserved).

[0041] - A few remaining nodes have available `R_u` and are marked as candidate users. The network side performs conflict arbitration on these candidate users by resource grouping and selects a winner.

[0042] - The winner's temporary reservation becomes a formal holding, the network side sends a downlink implicit grant on its `R_d`, and the winning node sends uplink data on `R_u`.

[0043] In this embodiment, invalid arbitration requests are filtered out in advance, significantly improving arbitration efficiency.

[0044] Example 2: Arbitration of conflicts between multiple service flows within the same UE (inter-service flow granularity) Suppose an industrial robot is running two business flows simultaneously: a control flow (priority 1) and a video flow (priority 3). At a certain logical decision moment, the resource intentions `R_u` calculated by the two business flows are the same, both being resource r.

[0045] According to the process of this invention: - The network side first performs a resource availability pre-check on these two service flows, queries the global resource calendar, finds that resource r is available, performs a temporary reservation on both service flows, and marks them as candidate entities.

[0046] - In the inter-entity conflict arbitration step, the network side selects the control flow with higher priority from the two candidate service flows as the winning entity according to the preset priority rules.

[0047] - The network side sends a valid downlink frame on the downlink resource `R_d` corresponding to the control flow. The control flow determines that it has been authorized and sends uplink data on resource r. If the video stream arbitration fails, its temporary reservation is released and it waits for the next logical decision moment.

[0048] This embodiment demonstrates the application of the present invention in flow-level arbitration.

[0049] Example 3: Temporary Timeout and Preemption Handling If, after the resource availability pre-check passes but before conflict arbitration is completed, the resource is occupied by a higher-priority emergency handover process, the network side should revoke the candidate entity's eligibility and release its temporary reservation. Simultaneously, the entity will not receive an authorization signal on the downlink monitoring resource, thus requiring it to re-initiate a request at the next logical decision point.

[0050] If a temporary reservation times out due to network-side processing delays, the reservation will be automatically released, and the entity will need to participate in the next round of arbitration.

[0051] Example 4: Dynamic switching of sequence The system can be configured to dynamically switch between two arbitration orders based on real-time load. For example, when the resource reservation ratio exceeds a threshold, the check-then-arbitrate order of this invention is used; when the resource reservation ratio is low, the first-to-file arbitration-then-check order is used. The switching process is controlled by the network side and notified to the UE via RRC signaling, without affecting ongoing services.

[0052] Example 5: Iterative Arbitration and Availability Determination in Switching Scenarios (Multi-Service Flow Scenarios) The User Equipment (UE) is handing over from the source base station gNB-S to the target base station gNB-T. The UE is running two service flows in the source cell: Flow 1 (control) and Flow 2 (video), each with its own independent DSF context.

[0053] - Handover preparation phase: The source base station gNB-S sends a handover request to the target base station gNB-T through the Xn interface, carrying the complete DSF context of the UE's two service flows (including `K_sec`, the current logical state `S(t)`, `Rule_ID` and the corresponding LCID).

[0054] - After receiving the data, the target base station gNB-T rebuilds a copy of the protocol security state machine synchronized with the UE locally for each service flow.

[0055] - The target base station simulates a series of logical decision moments for each service flow after the handover based on the reconstructed state machine, and performs the two-step deterministic arbitration of the present invention on each candidate moment to iteratively determine the available transmission time of each service flow in the target cell.

[0056] - The target base station feeds back the determined available time information to the UE through the source base station.

[0057] - The source base station sends a handover command to the UE, which includes target cell synchronization information, localized resource mapping parameters, and available time information.

[0058] - According to the handover command, the UE completes the radio frequency handover and synchronizes with the target cell at the specified time. At that time, it calculates the resource intention based on its DSF context, completes two-step arbitration with the target base station, and obtains uplink transmission authorization.

[0059] This process is fully compatible with the iterative arbitration mechanism for asynchronous switching patents.

[0060] Industrial applicability This invention can be widely applied to all wireless communication systems requiring efficient and deterministic resource scheduling, and is particularly suitable for scenarios such as satellite communication, industrial internet, and large-scale IoT, where resource reservation ratios are high and invalid requests are numerous. This invention can significantly improve system efficiency. Furthermore, its application in handover scenarios can greatly reduce handover interruption time, providing key technical support for integrated air-space-ground networks.

Claims

1. A sequentially adjustable deterministic arbitration method based on dynamic security foundation and downlink implicit authorization, characterized in that, include: Both communicating parties operate a protocol security state machine based on a shared dynamic security foundation DSF. The DSF includes at least a security key `K_sec`, an initial anchor `Init_Anchor`, and a state transition rule identifier `Rule_ID`, and achieves synchronization on the logical timeline defined by the state machine. At each logical decision moment, the user side calculates a pair of cryptographically associated resource intentions based on the current state `S(t)` of the DSF using a predetermined cryptographic function: uplink transmission resource intention `R_u` and downlink listening resource intention `R_d`; the network side performs the same protocol security state machine evolution as the user side, and independently calculates the same resource intentions at the same logical decision moment. At each logical decision-making moment, the network side performs the following two-step deterministic arbitration for all managed user devices and their service flows: (1) Resource availability pre-check: For each user equipment or service flow's resource intention `R_u`, query the global resource calendar maintained by the network side to determine whether the resource is available within the required transmission period; if available, perform temporary reservation for the resource and mark the user equipment or service flow as a candidate entity; if unavailable, directly determine that the arbitration of the user equipment or service flow has failed. (2) Conflict arbitration between entities: For each resource unit `r` selected by at least one candidate entity in step (1), identify all user equipment or service flow sets marked as candidate entities and with resource intention `R_u` as `r`, and select a winning entity from the set according to a preset, non-random arbitration rule; Based on the arbitration result, the network side executes the downlink implicit authorization: only valid downlink data frames are sent on the downlink resource `R_d` corresponding to the winning entity that succeeded in both arbitrations; for the entity that failed the arbitration, no valid data is sent on its corresponding `R_d` or a silent instruction is sent. The user side listens to the calculated `R_d` at the time of the logical decision. If a valid downlink frame is successfully decoded, it determines that it has been authorized and sends uplink data on the paired `R_u`; otherwise, it remains silent.

2. The method according to claim 1, characterized in that, The temporary reservation is time-limited. If subsequent conflict arbitration is not completed within a preset time, the temporary reservation will be automatically released.

3. The method according to claim 1, characterized in that, If the resource is occupied by a higher priority process between steps (1) and (2), the candidate entity's eligibility is revoked and its temporary reservation is released.

4. The method according to claim 1, characterized in that, The preset arbitration rules include any one or a combination of the following: fixed priority arbitration based on preset static priority, round-robin fair arbitration that provides round-robin service to historical collision entities on the same resource, and earliest deadline priority arbitration based on data packet deadline.

5. The method according to claim 1, characterized in that, The global resource calendar records the occupancy status, occupant identity, and reservation information of each physical resource block over a future period.

6. The method according to claim 1, characterized in that, Also includes: If the resource availability pre-check passes, and subsequent conflict arbitration fails, the network side will automatically release the temporary reservation. If the dispute arbitration is successful, the temporary reservation will be converted into a formal occupancy.

7. The method according to claim 1, characterized in that, The method further includes the step of dynamically selecting the arbitration order based on the system load: when the resource reservation ratio is higher than a preset threshold, the first-check-then-arbitration order as described in claim 1 is adopted; when the resource reservation ratio is lower than the preset threshold, the first-arbitration-then-check order is adopted.

8. The method according to claim 1, characterized in that, The method is also applied to scenarios where user equipment switches from a source network device to a target network device, including: During the handover preparation phase, the source network device passes the DSF context of the user equipment to the target network device. The DSF context includes at least the security key `K_sec`, the current logical state `S(t)`, and the rule identifier `Rule_ID`, and may contain independent state information of multiple service flows. After receiving the DSF context, the target network device reconstructs the protocol security state machine locally, which is synchronized with the user equipment and its various service flows. Based on the reconstructed protocol security state machine, the target network device determines at least one logical decision moment when the user equipment and its service flow can be used for uplink transmission after the handover; At the logical decision moment after the user equipment switches to the target network device, the target network device incorporates the user equipment and its service flow into its two-step deterministic arbitration and executes the two-step deterministic arbitration as described in claim 1 to determine whether to grant the user equipment or its service flow uplink transmission permission.

9. The method according to claim 8, characterized in that, The DSF context also includes information on unreserved resources of the user equipment in the source cell.

10. A wireless communication system, characterized in that, Includes network equipment and at least one user equipment. The network device is used for: Synchronize with user equipment's dynamic security foundation, DSF; Maintain a protocol-secure state machine that is synchronized with each user device and its service flow; The resource intentions of each user device and its service flow are calculated independently at each logical decision point; Perform the two-step deterministic arbitration as described in any one of claims 1 to 9; Maintain a global resource calendar; The implicit authorization to proceed will be executed in accordance with the arbitration result; The user equipment is used for: Runs a protocol-secure state machine synchronized with the network side, supporting independent operation of multiple service flows; At each logical decision moment, calculate the paired resource intention `(R_u, R_d)`; Listen on `R_d` and autonomously determine authorization based on whether a valid downlink frame is received; Depending on the ruling, send data on `R_u` or remain silent.

11. A network device, characterized in that, It includes a processor and a memory, the memory storing a computer program, which, when executed by the processor, is used to implement the steps performed by the network side in the method of any one of claims 1 to 9.

12. A user equipment, characterized in that, It includes a processor and a memory, the memory storing a computer program, which, when executed by the processor, is used to implement the steps performed by the user side in the method of any one of claims 1 to 9.

Images