Deterministic communication state seamless switching and accessing method and system for asynchronous cellular network

Abstract

The invention provides a deterministic communication state seamless switching method and system and a deterministic communication state seamless access method and system for an asynchronous cellular network, and belongs to the technical field of 5G-Advanced / 6G mobility management. In order to solve the problems of time sequence breakage, resource mismatch and arbitration interruption of deterministic communication state transition in an asynchronous network, the invention provides a logic time axis cluster and main logic axis migration concept. The network side determines an earliest available resource for the main logic axis service of the target cell through iterative arbitration, and issues a configuration including a switching execution time window; and the user equipment keeps the logic state continuous by adopting a pause-queuing mechanism, completes switching in a time window and recovers deterministic transmission. Meanwhile, the invention provides an enhanced deterministic random access method, each user computes exclusive access resources through absolute time commitment of network broadcast, the base station adopts two-step deterministic arbitration to solve collision and provides a deterministic retry sequence for failed users, and bounded time delay access is realized. According to the invention, the full-process end-to-end hard deterministic service from initial access, service transmission to cross-cell switching is realized, and the interruption time and the signaling overhead are obviously reduced.

Description

Technical Field

[0001] This invention belongs to the field of mobility management and initial access technology for next-generation wireless communication systems (such as 5G-Advanced and 6G). Specifically, it relates to a method for seamless transition of user equipment (UE) between base stations (cells) in a scheduling-free hard deterministic communication system based on Dynamic Security Foundation (DSF) and Protocol Security State Machine (PSSM), as well as a deterministic random access method, system, and apparatus starting from a zero-knowledge state. Background Technology

[0002] Vertical applications such as industrial automation and remote control place stringent demands on the hard determinism of wireless networks (e.g., constant low latency, sub-millisecond jitter, and ultra-high reliability). The applicant's previous series of patent applications (hereinafter referred to as "preceding patents") constructed a revolutionary scheduling-free communication framework. Its core lies in: achieving zero-signaling parameter generation and synchronization based on the Dynamic Security Foundation (DSF) triple `(K_sec, Init_Anchor, Rule_ID)` and Protocol Security State Machine (PSSM); managing multi-user resource conflicts through "downlink implicit authorization" and "deterministic arbitration queues"; and introducing "unified anchor time `T_anchor`" and "dual fixed offsets `(Δ_downlink, Δ_uplink)`" to construct a hard deterministic timing chain, thereby achieving efficient, secure, and deterministic communication within a single cell.

[0003] In describing the handover and random access procedures, the previous patent implicitly assumed two idealized assumptions for simplicity: strict network time synchronization and ideal availability of target cell resources. In a synchronized network that satisfies these assumptions, the described procedures are correct and efficient ideal special cases.

[0004] However, in actual large-scale asynchronous network deployments, the physical clocks of different base stations have inherent deviations, and the resource pool configurations may differ. Therefore, the above assumptions do not hold, leading to three fundamental challenges to the ideal handover and access process outlined in previous patents: 1. Timing Discontinuity: There is no definite mapping relationship between the logical timeline of the source cell and the physical timeline of the target cell.

[0005] 2. Resource mismatch: Due to different resource mapping parameters such as the size of the "modulus funnel" (`M`), the physical resources calculated in the target cell for the same DSF state may be invalid or already occupied.

[0006] 3. Arbitration interruption: The resource reservation commitment of the source community becomes invalid in the independent arbitration system of the target community.

[0007] Furthermore, traditional contention-based random access and its random backoff mechanism are fundamentally contrary to the predictability required by deterministic communication.

[0008] The existing 5G NR handover process heavily relies on dynamic signaling (measurement reports, handover commands, random access) and real-time coordination between base stations (Xn), resulting in long interruption times (typically tens of milliseconds) and uncertain latency. Furthermore, its random access mechanism exhibits random behaviors such as collisions and backoffs, failing to provide bounded latency guarantees.

[0009] Therefore, there is an urgent need for an innovative approach that, while inheriting the core advantages of previous patents such as "zero signaling" and "deterministic arbitration," systematically addresses the challenges of switching and access in asynchronous environments, while also treating ideal synchronous scenarios as an acceptable special case, thereby achieving end-to-end hard deterministic services throughout the entire process from initial access to mobile connection. Summary of the Invention

[0010] This invention aims to solve the aforementioned technical problems and provide a systematic method, system, and apparatus. The core contributions of this invention are twofold: First, it proposes the concept and process of migrating logical time axis clusters and the main logical axis, simplifying the complex multi-service flow switching problem in asynchronous networks into an iterative arbitration problem of future transmission opportunities for a single main logical axis; second, it proposes an enhanced deterministic random access process, transforming traditional contention-based access into a time-bounded deterministic process. Both share the core philosophies of "decoupling logic and physics" and "deterministic arbitration," together constituting a complete deterministic communication mobility solution.

[0011] I. Core Concept System 1. Logical Decision Moment (`T_logic`): A discrete event triggered by the internal logic evolution of the PSSM, indicating "the need for a communication decision". It is decoupled from physical time.

[0012] 2. Unified Anchor Time (`T_anchor`): An absolute physical time obtained by reading the physical layer synchronization clock of the current serving cell when the `T_logic` event occurs. `T_anchor` is the reference for this transmission, `T_DL = T_anchor + Δ_downlink`, `T_UL = T_anchor + Δ_uplink`. This concept is entirely inherited from the previous patent.

[0013] 3. Logical Timeline Cluster: A set of logical timelines formed by multiple service flows (PSSMs) within a UE. They maintain a strict and known relative synchronization relationship through a shared hardware clock reference or a logical clock offset pre-configured by the network.

[0014] 4. Main Logical Axis: A business flow logical axis selected from the "Logical Time Axis Cluster" to serve as the benchmark and guide for state transitions during the switching process of the entire cluster. Selection criteria may include: highest priority, most stable business cycle, or highest data activity.

[0015] 5. Handover Execution Anchor (`HO_Anchor`): An absolute physical moment determined and issued by the target cell for the UE to perform radio frequency handover (such as carrier retuning, timing synchronization). It is independent of the PSSM of any traffic flow.

[0016] 6. Localized Resource Mapping Parameters (`Local_Map_Param`): This refers to a set of publicly available parameters required within a cell to deterministically map an infinite range of values ​​(such as the cryptographic hash intermediate value `V`) calculated based on DSF and PSSM onto the cell's finite physical time-frequency resource grid. Its core includes at least: - Total number of resource units (`M`): The modulus used in the modulo operation `Resource_Index = V mod M` determines the size of the "modulo funnel".

[0017] - Resource grid offset (`Offset_Time`, `Offset_Freq`): The starting time-frequency position of the physical resource grid.

[0018] These parameters are broadcast by each cell via System Information (SIB). The deterministic communication behavior of a service flow is defined by its DSF, PSSM, and the `Local_Map_Param` of its current serving cell.

[0019] Technical Notes: Supplementary Explanation > Timing Summary: To ensure that the UE can reliably start listening for downlink grants at time `T_DL_success`, the above-mentioned critical moments satisfy the following deterministic relationship chain: > ``` (The window must arrive later than the command) T_cmd_received + T_ue_proc ≤ HO_Anchor_Window_start (The window must be created before the authorization time) HO_Anchor_Window_end = T_DL_success - T_rf_tune (Anchor point is inside the window) HO_Anchor_Window_start ≤ HO_Anchor ≤ HO_Anchor_Window_end (Success time is determined by arbitration) T_DL_success = T_anchor_success + Δ_downlink_tgt > ``` Where `T_cmd_received` is the physical time when the UE actually receives the handover command. The width of `HO_Anchor_Window` (`Window_End - Window_Start`) is a deterministic protection band designed by the system to absorb uncertainties such as signaling transmission delay and asynchronous clock deviation. With proper configuration, this mechanism minimizes service interruption time while ensuring 100% handover success.

[0020] II. A General Switching Method for Asynchronous Networks: Main Logic Axis Migration and Three-Phase Iterative Arbitration To address the challenges of asynchronous switching, this invention proposes a three-stage timing decision-making method.

[0021] 1. Handover Trigger and Logical Context Transmission: The source base station (gNB-S) sends a handover request to the target base station (gNB-T), which contains only the logical context: the DSF of the main logical axis, the current logical state snapshot `S(t_now)`, the priority; and the DSFs of other service flows and the logical tick offset relative to the main logical axis.

[0022] 2. Target-side three-stage timing decision: Execute upon receiving the gNB-T (e.g., Figure 3 (as shown) Phase 1: Determining the physical feasibility boundary. gNB-T calculates the earliest feasible downlink grant time `T_DL_min_feasible`. This time is the theoretically earliest time when the UE can complete all signaling processing and begin listening to the target downlink signal. The calculation includes a guard interval `T_guard` to absorb signaling transmission, processing, and clock uncertainties. `T_DL_min_feasible` serves as the absolute time threshold for selecting candidate times.

[0023] Phase Two: Iterative Arbitration to Find the Earliest Available Resource. gNB-T reconstructs the main logical axis PSSM and simulates its future logical moments. For each simulated moment `t_logic`, its `T_anchor` and `T_DL_candidate` in the target cell are calculated. Key steps: a) Resource intentions `R_u` and `R_d` must be calculated using the target cell's `Local_Map_Param_tgt` (especially `M_tgt`); b) A candidate moment only enters the arbitration sequence if `T_DL_candidate >= T_DL_min_feasible`. Subsequently, a two-step deterministic arbitration is performed sequentially on the moments in the sequence. 1. User Conflict Arbitration: Based on the global view of the target cell, check whether, at the current candidate logical moment, there are other users (whose PSSM is also mapped to the same `T_anchor`) whose calculated uplink resource intention `R_u` is the same. If so, select the winner according to preset deterministic rules (such as priority).

[0024] >2. Final determination of resource availability: Query the global resource calendar of the target cell and check whether the winner's intended resource `R_u` is "idle" or "reserved by the winner" at the corresponding `T_UL` (`= T_anchor + Δ_uplink_tgt`).

[0025] Continue iterating until the first logical moment `t_success_logic` where both arbitration steps are successful is found. The corresponding `T_DL_success` is the final determined downlink authorization moment.

[0026] Phase 3: Determine the handover execution time window and anchor point. After determining `T_DL_success`, gNB-T needs to plan the specific timing for the UE to perform radio frequency handover.

[0027] - Calculate the time window boundaries: gNB-T calculates a handover execution time window (`HO_Anchor_Window`). The end boundary of this time window (`Window_End`) must reserve time for RF tuning and downlink synchronization for the UE: `Window_End = T_DL_success - T_rf_tune`. The start boundary of the time window (`Window_Start`) must ensure that the UE has sufficient time to receive and process the handover command, typically set to: `Window_Start = T_DL_min_feasible - T_guard`, or an earlier, aligned physical moment estimated based on signaling transmission rate. `Window_Start` and `Window_End` together define the time range within which the UE can safely perform RF handover.

[0028] - Determine the handover execution anchor point: gNB-T specifies a handover execution anchor point (`HO_Anchor`) within `HO_Anchor_Window` as the preferred time to suggest the UE to perform the handover (e.g., set to `Window_Start` or the middle of the window). `HO_Anchor` satisfies: `Window_Start ≤ HO_Anchor ≤ Window_End`.

[0029] - Information delivery: gNB-T will deliver `HO_Anchor_Window`, `HO_Anchor` (both expressed in target cell system frame / time slot or absolute time), and `Local_Map_Param_tgt` to the UE together. If the localized resource mapping parameters of the target cell and the source cell are different, Local_Map_Param_tgt must be included in the handover configuration information for the UE to update its resource mapping calculation base.

[0030] 3. UE Behavior Management (Pause-Queuing Mechanism): After the handover process is initiated, the UE enters a "pause-queueing" state (e.g., Figure 4 (This pauses business data transmission, but PSSM continues to run to ensure logical continuity.)

[0031] 4. Handover Execution and Service Recovery: The UE performs radio frequency handover within `HO_Anchor_Window`. After handover, the main logical axis resumes transmission on reserved resources at time `t_success_logic` using the new `Local_Map_Param_tgt`. ​​Other service flows are restored in an orderly manner according to their logical offsets.

[0032] III. Synchronous Network Switching as a Special Case When the network is synchronized and the resource pool is consistent, the method of this invention naturally degenerates into an efficient and simplified ideal process (such as...). Figure 5 At this point, the threshold for `T_DL_min_feasible` is extremely low, iterative arbitration usually succeeds on the first attempt, `Local_Map_Param` does not need to be updated, and `HO_Anchor_Window` can be set to a precise point. This process is the ideal switching form described in the preceding patent, proving the universality of this invention and its consistency with the preceding patent.

[0033] IV. Enhanced Deterministic Random Access Methods To achieve a smooth transition from a zero-knowledge state to a deterministic connected state, this invention proposes an enhanced deterministic random access method. The core difference between this method and the access process in previous patents lies in the introduction of a "two-step deterministic arbitration" mechanism, which is of the same origin as the connected state, to resolve collisions, and the provision of a "deterministic retry sequence" to ensure that the worst-case access delay has a deterministic upper bound.

[0034] The detailed process is as follows (in conjunction with...) Figure 6 ): 1. Network Broadcast Commitment: Network devices (base stations) periodically broadcast a deterministic access opportunity announcement via a System Information Block (SIB). This announcement is a network-digitally signed (`Sig`) data structure that must contain: Access Anchor (`ACCESS_ANCHOR`): A future, absolute physical time reference (such as GNSS time or a future, clearly defined system frame number (SFN) and time slot number).

[0035] Fixed access offset `(Δ_MsgA, Δ_MsgB)`: Used to determine the start time of the access request (MsgA) sending window `T_MsgA = ACCESS_ANCHOR + Δ_MsgA`, and the start time of the access response (MsgB) listening window `T_MsgB = ACCESS_ANCHOR + Δ_MsgB`.

[0036] Two-dimensional access resource pool definition: A time-frequency resource grid dedicated to this access, with a size of `N_slot` (micro-slot) × `M_freq` (frequency domain unit), which constitutes the `Local_Map_Param` for this access.

[0037] Access Opportunity Tag (`Access_ID`): A unique identifier for this broadcast, used to prevent replay.

[0038] 2. UE-side dedicated resource calculation and MsgA transmission: After the UE that needs to access listens and verifies the signature: Generate a temporary identity `Temp_ID`.

[0039] Perform deterministic resource mapping computation: ``` Root = Hash(Sig || Access_ID || ACCESS_ANCHOR || PCI) Resource_Index = Hash(Root || Temp_ID) mod (N_slot * M_freq) slot_offset = Resource_Index / M_freq freq_index = Resource_Index mod M_freq ``` Based on this, it is determined that: MsgA transmits resource `R_u_msgA` (time domain: `T_MsgA + slot_offset * T_symbol`, frequency domain: `freq_index`) and the paired downlink listening resource `R_d_msgB`.

[0040] At the absolute time `T_MsgA + slot_offset * T_symbol`, MsgA (carrying `Temp_ID`) is sent on `R_u_msgA`.

[0041] 3. Two-step deterministic arbitration on the network side (core innovation): The base station detects within the receiving window corresponding to `T_MsgA`.

[0042] For each resource unit `R_u` that detects energy, attempt to decode MsgA. If multiple different `Temp_ID`s are successfully decoded (i.e., a collision occurs), a two-step deterministic arbitration is triggered: Step 1: Conflict Set Identification. Decode and obtain the conflicting UE identity set `{ID1, ID2, ...}`.

[0043] Step 2: Deterministic Competition Resolution. A winning UE is deterministically selected from the conflict set based on a pre-defined, non-random, publicly broadcast rule in the SIB. Example rules are: `winner = arg min(ID_i)` (selecting the minimum `Temp_ID`) or `winner = arg min(Hash(ID_i || Access_ID))`.

[0044] This arbitration process is deterministic, transforming random collision events into a predictable ordering problem.

[0045] 4. MsgB Response and State Transition: At time `T_MsgB`, the base station: For each UE that wins the arbitration, a MsgB is sent on its paired resource `R_d_msgB`. The MsgB must contain: a contention resolution identifier (the UE's `Temp_ID`), a timing advance (TA), and a dedicated DSF triple `(K_sec, Init_Anchor, Rule_ID)` generated for the UE via a secure channel protected by a temporary key K_temp, for subsequent connected-state scheduling-free communication. The `K_temp` is established during the MsgA / MsgB interaction or through pre-shared information.

[0046] For each UE that fails arbitration, send a specific "silence indication" signal (or keep no signal) on its paired resource `R_d_msgB`.

[0047] Each UE listens on its own `R_d_msgB`. Access is considered successful only if a MsgB containing its own `Temp_ID` is successfully decoded, and the DSF is applied to enter the connected state; otherwise, access is considered unsuccessful.

[0048] 5. Deterministic retry mechanism (provides an upper bound on latency): The base station can pre-broadcast an ordered deterministic retry sequence in the SIB, containing a series of future access opportunity announcements `{ACC_OPPORTUNITY_1, ACC_OPPORTUNITY_2, ..., ACC_OPPORTUNITY_K}`.

[0049] For a UE that fails to access the network, it deterministically selects the `Retry_Index`th opportunity in the sequence as the next access opportunity based on its own `Temp_ID` and a publicly available hash function (such as `Retry_Index = Hash(Temp_ID || “RETRY”) mod K`).

[0050] Therefore, there is a pre-calculated upper bound for the worst-case access delay of each UE: `Max_Access_Delay ≤ (ACCESS_ANCHOR_K + Δ_MsgB) - Trigger_Time`.

[0051] V. Deterministic Delay Performance Analysis To quantitatively demonstrate the superiority of this invention, particularly the deterministic delay guarantee it provides, this section presents a mathematical modeling analysis of the switching delay. The following parameters are defined: `T_proc_xn`: Toggle request / response processing and transmission time on the Xn interface (fixed value, usually <5ms).

[0052] `T_rrc_tx`: Transmission time of the switching command over the air interface (fixed value, approximately 1-2ms).

[0053] `T_ue_proc`: The time it takes for the UE to process the handover command and prepare for handover (fixed value, approximately 1-3ms).

[0054] `T_rf_tune`: Time required for UE radio frequency retuning and downlink synchronization with the target cell (fixed value, approximately 0.1-0.5ms).

[0055] `T_dsf`: The PSSM logical update cycle of the main logical axis business flow (e.g., rule B can be 0.125ms, 0.25ms, 0.5ms, etc.).

[0056] `M`: The total number of resource units in the target cell used for this service (`M_tgt`).

[0057] `K`: The number of logical decision moments required to simulate in the iterative arbitration process to find the first successful moment.

[0058] The upper bound of the total handover delay (`T_total_ho`) is the total time from when the UE triggers the measurement report to when the main logical axis successfully resumes transmission in the target cell. Its worst-case upper bound can be expressed as: ``` T_total_ho_max = T_proc_xn + T_rrc_tx + T_ue_proc + (K_max * T_dsf) +T_rf_tune ``` Here, `K_max` is the maximum possible value of `K`. In the worst-case theoretical conflict scenario, the upper bound of `K_max` is the total number of resource cells `M` in the target cell. This is because at most `M` different phase traffic flows can occupy a single resource cell in turn, requiring a wait of `M-1` cycles in the worst case. Therefore, the upper bound of the deterministic delay is: ``` T_total_ho_max_deterministic = T_proc_xn + T_rrc_tx + T_ue_proc +((M-1) * T_dsf) + T_rf_tune ``` In actual asynchronous deployments, due to the random distribution of the initial PSSM phase of each UE, the expected value of `K` is much smaller than `M`. The key value of this formula is that it provides a pre-calculated, absolutely guaranteed upper bound on latency for any service.

[0059] Compared to traditional 5G handover latency: Traditional 5G handover latency `T_ho_5g` mainly includes measurement reporting, handover decision, and random access procedures (including possible contention and backoff), with typical values ​​ranging from 20-100ms. It also lacks a definite upper bound and exhibits long-tail latency. In contrast, the solution of this invention: 1. Order-of-magnitude reduction in latency: For typical industrial scenarios (M=50, T_dsf=0.25ms), even in the worst-case scenario, (M-1)*T_dsf ≈ 12.25ms. Adding other fixed delays (approximately 10ms), the upper bound of total latency is about 22.25ms, and the actual average latency is far lower than this. For high-frequency services (T_dsf=0.125ms), the advantage is even more pronounced.

[0060] 2. Deterministic Guarantee: The latency of traditional solutions is statistical and subject to unpredictable jitter. This invention provides a mathematically provable upper bound on latency, as shown in the formula, achieving a fundamental leap from "statistical" to "deterministic".

[0061] 3. Predictability and plannability: Network planners can reverse-engineer the required system parameter configurations (such as `M`, `T_dsf`) based on service QoS requirements (latency upper bound) to achieve precise performance planning.

[0062] VI. System and Device Implementation A network device (such as a base station or gNB) implementing the present invention includes a processor, a memory, a transceiver, and a core network interface. The processor executes a stored program to implement, for example... Figure 7 Key functional modules shown: - Logical Time Axis Cluster Management Module: Maintains the PSSM context of each service flow of connected UEs and the phase relationship between them.

[0063] - Main logical axis selection and context extraction module: When switching is triggered, the main logical axis is selected according to the strategy, and the logical context is assembled for transmission.

[0064] - PSSM Simulation and Iterative Arbiter: Receives the logical context, reconstructs and simulates the PSSM evolution, and performs an iterative two-step arbitration of resource intentions.

[0065] - Local timing and mapping parameter decision maker: Determines and manages the service fixed offset `(Δ_downlink_tgt, Δ_uplink_tgt)`, access offset `(Δ_MsgA, Δ_MsgB)`, and `Local_Map_Param_tgt` of the target cell.

[0066] - Global Resource Calendar: A data structure that stores the resource occupancy status and reservation information for a future period of time, supporting resource reservation, querying, locking, and timeout release.

[0067] - Deterministic Access Processor: Generates and broadcasts access opportunity announcements; receives MsgA and performs two-step deterministic arbitration; generates and sends MsgB and silence indications; manages deterministic retry sequences.

[0068] - Handover Coordination and Signaling Control Module: Handles handover signaling interactions with the core network and other base stations.

[0069] A user equipment (UE) implementing the present invention includes a processor, a memory, a transceiver, and a security element. The processor executes a stored program to implement, for example... Figure 8 Key functional modules shown: - Multi-PSSM engine and phase relationship maintenance module: Simultaneously runs PSSM for multiple service flows and strictly maintains the logical clock offset relationship between them.

[0070] - Local Map Parameter Memory: Securely stores the `Local_Map_Param` currently used by each business flow.

[0071] - Switching Behavior Controller: Controls the entry and exit of the "pause-queue" state, and manages the uplink transmission pause and pending data queue.

[0072] - Timing and RF control module: Performs RF switching and resynchronization at precise `HO_Anchor` times.

[0073] - Deterministic Access Calculation and Execution Module: Listens for and verifies access opportunity broadcasts; calculates dedicated access resources; sends MsgA at a predetermined time; listens for MsgB or a silent indication on paired resources; and executes deterministic retry logic.

[0074] - Security pilot frame processing module (preferred): Generates and parses security pilot frames for efficient and secure signaling (such as measurement reports and handover commands).

[0075] Beneficial effects

[0076] Compared with existing 5G NR handover and random access technologies, the advantages brought by this invention are revolutionary: 1. Provides a mathematically provable upper bound for deterministic delay: Through rigorous modeling and analysis (as shown in Part 5), this invention provides for the first time a deterministic worst-case delay upper bound `T_total_ho_max_deterministic` for the switching process in asynchronous networks, realizing a fundamental leap from traditional statistical delay to hard deterministic delay, and meeting the stringent requirements of critical business operations such as industrial control.

[0077] 2. Significantly reduce handover interruption time: Through the "pause-queue" mechanism and deterministic resource reservation, the handover interruption time of critical business flows is reduced from tens of milliseconds in traditional solutions to sub-milliseconds (RF retuning time). Combined with logical waiting time, the total latency is reduced by 1-2 orders of magnitude compared to traditional solutions.

[0078] 3. Overcame the mobility challenges in asynchronous networks: systematically solved the three major challenges of timing breaks, resource mismatch, and arbitration interruption, and for the first time achieved seamless and predictable handover of scheduling-free hard deterministic communication in asynchronous cellular networks.

[0079] 4. Achieved determinism throughout the entire lifecycle: From deterministic random access with upper limits of latency, to hard deterministic service transmission, and then to inter-cell handover with predictable queuing delays, it provides end-to-end deterministic behavior guarantees for services.

[0080] 5. Extremely low signaling overhead, eliminating signaling storms: handover only transmits logical context, with no dynamic resource allocation signaling; random access uses deterministic arbitration instead of competition, greatly reducing control plane overhead and overload risk.

[0081] 6. The patent system has been unified and improved: the "ideal switching" under the synchronous network is clearly defined as an efficient special case of the general method of this invention, thus providing a rigorous application boundary and implementation basis for the previous patents. Attached Figure Description

[0083] Figure 1 This is a schematic diagram of the concept of logical time axis cluster and main logical axis migration proposed in this invention.

[0084] Figure 2 It is a sequence diagram of the complete process of migrating the main logical axis for asynchronous networks.

[0085] Figure 3 This is a detailed flowchart of the three-stage iterative arbitration and parameter decision-making process performed on the target base station side.

[0086] Figure 4 This is a flowchart of user device-side handover behavior management (pause-queue mechanism).

[0087] Figure 5This is a schematic diagram illustrating how the method of this invention degenerates into an ideal handover process (soft handover / diversity) under a synchronous network.

[0088] Figure 6 This is a detailed sequence diagram of the enhanced deterministic random access procedure.

[0089] Figure 7 This is a functional block diagram of the network device (base station) that implements the present invention.

[0090] Figure 8 This is a functional block diagram of the user equipment (UE) that implements the present invention. Detailed Implementation

[0092] To make the objectives, technical solutions, and advantages of the present invention clearer, a detailed description is provided below in conjunction with the accompanying drawings and specific embodiments.

[0093] Example 1: Deterministic Switching and Delay Analysis of Asynchronous Smart Factory AGVs Scenario and parameters: The AGV moves from workshop A base station (gNB-A, `M_A=100`) to the asynchronous workshop B base station (gNB-B, `M_B=50`). Its motion control flow (main logic axis) adopts rule B, `T_dsf = 0.25ms`. Fixed delay parameters: `T_proc_xn=3ms`, `T_rrc_tx=1ms`, `T_ue_proc=2ms`, `T_rf_tune=0.2ms`.

[0094] Process (combined) Figure 2 , Figure 3 ): 1. After the AGV reports the measurement report, it enters the "pause-queue" state.

[0095] 2. gNB-A sends a handover request (including logical context) to gNB-B.

[0096] 3. gNB-B performs a three-stage decision-making process. In stage two, the localized resource mapping parameters of the target cell (`Local_Map_Param_tgt`, where `M_tgt = 50`) are used to calculate resource intentions and perform iterative arbitration. Assuming that due to asynchronicity and resource contention, arbitration succeeds at the `K=8`th logical decision time (i.e., after `8 * 0.25ms = 2ms`), and the resource is locked.

[0097] 4. gNB-B issues a switching command, setting `HO_Anchor_Window` to `[4ms, 5.8ms]` after the current time.

[0098] 5. The AGV switches within a time window (e.g., 5ms) and resumes transmission in `t_success_logic` (after a 2ms logical wait).

[0099] Delay calculation: Actual latency: `T_total_ho = T_proc_xn + T_rrc_tx + T_ue_proc + (K * T_dsf) + T_rf_tune = 3 + 1 + 2 + (8 * 0.25) + 0.2 = 8.2ms`.

[0100] Worst-case deterministic upper bound: `T_total_ho_max_deterministic = 3+1+2+((50-1)*0.25)+0.2 = 3+1+2+12.25+0.2 = 18.45ms`.

[0101] Compared to traditional 5G handover, the typical interruption time is 30-50ms, and it is uncertain.

[0102] Results: In asynchronous networks, a bounded and low-latency (~8.2ms, upper bound 18.45ms) deterministic handover of critical service flows is achieved, significantly outperforming traditional solutions. Compared to traditional solutions: Traditional 5G NR handover processes rely on random access to the target cell, with access latency affected by contention and backoff, typically resulting in an interruption time of 30-100 milliseconds, and failing to provide a deterministic upper bound. This embodiment demonstrates that even in asynchronous networks, this invention, through main logic axis migration and iterative arbitration, provides a strictly deterministic handover latency upper bound of less than 18.45 milliseconds for the AGV's critical service flows, improving the actual average latency (~8.2ms) by an order of magnitude and fundamentally eliminating the long tail of latency uncertainty.

[0103] Example 2: Deterministic Access of Large-Scale IoT Devices on Public Networks (Detailed Process) [Scenario: Thousands of smart water meters are simultaneously woken up and connected to the public network base station on the hour.]

[0104] Detailed process (combined) Figure 6 ): 1. Network broadcast: Base station broadcast: `ACCESS_ANCHOR = T_GPS_08:00:00.500`, `Δ_MsgA=5ms`, `Δ_MsgB=12ms`, Resource pool `1000×50`, `Access_ID=0xA1B2C3D4`, Signature `Sig`.

[0105] 2. UE Calculation: Water meter A generates `Temp_ID=0x1001`, calculate: `Root = SHA-256(Sig || 0xA1B2C3D4 || T_GPS_... || PCI)` `Index = SHA-256(Root || 0x1001) mod 50000 = 12345` `slot_offset = 12345 / 50 = 246`; `freq_index = 12345 mod50 = 45` Water meter B (`Temp_ID=0x1002`) coincidentally calculated the same location `(246,45)`.

[0106] 3. MsgA transmission and collision: At time `T_GPS_08:00:00.505 + 246*T_symbol`, two water meters simultaneously transmit MsgA on the same resource.

[0107] 4. Network Arbitration: The base station decodes `{0x1001, 0x1002}`. A two-step deterministic arbitration is performed: the rule is "smallest ID wins," so water meter A (0x1001) wins.

[0108] 5. MsgB response: at time `T_GPS_08:00:00.512 + 246*T_symbol`: - The base station sends MsgB on the paired downlink resources of water meter A, which contains the dedicated DSF for water meter A.

[0109] - The base station sends a "silent instruction" on the paired downlink resources of water meter B.

[0110] 6. UE Decision: Water meter A received MsgB and successfully connected.

[0111] Water meter B received a "silent instruction" and the judgment failed.

[0112] 7. Deterministic Retry: Water meter B calculates `Hash(0x1002||“RETRY”) mod 3 = 2` based on its own ID and the broadcast retry sequence `[OP2, OP3, OP4]`, and deterministically selects OP4 as the next access opportunity.

[0113] Effect: Collisions are resolved deterministically (A succeeds immediately). The worst-case access delay for water meter B is limited to `ACCESS_ANCHOR_OP4 + Δ_MsgB`, avoiding the uncertainty of traditional random backoff.

[0114] Example 3: Ideal handover under synchronous network (instantiation of previous patent scenario) Scenario: A drone moves between synchronous cells to transmit high-definition images. `M_1 = M_2 = 80`, `T_dsf=1ms`.

[0115] Process (combined) Figure 5 ): 1. After passing the logical context, gNB-2 uses the same `M` for computation, and arbitration succeeds in one go.

[0116] 2. Set `HO_Anchor` to the next available time slot (e.g., after 0.5ms).

[0117] 3. Business operations resumed almost seamlessly after the drone switchover.

[0118] Latency calculation: `T_total_ho ≈ T_proc_xn + T_rrc_tx + T_ue_proc + T_rf_tune≈ 3+1+2+0.2 = 6.2ms` (logical wait is almost 0).

[0119] Results: This demonstrates the high efficiency of the invention under ideal conditions and verifies that the preceding patent description is an efficient special case of this general solution.

[0120] Example 4: Device Implementation Network equipment ( Figure 7 ) and user equipment ( Figure 8 The hardware components and software module functions of the ) are as described above, and they work together to complete all the above processes.

[0121] Conclusion The above description is merely a preferred embodiment of the present invention and is not intended to limit the scope of protection of the present invention. 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. For example, the specific algorithm of the hash function, the specific form of the arbitration rule, the detailed structure of `Local_Map_Param`, the adaptive adjustment algorithm of the protection interval `T_guard`, etc., all reasonable changes and extensions made based on the core ideas of the present invention fall within the scope of protection of the present invention.

Claims

1. A deterministic communication state switching method for asynchronous cellular networks, characterized in that, The method, applied to a communication system based on Dynamic Security Foundation (DSF) and Protocol Security State Machine (PSSM), includes: During the handover process of a user equipment (UE) from a source base station to a target base station, the source base station determines a main logical axis service flow from multiple service flows of the UE; The source base station sends a handover request message to the target base station. The handover request message includes at least the DSF context and current logical state of the main logical axis service flow. Based on the received DSF context and logical state, the target base station locally reconstructs the PSSM synchronized with the UE and performs an iterative arbitration process to determine the first transmission resource and the corresponding first logical decision time that are earliest available in the target cell for the main logical axis service flow. The target base station determines the handover configuration information and sends a handover command to the UE via the source base station. The handover configuration information includes at least an indication of the first transmission resource and an indication of the handover execution time window associated with the first logical decision time. The UE performs radio frequency handover to the target base station at the time point determined according to the handover execution time window indication, and applies the handover configuration information so that the main logical axis service flow uses the first transmission resources to resume deterministic transmission at the first logical decision time.

2. The method according to claim 1, characterized in that, The handover request message also includes the DSF context of other service flows within the UE, and the logical tick offset between the PSSM of the other service flows and the PSSM of the main logical axis service flow; The method further includes: the target base station or the UE determining the transmission resources of the other service flows in the target cell based on the logical clock offset, so that the other service flows can resume transmission in an orderly manner after the main logical axis service flow is restored.

3. The method according to claim 1 or 2, characterized in that, The iterative arbitration process includes: Phase 1: The target base station determines the earliest physically feasible downlink grant time based on the estimation of signaling processing and transmission delay; Phase Two: Starting from the current logical state of the reconstructed PSSM, the target base station simulates its future logical decision-making time sequence; for each logical decision-making time in the sequence, the following sub-steps are executed: a) Using the localized resource mapping parameters of the target cell, calculate the resource intention of the main logical axis service flow in the target cell at the time of the logical decision; b) Determine the unified anchor point physical time corresponding to the target cell for the logical decision time, and determine whether the candidate downlink grant time calculated based on the anchor point physical time and the fixed downlink offset is not earlier than the earliest feasible downlink grant time; c) If so, then using the physical time of the unified anchor point as the time base, perform a two-step deterministic arbitration on the calculated resource intention, the two-step deterministic arbitration including user conflict arbitration and resource availability check; The second phase is executed in a loop until a logical decision moment is found, and the corresponding resource intention is determined through the two-step deterministic arbitration. This logical decision moment is the first logical decision moment.

4. The method according to claim 3, characterized in that, The user conflict arbitration refers to: identifying all users who calculate the same uplink resource intention at the unified anchor point physical time, and selecting one user according to preset rules; the resource availability check refers to: querying the resource calendar to determine whether the uplink resource intention is available at the corresponding uplink transmission time.

5. The method according to claim 3, characterized in that, The localized resource mapping parameters include at least the total number of resource units M, which are used to map the intermediate values ​​calculated by the DSF and PSSM to a finite physical resource index. When the localized resource mapping parameters of the target cell are different from those of the source cell, the handover configuration information also includes the localized resource mapping parameters of the target cell; The UE application of the handover configuration information includes: updating the resource mapping parameters used by the main logical axis service flow in the target cell to the localized resource mapping parameters of the target cell according to the handover configuration information.

6. The method according to claim 3, characterized in that, The handover execution time window is determined based on the downlink grant time calculated from the unified anchor point physical time corresponding to the first logical decision time and the fixed downlink offset determined by the target base station for the UE, and after reserving the UE radio frequency retuning time; The handover execution time window is represented by absolute time or by the system frame and time slot number of the target cell.

7. The method according to claim 1, characterized in that, After the source base station sends a handover request message and before the UE performs radio frequency handover, the UE enters a pause-queue state. In this state, the UE pauses all PSSM-based service data uplink transmission but keeps the PSSM logic running and caches the data to be sent in the local queue.

8. An enhanced deterministic random access method, characterized in that, The method, applied to a communication system based on Dynamic Security Foundation (DSF), includes: Step A: The network device broadcasts an access opportunity announcement, which includes a future access anchor point signed by the network, a fixed access offset, and configuration information of the dedicated resource pool allocated for this access opportunity; Step B: After verifying the signature, the User Equipment (UE) uses deterministic calculation to determine its exclusive resource location in the dedicated resource pool based on the parameters in the announcement and its own generated temporary identity. Step C: The UE sends an access request message at a time determined based on the access anchor point, fixed access offset, and the location of the dedicated resource; Step D: The network device detects the dedicated resource pool within the receiving window. If multiple UE access request messages are decoded at the same resource location, then based on a preset, non-random arbitration rule, deterministic arbitration is performed to select a winning UE from the multiple conflicting UEs. Step E: At the response time determined based on the access anchor point and fixed access offset, the network device sends an access response message only on the downlink resources corresponding to the winning UE. The access response message contains a dedicated DSF generated for the winning UE.

9. The method according to claim 8, characterized in that, The preset, non-random arbitration rules include: selecting the UE with the smallest or largest temporary identity value, or selecting the UE with the smallest or largest hash value calculated based on the temporary identity and specific parameters in the access opportunity announcement; For a UE that fails arbitration, the network device sends a silence indication signal or does not send any signal on its corresponding downlink resources.

10. The method according to claim 8, characterized in that, The dedicated DSF generated for the winning UE in the access response message is encrypted and protected by a temporary security context established based on the temporary identity or pre-shared key.

11. The method according to claim 8 or 9, characterized in that, The network device also broadcasts a deterministic retry sequence containing multiple future access opportunities; If the UE does not determine itself as the winner in step E, it selects an access opportunity from the deterministic retry sequence as the timing for the next access attempt based on its temporary identity and a preset deterministic mapping function.

12. A network device, characterized in that, It includes a processor and a memory, the memory storing a computer program, and when the processor executes the program, it implements the steps performed by the target base station in the method as described in any one of claims 1-7, and / or implements the steps performed by the network device in the method as described in any one of claims 8-11.

13. A user equipment, characterized in that, It includes a processor and a memory, the memory storing a computer program, and when the processor executes the program, it implements the steps performed by the user equipment in the method as described in any one of claims 1-7, and / or implements the steps performed by the user equipment in the method as described in any one of claims 8-11.

14. A communication system, characterized in that, This includes the network equipment as described in claim 12 and the user equipment as described in claim 13.

Images