A ue-specific dynamic resource pool communication method and system based on a dynamic security root

Abstract

The application discloses a UE dedicated dynamic resource pool communication method and system based on a dynamic security root. The method establishes a dedicated dynamic resource pool for each user equipment, and provides a logically independent resource index space. The network side and the user equipment calculate the same pool index at a logical time based on a sharing rule, and are mapped to physical resources and time through a predetermined method. When the user moves, the network side dynamically updates the mapping relationship, adds new coverage resources to the pool, and removes resources away from the pool without switching signaling. The dedicated pools of multiple UEs are allowed to overlap in physical resources, and conflicts are solved by two-step deterministic arbitration. The application realizes complete decoupling of the UE and the physical network, eliminates switching, requires zero signaling, and allows the UE to move without feeling, and can be widely applied to the fields of 6G, satellite internet, industrial internet and the like.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication technology, specifically relating to network architecture and resource management methods in sixth-generation (6G) mobile communication systems. In particular, it relates to a communication method and system that uses user equipment (UE) as the center and constructs a UE-specific dynamic resource pool based on Dynamic Security Foundation (DSF) to achieve handover-free, zero-signaling, and seamless UE movement. Background Technology

[0002] Since the birth of the first generation of mobile communication systems, wireless networks have always followed a "cell"-centric architecture. Each generation of technological evolution has been an optimization and refinement within the cell framework: from macro cells to micro cells, from same-frequency to different-frequency, from hardware handover to software handover. However, this paradigm that has lasted for sixty years is facing fundamental challenges.

[0003] First, the interruptions and signaling overhead caused by handover cannot meet the extreme requirements of future 6G networks. In traditional architectures, user equipment must be attached to a fixed cell, and when it moves out of the cell's coverage area, it must hand over to a new cell through complex signaling interactions. Analysis in 3GPP TR 38.821 shows that in satellite communication scenarios, handover interruption times can reach as high as 810-1080ms, which is completely unacceptable in highly dynamic scenarios.

[0004] Secondly, the cell-centric resource management approach leads to complex network topologies. Operators need to carefully plan cell boundaries, configure handover parameters, and optimize neighbor cell lists, which increases the difficulty of network deployment and maintenance.

[0005] The applicant has previously filed a series of patents based on Dynamic Security Foundation (DSF), including 11 Chinese invention patent applications and 3 PCT international applications, constructing a complete DSF technology system from the physical layer to the protocol layer. The core idea of ​​DSF is to completely decouple the logical world from the physical world, using cryptographic primitives to guarantee the determinism of communication. Among these, two-step deterministic arbitration is the core mechanism for resolving the "modulo funnel" effect (inevitable collisions due to limited physical resources). This mechanism can be implemented in two sequences: conflict arbitration followed by resource checking, or resource checking followed by conflict arbitration, both of which are protected in the applicant's prior applications.

[0006] However, how to build a truly UE-centric network architecture under the DSF framework, so that the UE can completely get rid of its dependence on cells and achieve a mobile experience with no handover and zero signaling, remains a technical problem that urgently needs to be solved in this field. Summary of the Invention

[0007] To facilitate understanding of this invention, a brief description of the Dynamic Security Foundation (DSF) system, which forms the technical basis of this application, is provided here. The DSF system is a complete technical framework constructed by the applicant in a series of prior patent applications. Its core idea is to completely decouple the logical world from the physical world and use cryptographic primitives to guarantee the determinism of communication.

[0008] The core elements of the DSF system include: - DSF Triple: Each communicating entity (user equipment or network side) shares a triple consisting of a security key K_sec, an initial anchor Init_Anchor, and a rule identifier Rule_ID. This triple is the foundation for establishing trust and synchronization between the communicating parties.

[0009] - Protocol Secure State Machine (PSSM): A deterministic state machine based on DSF triples, which evolves independently between the communicating parties and outputs a time-varying logic state S(t). The evolution of the PSSM is independent of the physical clock and is driven only by the logical ticks defined by Rule_ID.

[0010] - Zero-signaling parameter generation: Based on K_sec and S(t), both communicating parties generate all the parameters required for communication, including pilot sequences, resource locations, HARQ process numbers, etc., through a cryptographic deterministic function F, without any dynamic signaling interaction. Its general form is Param_x = F(K_sec, S(t), Context_x).

[0011] - Logical decision moment: A discrete moment on the logical time axis defined by Rule_ID. At each logical decision moment, PSSM outputs the current state S(t) and triggers physical layer operations.

[0012] - Physical Anchor Point and Physical Execution Time: At the logical decision-making moment, the communication entity instantaneously reads the local physical clock to obtain the unified anchor point time T_anchor. Based on T_anchor and fixed offsets Δ_dl and Δ_ul, the downlink transmission / listening time T_DL = T_anchor + Δ_dl and the uplink transmission time T_UL = T_anchor + Δ_ul are calculated. Errors in the physical clock are isolated within a single transmission and do not affect the synchronization of the logical state.

[0013] - Two-step deterministic arbitration: Addressing the "modulo funnel" effect caused by limited physical resources (i.e., the resource intentions of different users inevitably collide), DSF transforms random collisions into a manageable deterministic queuing process through two steps: "conflict arbitration" and "resource availability check." This arbitration can proceed either with conflict arbitration followed by resource check, or vice versa.

[0014] - Implicit authorization for downlink: After successful arbitration, the network side sends a valid downlink data frame on the downlink resources corresponding to the winning user. The existence of this signal itself constitutes authorization, and no explicit authorization signaling is required.

[0015] The concepts described above in the DSF framework provide the fundamental technical support for this invention. This invention builds upon the DSF framework by further constructing a dedicated dynamic resource pool architecture centered on the UE, achieving complete decoupling between the UE and the physical network and handover-free mobile communication. A detailed description will follow.

[0016] The purpose of this invention is to provide a UE-specific dynamic resource pool communication method and system based on dynamic security foundation. By establishing a dedicated dynamic resource pool for each UE, the UE can completely get rid of its dependence on physical cells and realize handover-free and zero-signaling mobile communication.

[0017] To achieve the above objectives, the present invention provides the following technical solution: A UE-specific dynamic resource pool communication method based on dynamic security foundation includes the following steps: Step 1: Initial Access and Dedicated Pool Establishment. The user equipment (UE) sends an access request on public access resources via an access commitment broadcast by the physical access node. The network side establishes a dedicated dynamic resource pool for the UE based on the access request and issues the size of the dedicated dynamic resource pool and the DSF triplet. Conflicts on the public access resources are resolved through a two-step deterministic arbitration process.

[0018] Step 2: Connection-State Communication and Resource Mapping. The user equipment (UE) independently operates the protocol security state machine based on the DSF triplet. At each logical decision moment, it calculates the resource index R_pool = F(K_sec, S(t), Context) mod M_pool based on the current logical state, where M_pool is the current size of the dedicated dynamic resource pool. The network side maintains a mapping relationship, mapping the pool index of each UE to specific physical resources in real time. The UE listens on the corresponding downlink listening resource within the pool. If a valid downlink frame is received, it determines that authorization has been obtained and sends data on the corresponding uplink resource within the pool.

[0019] Step 3: Resource Conflict Handling. Multiple user devices' dedicated dynamic resource pools are allowed to overlap in terms of physical resources. Resource conflicts resulting from overlap are resolved by a two-step deterministic arbitration process performed by the network side. This two-step deterministic arbitration can proceed in either the order of conflict arbitration followed by resource checking, or the order of resource checking followed by conflict arbitration.

[0020] Step 4: Mobility and Mapping Update. When a user equipment moves, the network side dynamically updates the mapping relationship based on the user equipment's location, gradually adding physical resources in the new coverage area to the dedicated dynamic resource pool and removing physical resources from areas far away. The user equipment does not need to perform any handover signaling, and communication is not interrupted.

[0021] Step 5: Dynamic Adjustment of Resource Pool. The network side dynamically adjusts the size of the dedicated dynamic resource pool based on factors such as user equipment service requirements, channel quality, and mobility speed, and notifies the user equipment via downlink implicit authorization or dedicated signaling.

[0022] Further explanation regarding the "Dedicated Dynamic Resource Pool" It should be specifically noted that the "dedicated dynamic resource pool" mentioned in this invention refers to logical exclusivity, not physical exclusivity. This is specifically reflected in the following aspects: - Logically Dedicated: Each user equipment (UE) independently calculates its in-pool resource index based on its DSF state. This calculation process is completely independent of other UEs, and each UE logically possesses an independent resource space view. The UE does not need to know which physical access node its in-pool index ultimately maps to, nor is it concerned with changes in the physical network topology. The UE only needs to know how to interact with the PAN at the radio frequency transceiver and physical synchronization levels, but the resource allocation level is completely abstracted into the calculation of the in-pool index.

[0023] - Dynamic Pool Size: The size of M_pool is dynamically adjusted based on factors such as user equipment service requirements, channel quality, and mobile speed, reflecting the "dynamic" nature of the resource pool. For stationary IoT devices, the pool size can be fixed at 1, enabling precise resource allocation.

[0024] - Physical sharing: The dedicated pools of multiple UEs can overlap in terms of physical resources. Conflicts caused by the overlap are resolved in an orderly manner by two-step arbitration, thereby achieving efficient reuse of physical resources while maintaining the logical independence of UEs.

[0025] Furthermore, since multiple UEs share physical resources in their dedicated pools, different UEs may calculate the same pool index at the same time, leading to pool index collisions. Let the number of UEs be U, and the average pool size be M_pool. The probability of at least two UEs colliding can be precisely given by the birthday paradox formula: P_collision = 1 - ∏_{i=0}^{U-1} (1 - i / M_pool) ≈ 1 - exp(-U(U-1) / (2M_pool)). For example, when U=1000 and M_pool=100, the collision probability is approximately 0.99, meaning that a collision will occur at almost every logical decision moment. This is precisely the necessity of two-step arbitration.

[0026] It is important to note that a high collision probability does not necessarily mean high transmission latency. Two-step arbitration, by transforming collisions into an ordered queuing process, provides a mathematically provable upper bound on latency for each service. This is fundamentally different from the random backoff and unpredictable latency caused by collisions in traditional 5G systems. A detailed analysis follows: Latency characteristics in low-load scenarios: When the system load is low, although the collision probability may be high, the limited number of UEs competing for service results in each UE having a higher queuing position. The average waiting latency is approximately (K-1) / 2 · T_dsf, where K is the average collision set size and T_dsf is the logical decision cycle. In the worst case, a UE may wait up to (M_pool-1) logical decision cycles to obtain service. This micro-latency (e.g., when M_pool=100 and T_dsf=0.125ms, the worst-case waiting time is approximately 12.4ms) is the core design of DSF, which trades for deterministic guarantees at an acceptable cost.

[0027] Performance advantages under medium-to-high load scenarios: As the load increases, traditional 5G systems experience exponential latency growth and uncontrollable long tails due to surging signaling overhead and queuing uncertainty. DSF's two-step arbitration transforms resource competition into a deterministic queuing process, resulting in a smooth decrease in system throughput and linear latency growth without a "performance cliff" effect. Simulation results show that under medium load (resource utilization of approximately 50%), DSF's average end-to-end latency is reduced by about 40% compared to traditional 5G; under high load (resource utilization of 80%), DSF's 99th percentile latency is reduced by more than 60% compared to traditional 5G, and the latency distribution is concentrated within a bounded range, completely eliminating the long tail.

[0028] In contrast to traditional 5G, which avoids collisions through dynamic signaling at the cost of 15-20% control overhead and statistical QoS (with unpredictable long-tail latency), DSF directly confronts collisions and resolves them in an orderly manner through two-step arbitration. While this may introduce a tiny queuing delay (at most one logical decision cycle) under extremely low load, it yields fundamental benefits such as deterministic QoS, zero signaling overhead, and high spectrum efficiency.

[0029] Therefore, the two-step arbitration not only solves the collision problem, but more importantly, it transforms random collisions into a predictable, bounded, and provable deterministic queuing process. This is the core advantage of the DSF architecture compared to traditional communication paradigms. By configuring the pool size appropriately (e.g., dynamically adjusting M_pool according to service load), latency performance can be further optimized, enabling DSF to provide a superior end-to-end experience compared to traditional 5G under various load scenarios.

[0030] Explanation of physical layer configuration parameters To enable the UE to accurately map indexes within the logical pool to physical resources, the UE must obtain the physical layer configuration parameters of the dedicated dynamic resource pool simultaneously when acquiring it. These parameters include at least: - Operating frequency (center frequency) - Channel bandwidth - Subcarrier spacing - Length of the cyclic prefix - Time slot format (uplink / downlink symbol ratio) - Definition of the Bandwidth Part (BWP) where the resource pool resides - Pilot sequence generation parameters (such as base sequence index, cyclic shift range) The aforementioned parameters are sent to the UE by the LPC via MsgB during initial access (or in subsequent downlink implicit grant frames). The UE stores these parameters and calculates the specific time-frequency resource location at each logical decision time by combining them with the pool index. For example, if the resource pool is defined within a BWP with a bandwidth of 100MHz and a subcarrier spacing of 30kHz, the pool index R_pool can be mapped to a resource block and a symbol location within that BWP. The UE does not need to know which PAN ultimately transmits or receives the resource; it only needs to listen for downlink at the calculated T_DL time and transmit uplink at the T_UL time.

[0031] Regarding synchronization maintenance and instantaneous anchoring The UE maintains continuous time synchronization with the network side during connected mode. Synchronization can be achieved through one of the following methods: - Periodically monitor the downlink synchronization signals (such as primary synchronization signal and secondary synchronization signal) of the current service PAN (or the PAN mapped by its dedicated pool) and adjust the local timing accordingly; - Round-trip time measurement based on uplink pilot signal, with timing adjustment instructions carried by LPC via downlink implicit license; - Leveraging the logical time axis decoupling characteristic of DSF, an "instantaneous anchoring" mechanism is used: At each logical decision moment, the UE reads its local physical clock to obtain T_anchor, and then calculates the precise downlink listening time T_DL and uplink transmission time T_UL based on locally stored physical layer configuration parameters (such as subcarrier spacing, time slot length, etc.) and fixed offsets Δ_dl and Δ_ul. Here, the physical transmission time is determined based on a unified time base (such as global time synchronized by GNSS or IEEE 1588), ensuring consistency in the understanding of time between the network side and the user side. Although the UE's local physical clock may have errors, these errors are isolated within a single transmission and do not affect the long-term stability of logical synchronization.

[0032] Explanation of security pilot frames In this invention, data transmission between the user equipment and the network side can employ a secure pilot frame structure. The secure pilot frame is constructed based on a cross-propagation pilot sequence generated by the DSF (Digital Subsystem for Components), modulating control information or user data onto the pilot sequence to achieve joint processing of channel estimation and data demodulation. As a preferred embodiment of this invention, the secure pilot frame can simultaneously carry user data and control signaling, achieving zero-overhead transmission. As an alternative embodiment, the pilot sequence can also be used only for channel estimation and positioning, while control signaling and user data are transmitted on designated resources separate from the pilot. Regardless of the specific implementation, the pilot sequence itself is derived from the DSF state, ensuring its uniqueness and predictability, and providing a foundation for high-precision positioning. In an alternative embodiment, the pilot signal can still be used for Time of Arrival (ToA) measurement, combined with the geometric relationship between the UE and the PAN (Network Area Interface) to achieve centimeter-level positioning, with the positioning signal and communication signal fully multiplexed. The core of this invention lies in the establishment and maintenance of a dedicated dynamic resource pool, independent of the specific implementation of the secure pilot frame.

[0033] Explanation of initial access and public resource pool It is important to note that the public access resource pool used during the initial access phase is independent of the dedicated dynamic resource pool established after the user equipment establishes a connection. The public access resource pool is defined by the physical access node and shared by all user equipment, used to send access requests (MsgA). Resource conflicts in the public resource pool are resolved through a two-step arbitration process; the user equipment that successfully arbitrates obtains its dedicated resource pool. After the dedicated resource pool is established, all subsequent communication by the user equipment takes place within its dedicated pool, and the public resource pool is no longer used. This design ensures the decoupling of the initial access process from connection-state communication, reducing system complexity.

[0034] Beneficial effects Compared with the prior art, the present invention has the following beneficial effects: 1. Handover completely disappears: User equipment no longer needs to execute any handover signaling. Mobility is handled smoothly by the network side through mapping tables, resulting in zero communication interruption and zero signaling overhead.

[0035] 2. Seamless UE movement: The user equipment is completely unaware of the changes in the physical network topology, and the movement process is completely transparent to the UE.

[0036] 3. Logical Dedicated + Physical Shared: Through the design of "logical dedicated + physical shared + two-step arbitration", the independence of UE computing is maintained, while the efficient use of physical resources is achieved.

[0037] 4. High efficiency in resource utilization: The dedicated pools of multiple UEs are allowed to overlap in terms of physical resources. Conflicts are resolved in an orderly manner through two-step arbitration, avoiding the waste of reserving a large amount of idle resources in traditional scheduling to completely avoid conflicts.

[0038] 5. Simplified network topology: Operators no longer need to plan cell boundaries or configure handover parameters, significantly reducing network deployment and maintenance costs.

[0039] 6. Perfect integration with DSF system: This invention fully utilizes the core mechanisms of DSF, such as zero signaling parameter generation, logical time axis decoupling, and two-step arbitration, and is a natural extension of the DSF technology system at the network architecture level.

[0040] 7. By using a unified time base, the network side and the user side can have a consistent understanding of the physical transmission time, which further enhances the determinism of communication.

[0041] Figure 1 This is a schematic diagram of the network architecture of the system described in this invention.

[0042] Figure 2 This is a schematic diagram showing the mapping relationship between the UE-specific dynamic resource pool and physical resources.

[0043] Figure 3 This is the overall flowchart of the method described in this invention.

[0044] Figure 4 This is a schematic diagram illustrating the smooth update of the mapping table during the movement process.

[0045] Figure 5 This is a flowchart of a two-step arbitration process for resolving resource conflicts (showing two possible sequences).

[0046] Figure 6 This is a timing flowchart of the initial access process. Detailed Implementation

[0047] 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.

[0048] Network Entity Definition To facilitate the description of embodiments of the present invention, the following network entities are defined in this specification. These entities are core components of the present invention; they may be implemented in different physical forms, but together they constitute the communication system described in the present invention.

[0049] The Logic Processing Center (LPC), a novel network entity proposed in this invention, is responsible for all logical processing functions, including: establishing and maintaining a dedicated dynamic resource pool for each user equipment; maintaining a mapping table from the pool's indexes to physical resources; performing two-step deterministic arbitration; maintaining a global resource calendar; performing channel estimation (based on pilot signals reported by the PAN); performing data encoding / decoding; and processing measurement reports. The LPC can be deployed as a standalone physical device or integrated into existing base stations, edge computing nodes, or cloud servers. LPCs can collaborate through interfaces to achieve cross-regional resource management.

[0050] Physical Access Node (PAN): As a novel network entity proposed in this invention, the PAN is responsible for physical layer transmission and reception and basic synchronization functions, including: radio frequency signal transmission / reception, radio frame construction / parsing, high-precision time synchronization, uplink pilot signal measurement and reporting to LPC, and broadcast access commitments. PANs can be deployed as independent radio frequency units or integrated into traditional base stations, small base stations, radio remote units, or user equipment (such as in relay scenarios). Multiple PANs can work collaboratively to provide physical resources for user equipment.

[0051] User Equipment (UE): Based on the DSF protocol security state machine, it calculates resource indexes and communicates within a dedicated dynamic resource pool. UE can be any communication terminal such as a mobile phone, IoT device, vehicle terminal, or drone.

[0052] Fronthaul network: The communication network connecting the LPC and PAN, supporting high-precision time synchronization (such as IEEE 1588v2) and low-latency data transmission. The fronthaul network can be a wired network (such as fiber optic) or a wireless network (such as microwave or millimeter-wave links).

[0053] The aforementioned network entities collectively constitute the UE-specific dynamic resource pool communication system based on dynamic security foundations described in this invention. Those skilled in the art will understand that the functional division of these entities is logical, and they can be flexibly combined or separated as needed in actual deployment. As long as the core functions described in this invention can be achieved, they should all fall within the protection scope of this invention.

[0054] Explanation of LPC's internal data structure LPC maintains two core data structures: - UE-specific mapping table: Using (UE_ID, R_pool) as the key, quickly retrieve the corresponding physical resource descriptor (PAN_ID, local_resource_id). This table supports O(1) queries and dynamic updates.

[0055] - Global Physical Resource Calendar: Using (PAN_ID, local_resource_id) as the key, it records information such as resource status (idle / occupied / reserved), occupant identifier (UE_ID + service flow ID), and priority. This calendar is refined down to each service flow.

[0056] In real-world deployments, the mapping table can reach millions of entries (e.g., 10,000 UEs, average pool size 100, then 1 million entries). Such a large-scale mapping table requires efficient data structures and update mechanisms. The following engineering approaches can be used to achieve this: - The mapping table is sharded and stored across multiple LPC nodes using a distributed hash table (DHT), supporting horizontal scaling.

[0057] - Update operations use batch processing or incremental updates, such as dynamically adjusting the batch processing cycle based on system load (typically 5-20ms) to reduce random write overhead.

[0058] - A prediction mechanism can be introduced to adjust the mapping relationship in advance based on the UE's movement trajectory, reducing the pressure of real-time updates.

[0059] Thanks to modern hardware (such as in-memory databases and FPGA acceleration), LPC can complete mapping queries and arbitration of tens of thousands of UEs within microseconds, fully meeting the 6G sub-millisecond latency requirements.

[0060] Impact of LPC and PAN synchronization errors The fronthaul network uses IEEE 1588v2 or GNSS for microsecond-level time synchronization. Let the synchronization error be ε_sync, then the impact on the "resource availability check" in the two-step arbitration can be analyzed as follows: - The resource occupancy period recorded in the resource calendar is based on T_UL. Due to synchronization errors, LPC's judgment of resource status may be offset by ε_sync.

[0061] - If ε_sync is much smaller than Δ_ul - Δ_dl (i.e., the UE processing time window), it will not affect the correctness of arbitration. Under typical parameters, Δ_ul - Δ_dl > 100μs, while the synchronization error can be controlled within 1μs, so it is completely tolerable.

[0062] For a detailed analysis, please refer to the applicant’s application submitted in January 2026, “Hard deterministic wireless communication method and system based on unified anchor time and dual fixed offset” (application number 2026101229059).

[0063] Example 1: Initial Access and Dedicated Pool Establishment Based on Commitment (Detailed Protection of Access Rights) This embodiment demonstrates in detail how a user equipment obtains an initial dedicated dynamic resource pool through a commitment-based random access procedure. This process is the focus of the accessory protection of this invention.

[0064] Step 1-1: PAN Broadcast Access Commitment Each Physical Access Node (PAN) periodically broadcasts the following information: - Synchronization signal (used for time synchronization) - Physical Access Node Identifier (PAN_ID) - Network commitment: includes the future target time T_target and the network signature Sig_gNB The network commitment is generated by LPC and distributed to PAN. Sig_gNB uses the private key of LPC to sign M_commit = (T_target || Nonce || "GFRA").

[0065] Steps 1-2: UE receives broadcast and verifies After powering on, the UE searches for and synchronizes downlink signals to the PAN and reads broadcast information. The UE uses a pre-configured LPC public key to verify the network signature Sig_gNB, confirming the authenticity and integrity of the network commitment. This public key pre-configuration method is similar to the root certificate mechanism used in 5G to verify network signatures, and can be pre-configured through the operator's SIM card or securely obtained through a certificate chain during initial attachment.

[0066] Steps 1-3: The UE calculates access resources and sends MsgA. The UE generates a local random number R_UE and calculates the temporary identity Temp_ID = H(R_UE || UE_ID). At the target time T_target, the UE calculates its dedicated access resources: Root = H(Sig_gNB || T_target || PAN_ID || "RACH_ROOT") Resource_Index = H(Root || Temp_ID) mod N Where N is the size of the public access resource pool. The UE sends MsgA on the calculated resources. MsgA may contain Temp_ID and service identifier (such as URLLC, eMBB, mMTC, etc.).

[0067] Steps 1-4: LPC processes MsgA and performs two-step arbitration. LPC (via PAN) performs blind detection at all N resource locations in the common access resource pool within the receive window corresponding to T_target. For each resource location where MsgA is detected, LPC performs a two-step arbitration: - Step 1: Conflict Arbitration. If multiple different Temp_IDs are decoded at the same resource location, a winning UE is selected according to preset rules (such as selecting the smallest Temp_ID).

[0068] - Step 2: Resource check. Confirm that the resource location belongs to the public access resource pool and is not occupied (available by default).

[0069] Steps 1-5: LPC issues MsgB and allocates it to a dedicated pool LPC allocates an initial dedicated dynamic resource pool to the winning UE based on the service identifier carried in the MsgA, and simultaneously issues the physical layer configuration parameters (frequency, bandwidth, subcarrier spacing, etc.) for this resource pool. The principles for determining the pool size M_pool^(0) include: - URLLC service: Moderate pool size, high priority - eMBB service: Larger pool size, supports high speed - mMTC services: smaller pool size, supports low power consumption LPC replies to UE via MsgB with the following information: - Initial pool size M_pool^(0) - Physical layer configuration parameters - DSF triple (K_sec, Init_Anchor, Rule_ID) - Contention resolution identifier (Temp_ID of the winning UE) MsgB is sent on the downlink resource corresponding to the UE, which is derived from the uplink access resource by the pairing function.

[0070] Steps 1-6: UE confirms access and enters connected state The UE listens on the expected downlink resources. After successfully decoding the MsgB containing its own Temp_ID, it determines that the access is successful. The UE stores the physical layer configuration parameters, applies the DSF triplet, establishes a dedicated dynamic resource pool, and enters the connected state. Thereafter, all communication of the UE takes place within its dedicated pool, and it no longer listens for PAN broadcasts.

[0071] At this point, the UE has established its own dynamic resource pool through the initial access process.

[0072] Steps 1-7: Deterministic retry (optional) For UEs that fail arbitration, LPC can pre-broadcast a deterministic retry sequence. The failing UE deterministically selects its next retry opportunity based on its own Temp_ID using a public hash function, avoiding random backoff.

[0073] Notes on Example 1 To better understand the above steps, the following notes are added: Note 1: Pre-configuration method for LPC public keys The LPC public key pre-configured on the UE can be obtained in one of the following ways: written into the secure element at the factory; pre-configured via the operator's SIM card; or securely obtained via a certificate chain when first attaching to the network (similar to the root certificate mechanism in 5G). This public key is used to verify the authenticity of the network signature, ensuring that the network accessed by the UE is legitimate and preventing attacks from fake base stations.

[0074] Note 2: Meaning of the formulas in steps 1-3 The functions of each part in the formula are as follows: - Root = H(Sig_gNB || T_target || PAN_ID || "RACH_ROOT"): Hash the network signature, target time, PAN identifier, and a fixed string to generate a common root value. This root value ensures the randomness of each access opportunity and is bound to the network commitment to prevent replay attacks.

[0075] - Resource_Index = H(Root || Temp_ID) mod N: The root value is hashed again with the UE's temporary identity, and the modulo is taken to obtain the access resource index. This index is uniformly distributed in the range [0, N-1], so that the resource intentions of different UEs are randomly distributed in the public resource pool, reducing the probability of conflict. N is the size of the public resource pool, which is configured by the network and informed to the UE via broadcast.

[0076] Note 3: The order of the arbitration steps in steps 1-4 can be reversed. The two-step arbitration in steps 1-4 can be performed in either the order of conflict arbitration followed by resource checking, or in the order of resource checking followed by conflict arbitration. Both orders are within the scope of protection of this invention, and the specific choice can be determined according to system implementation preferences. Checking before arbitration can filter unavailable resources in advance and reduce the amount of arbitration calculation; arbitrating before checking is simpler to implement. This embodiment uses conflict arbitration followed by resource checking as an example for illustration, but it does not constitute a limitation.

[0077] Note 4: Secure transmission of K_sec in MsgB The security key K_sec in the DSF triple is the core secret for subsequent communications. MsgB, as the initial access response, must ensure the confidentiality of K_sec. One of the following methods can be used: - Use the temporary public key carried by the UE in MsgA (such as a key derived from the UE's identity) to encrypt the transmission of K_sec; - A temporary session key is derived based on the network signature and the UE's temporary identity, and K_sec is encrypted. - A key can be generated using physical layer channel characteristics (such as channel reciprocity) between the PAN and the UE. However, considering that the channel has not been fully estimated during initial access, the first two methods are more practical.

[0078] This is similar to the key transfer method in the 5G NAS layer, where the transmission of the core key is protected by a key derived from a temporary identity. This embodiment does not limit the specific protection method of K_sec; any method that can ensure confidentiality can be used.

[0079] Note 5: DSF's dynamic update mechanism The DSF triple (especially K_sec) can be dynamically updated in connected state to enhance security. The LPC can periodically or event-triggeredly update the UE's K_sec according to security policies and notify the UE via downlink implicit authorization (or by carrying an update instruction in a security pilot frame). The update process should be encrypted using the currently valid K_sec to ensure forward security. The dedicated resource pool architecture of this invention fully supports this dynamic update; after the UE updates the key, subsequent in-pool index calculations use the new key without affecting established mapping relationships.

[0080] Example 2: Connected-State Communication and Two-Step Arbitration This embodiment demonstrates how UEs communicate within a dedicated pool and how resource conflicts are resolved through a two-step arbitration process.

[0081] Assume UE1 and UE2 are in the same geographical location, each with its own dedicated pools M1=100 and M2=100. The initial configuration of the mapping table maintained by LPC is as follows: - (UE1, 0~49) → PAN-A, (UE1, 50~99) → PAN-B - (UE2, 0~49) → PAN-B, (UE2, 50~99) → PAN-A At a certain logical decision time t, UE1 calculates the pool index R1=30 based on the DSF state S1(t), and UE2 calculates R2=30.

[0082] LPC query mapping table reveals: - (UE1,30) → Physical resource r_A on PAN-A - (UE2,30) → Physical resource r_B on PAN-B Since they are mapped to different PANs, there is no conflict between them. LPC grants UE1 and UE2 on r_A and r_B respectively, and both can send simultaneously.

[0083] At another logical decision point t', UE1 calculates R1=60, and UE2 calculates R2=50. The mapping table shows: - (UE1,60) → Physical resources r on PAN-B - (UE2,50) → The same physical resource r on PAN-B (because of mapping overlap) A resource conflict occurs at this point. LPC performs a two-step deterministic arbitration on resource r. This embodiment uses the order of resource checking followed by conflict arbitration as an example: Step 1: Resource availability pre-check. LPC queries the resource calendar and finds that resource r is available during the required time period (not occupied or reserved by other users). If so, temporary reservation is performed for both UE1 and UE2 and they are marked as candidates.

[0084] Step 2: User conflict arbitration. LPC compares the priorities of UE1 and UE2 (assuming UE1 has a higher priority), selects UE1 as the winner, converts its temporary reservation to a formal holding, and releases UE2's temporary reservation.

[0085] Arbitration was successful, and LPC sent an authorization signal on UE1's in-pool downlink resource (calculated based on the pairing function). UE1 received the authorization and sent data on the in-pool uplink resource r. UE2 did not receive the authorization and waited for the next logical decision.

[0086] If the order of conflict arbitration followed by resource checking is adopted, the process is as follows: LPC first compares priorities and selects UE1 as the winner, then checks whether resource r is available, and grants the resource after confirming its availability. Both orders are within the protection scope of this invention.

[0087] Example 3: Smooth Mapping Migration (Switchout Disappearance) During Movement This embodiment demonstrates how to achieve seamless movement and completely eliminate handover by dynamically updating the mapping table when the UE moves.

[0088] Assume UE3 is moving from the coverage area of ​​PAN-A to the coverage area of ​​PAN-B. At time t0, UE3's dedicated pool mapping is as follows: - Index 0~49 → PAN-A - Index 50~99 → PAN-B Multiple PANs can detect changes in the position of UE3 by receiving the uplink pilot signal from UE3. The PANs then report the measurement information to the LPC.

[0089] LPC determines that UE3 is moving away from PAN-A and closer to PAN-B, and therefore gradually adjusts the mapping table: - Time t1: Migrate indices 40-49 from PAN-A to PAN-B - At time t2: migrate indices 30-39 from PAN-A to PAN-B - At time t3: migrate indices 20-29 from PAN-A to PAN-B ... Ultimately, when UE3 fully enters the PAN-B coverage area, all indices are mapped to PAN-B. Throughout the entire process, UE3 remains completely unaware, and communication is uninterrupted.

[0090] Example 4: Dynamic Adjustment of Pool Size This example demonstrates how to dynamically adjust the size of a dedicated pool based on business needs.

[0091] Assume UE4 is currently running eMBB service with a pool size M=200. Suddenly, UE4 needs to send an urgent URLLC command. At the logical decision point, UE4 sends a request to the network side via a control pilot frame (with the frame header set to URLLC request).

[0092] Upon receiving the request, LPC decides to temporarily expand the dedicated pool for UE4 to reduce the probability of collisions. LPC adjusts M from 200 to 300 and notifies UE4 via downlink implicit authorization. After the emergency instruction is sent, LPC can restore M to 200.

[0093] Example 5: Precise Resource Allocation for Static IoT Devices Assume a water meter UE5 is a stationary device, reporting 4 bytes of data per hour. Based on its service characteristics, the LPC allocates a dedicated pool size M_pool=1, meaning the pool contains only one index R_pool=0, and issues the corresponding physical layer configuration parameters (such as frequency, bandwidth, etc.). The mapping table consistently maps (UE5,0) to a specific physical resource of a certain PAN. UE5 calculates R_pool=0 at each logical decision point, and the LPC directly grants the resource without conflict. The "dynamic" nature of the resource pool is reflected in the LPC's ability to fine-tune the actual location of the physical resource based on network load (e.g., relocating it to balance interference), but the UE is unaware of this.

[0094] Example 6: Resource arbitration for multiple service flows within the same UE This embodiment demonstrates how multiple service flows of the same user device can undergo resource arbitration within a dedicated dynamic resource pool, reflecting fine-grained scheduling at the service flow level.

[0095] Assume UE6 is running three service flows simultaneously: Flow A (URLLC control signaling, priority 1), Flow B (eMBB video stream, priority 3), and Flow C (background sensor data, priority 5). UE6 has a dedicated pool size M_pool=100.

[0096] At a certain logical decision point t, the three business flows calculate the in-pool indexes based on their respective contexts: - Stream A (Context="URLLC") calculates R_A=30 - Stream B (Context="eMBB") calculates R_B=30 - Flow C (Context="mMTC") calculates R_C=70 The LPC query mapping table reveals that (UE6,30) is mapped to physical resource r_30 (located in PAN-A), and (UE6,70) is mapped to physical resource r_70 (located in PAN-B). Resource r_70 has no conflicts, and the LPC can directly authorize flow C. However, both flow A and flow B are requesting resources r_30 simultaneously, resulting in an inter-flow conflict.

[0097] In LPC's global resource calendar, for physical resource r_30, the current state of the resource is recorded as idle, and a list of pending requests is maintained. LPC performs a two-step deterministic arbitration on resource r_30: Step 1: Resource availability pre-check. LPC queries the resource calendar to confirm that r_30 is available at the required uplink time T_UL (not occupied by other UEs or service flows). If so, temporary reservations are performed for both flow A and flow B, and they are marked as candidates.

[0098] Step 2: Inter-flow conflict arbitration. LPC compares the priorities of flow A and flow B. Flow A (priority 1) is higher than flow B (priority 3), so flow A is selected as the winner. LPC converts the temporary reservation of flow A into a formal occupancy, records the occupant as (UE6, flow A) in the resource calendar, and releases the temporary reservation of flow B.

[0099] After successful arbitration, LPC sends an authorization signal on the downlink listening resource R_d,A corresponding to flow A (derived from pool index 30 by the pairing function). Flow A of UE6 listens on this downlink resource, and upon receiving authorization, sends uplink data on physical resource r_30 at time T_UL. Flow B does not receive authorization and waits for the next logical decision time to retry.

[0100] This embodiment demonstrates that LPC's resource calendar can be refined to the service flow granularity, and the two-step arbitration mechanism is also applicable to conflict resolution among multiple service flows within the same UE. This achieves more granular QoS guarantees than the UE level, meeting the needs of future service diversification.

[0101] Example 7: Advantages of Resource Check Before Arbitration When LPC processes a large number of UEs, checking resource availability beforehand can filter out unavailable requests, reducing the computational load of subsequent arbitration. For example, if a resource has been reserved for a high-priority service, any UE intending to use that resource will fail directly without needing to participate in conflict arbitration. This patent covers two sequences, but checking before arbitration is preferred to improve efficiency.

[0102] Example 8: Smoothness of Physical Layer Parameter Switching When LPC migrates a UE's dedicated pool mapping from one PAN to another, if the physical layer configuration parameters (such as frequency point and subcarrier spacing) of the old and new PANs are different, the UE needs to adjust its radio frequency and baseband parameters. To ensure uninterrupted service, the following smooth transition mechanism can be adopted: 1. LPC notifies the UE of the upcoming parameter changes in advance via downlink implicit grant (or in a security pilot frame) and indicates the handover time T_switch. T_switch can be accurate to the logical decision time, and the deterministic timing of DSF ensures the synchronization accuracy of the handover.

[0103] 2. The UE maintains dual-radio capability (or fast reconfiguration capability) before T_switch, while listening to downlink signals from both the old and new PANs.

[0104] 3. At the T_switch time, LPC ensures that the old and new PANs serve the UE simultaneously for a short period of time (e.g., a logical decision cycle), during which the UE completes the parameter switching.

[0105] 4. After the handover is complete, LPC updates the mapping table, and the UE uses the new parameters for subsequent communication.

[0106] For UEs without dual-RF capability, the pause-queue mechanism of DSF can be utilized (see the applicant's application "Seamless Handover, Access Method and System for Deterministic Communication State in Asynchronous Cellular Networks," application number 2026101471226, submitted in February 2026). Specifically: LPC notifies the UE to start reconfiguration at T_switch, the UE suspends uplink transmission, and LPC buffers downlink data; after reconfiguration is completed, the UE resumes communication, and LPC resumes transmission at subsequent logical decision moments. This mechanism utilizes the deterministic latency guarantee of DSF to ensure no packet loss in services.

[0107] Example 9: Two Implementation Methods of Security Pilot Frames Implementation method A (preferred): The UE modulates control information or user data onto the security pilot sequence generated by the DSF, and transmits the signal as S[k] = P_UL[k] × (1 - 2 × data_bit[i]). The receiver uses the same pilot sequence for joint channel estimation and data demodulation.

[0108] Implementation Method B (Alternative): The pilot sequence generated by the DSF is used by the UE only for channel estimation and positioning. Control signaling and user data are transmitted on designated resources separate from the pilots. The location of these designated resources is derived from the DSF state, ensuring zero signaling allocation. In this method, the pilots derived from the DSF can still be used for time of arrival measurement, achieving centimeter-level accuracy when combined with geometric positioning algorithms.

[0109] Regardless of the implementation method, the pilot sequence itself is derived from the DSF state S(t), ensuring its uniqueness and predictability, and providing a basis for high-precision positioning.

[0110] Example 10: UE-Dedicated Dynamic Resource Pool Communication System Based on DSF This embodiment demonstrates a complete UE-specific dynamic resource pool communication system based on DSF, including one LPC, multiple PANs, and multiple UEs.

[0111] like Figure 1 As shown, LPC is deployed on edge cloud nodes and connects to multiple PANs via a fronthaul network. These PANs are distributed across different geographical locations, covering different areas. Each PAN periodically broadcasts a synchronization signal and access commitment for the UE's initial access.

[0112] UE1 and UE2 are located in the overlapping coverage area of ​​PAN-A and PAN-B. LPC has established dedicated dynamic resource pools for UE1 and UE2, each with a pool size of 100, and has issued their respective physical layer configuration parameters. The LPC mapping table is configured as follows: - UE1's indices 0-49 are mapped to PAN-A, and indices 50-99 are mapped to PAN-B. - UE2's indices 0-49 are mapped to PAN-B, and indices 50-99 are mapped to PAN-A. When UE1 and UE2 move, LPC updates the mapping table in real time based on pilot measurements reported by PAN, achieving seamless movement. When the resource intentions of multiple UEs are mapped to the same physical resource, LPC performs a two-step arbitration to resolve the conflict.

[0113] This system achieves complete decoupling between the UE and the physical network. The UE does not need to know which PAN it belongs to, nor does it need to execute any handover signaling, and communication is always uninterrupted.

[0114] This invention can be widely applied to scenarios such as sixth-generation (6G) mobile communication systems, satellite internet, industrial internet, vehicle-to-everything (V2X) networks, the Internet of Things (IoT), military communications, and financial transactions, providing core technological support for future digital infrastructure.

Claims

1. A UE-specific dynamic resource pool communication method, characterized in that, include: A dedicated dynamic resource pool is established and maintained for each user device. The dedicated dynamic resource pool has a dynamically adjustable pool size and provides a logically independent resource index space for the user device. The network side and the user equipment calculate the same resource index within the pool at a determined logical moment based on shared rules. The network side and the user side will calculate the pool index and map it to the actual physical transmission resources and the physical transmission time based on a unified time base using a predetermined method. The user equipment communicates on the mapped physical transmission resources and physical time.

2. The method according to claim 1, characterized in that, The dedicated dynamic resource pool is established through the initial access process.

3. The method according to claim 1, characterized in that, The shared rules are based on a protocol security state machine with a Dynamic Security Foundation (DSF). The protocol security state machine is defined by a security key, an initial anchor point, and a rule identifier shared by both communicating parties, and evolves independently on the logical timeline, outputting a time-varying logical state.

4. The method according to claim 1, characterized in that, The method for mapping pool-in-index to actual physical transmission resources and physical transmission times includes: The network side maintains the mapping relationship, mapping the pool resource index of each user device to specific physical resources in real time; The user side determines the corresponding physical transmission resources and physical transmission time based on the resource index in the pool and the pre-configured physical layer parameters.

5. The method according to claim 1, characterized in that, The size of the dedicated dynamic resource pool is dynamically adjusted based on at least one of the following factors: user equipment service requirements, channel quality, or mobile speed.

6. The method according to claim 1, characterized in that, When a user equipment moves, the network side dynamically updates the mapping relationship based on the user equipment's location, adding physical resources in the new coverage area to the dedicated dynamic resource pool and removing physical resources in the distant area from the dedicated dynamic resource pool. The user equipment does not need to execute handover signaling, and communication is not interrupted.

7. The method according to claim 1, characterized in that, Multiple user devices' dedicated dynamic resource pools are allowed to overlap in terms of physical resources. Resource conflicts caused by overlap are resolved by the network side through a two-step deterministic arbitration.

8. The method according to claim 7, characterized in that, The two-step deterministic arbitration adopts either the order of conflict arbitration followed by resource inspection, or the order of resource inspection followed by conflict arbitration.

9. The method according to claim 1, characterized in that, The dedicated dynamic resource pool is established through an initial access process, which includes: The physical access node broadcasts an access commitment that includes a future target time and a network signature; After verifying the network signature, the user equipment calculates the public access resources based on the access commitment and its own identifier at the target time and sends an access request. The network side allocates an initial dedicated dynamic resource pool to the user equipment based on the service identifier carried in the access request, and issues the pool size of the initial dedicated dynamic resource pool and the sharing rules through the access response.

10. The method according to claim 9, characterized in that, The access response also includes physical layer configuration parameters of the dedicated dynamic resource pool, which include at least one or more of the following: operating frequency, channel bandwidth, and subcarrier spacing.

11. The method according to claim 1, characterized in that, The calculation of the resource index within the pool is based on the shared rules and the state at the logical moment. The calculation formula is R_pool = F(K_sec, S(t), Context) mod M_pool, where K_sec is the security key, S(t) is the time-varying logical state output by the protocol security state machine, Context is the context information, and M_pool is the current pool size.

12. The method according to claim 1, characterized in that, The network side includes a logical processing center and multiple physical access nodes, wherein: The logic processing center is used to establish and maintain a dedicated dynamic resource pool, maintain the mapping relationship, and perform resource conflict arbitration. The physical access node is used to provide physical resources, perform radio frequency transmission and reception, send synchronization signals and access commitments, and report the received user equipment signals to the logic processing center.

13. The method according to claim 12, characterized in that, The logical processing center and the physical access node are connected via a fronthaul network, which supports high-precision time synchronization.

14. A UE-specific dynamic resource pool communication system, characterized in that, include: The logical processing center is used to establish and maintain a dedicated dynamic resource pool for each user equipment. The dedicated dynamic resource pool has a dynamically adjustable pool size and provides a logically independent resource index space for the user equipment. The logical processing center is also used to calculate the same resource index within the pool with the user equipment based on shared rules at a determined logical time. The logical processing center is also used to map the calculated pool index to the actual physical transmission resources and the physical transmission time based on a unified time base using a predetermined method. Multiple physical access nodes are used to provide physical resources, perform radio frequency transceiver, and report the uplink signals of user equipment to the logical processing center; At least one user equipment is used to calculate the same pooled resource index with the network side based on shared rules at a determined logical time; the user equipment is also used to map the calculated pooled index to actual physical transmission resources and physical transmission time through a predetermined method, and to communicate on the mapped physical transmission resources and physical time.

15. The system according to claim 14, characterized in that, The shared rules are based on a protocol security state machine with a Dynamic Security Foundation (DSF). The protocol security state machine is defined by a security key, an initial anchor point, and a rule identifier shared by both communicating parties, and evolves independently on the logical timeline, outputting a time-varying logical state.

16. The system according to claim 14, characterized in that, The logic processing center is also used to dynamically adjust the size of the dedicated dynamic resource pool based on at least one of the following factors: user equipment service requirements, channel quality, or mobile speed.

17. The system according to claim 14, characterized in that, The logic processing center is also used to dynamically update the mapping relationship according to the location of the user equipment when the user equipment moves, add the physical resources of the new coverage area to the dedicated dynamic resource pool, and remove the physical resources of the far-away area from the dedicated dynamic resource pool. The user equipment does not need to perform handover signaling and the communication is not interrupted.

18. The system according to claim 14, characterized in that, Multiple user devices' dedicated dynamic resource pools are allowed to overlap in terms of physical resources. The logical processing center resolves resource conflicts caused by overlap through a two-step deterministic arbitration.

19. The system according to claim 18, characterized in that, The two-step deterministic arbitration adopts either the order of conflict arbitration followed by resource inspection, or the order of resource inspection followed by conflict arbitration.

20. The system according to claim 14, characterized in that, The physical access node broadcasts an access commitment including a future target time and a network signature; after verifying the network signature, the user equipment calculates public access resources based on the access commitment and its own identifier at the target time and sends an access request; the logical processing center allocates an initial dedicated dynamic resource pool to the user equipment according to the service identifier carried in the access request, and issues the pool size of the initial dedicated dynamic resource pool and the sharing rules through the access response.

21. The system according to claim 20, characterized in that, The access response also includes physical layer configuration parameters of the dedicated dynamic resource pool, which include at least one or more of the following: operating frequency, channel bandwidth, and subcarrier spacing.

22. The system according to claim 14, characterized in that, The logical processing center and the physical access node are connected via a fronthaul network, which supports high-precision time synchronization.

23. A logic processing center, characterized in that, Used to implement the steps performed by the network side in the method of any one of claims 1 to 13, or used in any one of claims 14 to 22.

24. A physical access node, characterized in that, Used to implement the steps performed by the physical access node in the method of any one of claims 1 to 13, or used in the system of any one of claims 14 to 22.

25. A user equipment, characterized in that, Used to implement the steps performed by the user equipment in the method of any one of claims 1 to 13, or used in the system of any one of claims 14 to 22.

Images