Space internet non-fixed topology addressing physical deviation correction cooperative routing method and system

Abstract

This invention provides a method and system for non-fixed topology addressing, physical correction, and collaborative routing in the space internet. The method acquires the coordinates, medium, level, time phase, object fingerprint, reference frame version, and continuity residual information of the target physical space unit; derives a dynamic seed locally based on shared physical synchronization conditions and generates a space internet address vector by combining it with a topology descriptor; performs physical layer coherent correction using a highly stable physical reference benchmark; calculates the physical path cost based on the medium parameters, phase time, and continuity residual in the address vector, and performs path selection, switching, rejection, or reselection among heterogeneous medium paths; performs break resynchronization when continuity is interrupted; and achieves compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems through a physical semantic interface layer. This invention realizes the generation, resolution, correction, routing, recovery, and bridging of spatial addresses.

Description

Technical Field

[0001] This invention relates to the fields of space internet, space computing, integrated communication, cross-media transmission, physical layer coherent correction, and network protocol compatibility mapping. Specifically, it relates to a method and system for non-fixed topology addressing, physical layer coherent correction, and cooperative routing in space internet for 6G / WiFi 8 and high-frequency communication environments. In particular, it relates to a technical solution that generates space internet address vectors based on physical spatial coordinates, media parameters, vertical hierarchy, time phase, object fingerprint, reference system version, and cross-media continuity residuals, and performs physical path cost evaluation, cross-media path selection, path switching, path rejection, continuity verification, and break resynchronization based on the address vectors. It also relates to a technical solution that establishes compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems through a physical semantic interface layer, while supporting centralized deployment, distributed deployment, or hierarchical implementation of highly stable physical reference benchmarks. Background Technology

[0002] 1. The space-based internet places new underlying requirements on native physical addressing.

[0003] With the development of 6G / WiFi 8, spatial computing, mixed reality, digital twins, embodied intelligence, and the low-altitude economy, network connectivity is gradually expanding from traditional device nodes to locations, regions, voxel units, and dynamic objects in real physical space. Information transmission in the future space internet will no longer be limited to a single terminal, interface, or logical network node, but will need to be precisely delivered to specific physical space units, specific vertical levels, specific media environments, and locations corresponding to specific object states.

[0004] In such scenarios, spatial location, medium environment, temporal phase, object state, reference frame conditions, and continuity relationships collectively determine whether information can be stably and accurately delivered to the target spatial unit. Therefore, the primary challenge for the space internet is how to natively represent and address physical spatial units, rather than simply continuing the addressing methods used in traditional networks that are oriented towards device interfaces and logical links.

[0005] 2. Existing logical network addressing systems are ill-suited to directly assume the native addressing responsibilities of the space internet.

[0006] The existing IPv4, IPv6, and related addressing systems are primarily designed for hosts, interfaces, and network topologies. Their address semantics typically correspond to logical nodes rather than physical spatial units in the real world. Even when map coordinates, spatial labels, or database indexes are added at the application layer, they are usually only supplementary descriptions of the logical address, rather than being an integral part of the address's native semantics.

[0007] In scenarios involving high-speed movement, multipath reflection, occlusion changes, overlapping floors, air-to-ground switching, media changes, or low-altitude dynamic communication, using the traditional logical address system to handle spatial delivery tasks can easily lead to problems such as disconnection between logical addresses and actual physical locations, spatial drift, content misalignment, inaccurate delivery, path misselection, and switching mismatch. Existing logical network address systems also typically struggle to directly incorporate media environment, time phase, object fingerprints, reference frame versions, and continuous residual information, making them unsuitable for fulfilling native addressing responsibilities in spatial internet scenarios.

[0008] 3. Existing coordinate systems and spatial grid indexing systems lack protocol-level physical semantics.

[0009] Existing coordinate systems include WGS-84, local coordinate systems, H3 geometric indexes, S2 geometric indexes, and other discrete spatial unit partitioning systems, primarily used for location representation, geographic grid partitioning, or spatial index calculation. These systems can provide coordinate or indexed representations of points, surfaces, regions, or grid units in the real world, but they typically do not directly carry protocol-layer semantics such as medium parameters, time phase, object state, continuity residuals, path state, and reference datum.

[0010] Therefore, while existing spatial coordinate systems and grid indexing systems can provide a foundation for location representation, they are difficult to directly constitute the underlying address objects for the space Internet, and they are also difficult to undertake unified addressing, correction and routing input in processes such as cross-media transmission, path switching, path rejection, continuity verification and break recovery.

[0011] 4. Traditional routing mechanisms lack the ability to directly perceive physical media and spatial conditions.

[0012] Existing routing protocols typically select paths based on link reachability, hop count, bandwidth, congestion status, or policy rules. Their judgments primarily focus on logical links and network topology, rather than physical propagation conditions in the real world. For diverse media environments such as air, water, walls, building interfaces, free-space optical links, terahertz links, quantum links, and reconfigurable smart surface reflection paths, existing routing mechanisms generally lack direct protocol-level expression and judgment methods.

[0013] In the context of the space internet, the goal is not merely to reach a network node, but to reach the correct spatial unit along an acceptable physical path. If the routing mechanism cannot directly utilize the medium parameters, time phase, continuity residuals, and spatial location constraints related to the target spatial unit, it will be difficult to perform path sorting, path filtering, path switching, path rejection, or path reselection in advance before signal attenuation, increased obstruction, phase mismatch, medium switching, or dynamic movement. Therefore, traditional logical routing mechanisms are insufficient to meet the requirements of the space internet for integrated addressing and routing.

[0014] 5. High-frequency and cross-medium environments place higher demands on physical layer bias correction.

[0015] In high-frequency communication environments such as 6G, millimeter wave, terahertz, and free-space optical communication, narrower beams, higher resolution, and greater phase sensitivity place higher demands on system time synchronization accuracy, phase stability, and physical layer consistency. Traditional crystal oscillators, ordinary clock synchronization, and software layer compensation methods are susceptible to phase noise, clock jitter, frequency doubling errors, Doppler diffusion, and media disturbances, leading to address drift, path evaluation distortion, handover mismatch, and cross-media transmission interruptions.

[0016] In existing technologies, address generation, physical correction, path decision-making, and handover recovery are typically handled at different levels, operating independently. There is a lack of underlying protocol methods that coordinate constraints around the same address object, the same physical reference base, and the same continuity context. Furthermore, excessively restricting high-precision physical reference mechanisms to a specific hardware device, a single reference source form, or a single path correction method weakens the versatility and scalability of the protocol layer.

[0017] 6. Existing technologies lack a hierarchical reference benchmark mechanism for different deployment levels.

[0018] For mobile terminals, vehicle-mounted nodes, wearable devices, unmanned system nodes, or other resource-constrained nodes, requiring them to directly configure high-cost and highly complex reference sources often leads to excessively high deployment barriers, making it difficult to achieve large-scale deployment applications. On the other hand, completely abandoning highly stable physical references makes it difficult to guarantee spatial addressing accuracy, path switching accuracy, and continuous maintenance accuracy in high-frequency, cross-media, and high-dynamic scenarios.

[0019] Existing technologies generally lack a protocol-level constraint mechanism that enables hierarchical coordination among centrally deployed reference sources, distributed reference networks, edge-side reference sources, and terminal-side reference sources.

[0020] 7. Existing cross-media transmission mechanisms lack the ability to inherit continuity and resynchronize after breaks.

[0021] In the transmission of data across heterogeneous media such as electrical, optical, quantum, terahertz, or free-space light, existing systems typically maintain connections using software lookup tables, link reconnection, protocol re-encapsulation, or ordinary rerouting methods. While these methods can restore link connectivity to some extent, they often introduce additional latency and may cause problems such as phase continuity breaks, address context loss, unverifiable routing states, discontinuous physical source relationships, and excessively high recovery costs.

[0022] For scenarios such as mixed reality spatial interaction, unmanned system collaboration, low-altitude economic dispatch, digital asset mounting, vehicle / shipborne spatial connectivity, and accident physical tracing, the system not only needs to reconnect but also needs to maintain physical continuity, spatial identity consistency, and path context consistency before and after switching or interruption. Existing technologies generally lack a continuity inheritance and break resynchronization mechanism based on the most recent valid residual summary, phase continuity fingerprint, and recovery window.

[0023] 8. Existing technologies lack tiered processing and critical node verification mechanisms to address computing power pressure.

[0024] If the complex address mapping, physical correction, residual closure, path acceptability judgment and continuity recovery calculations are all performed on the terminal side, hop-by-hop node or in each hop forwarding process, it is easy to bring high real-time computing power overhead and latency pressure. This problem is even more prominent when 256-bit address vectors, non-fixed topology mapping, cross-media path evaluation and dynamic continuity maintenance coexist.

[0025] Existing technologies typically lack a protocol layer mechanism that can hierarchically organize address semantics, path semantics, and continuity semantics, and distribute different computational loads between ordinary nodes and critical nodes. At the same time, they also lack a mechanism that allows ordinary nodes to perform lightweight processing, and edge nodes, media switching nodes, candidate path filtering nodes, or continuity anomaly nodes to perform phased residual verification, enhanced correction, and path acceptability judgment.

[0026] 9. The existing system lacks a unified physical semantic interface layer and a compatible bridging mechanism.

[0027] The actual deployment of the space internet cannot be completely separated from the existing internet infrastructure, spatial coordinate system, and geospatial indexing system. The existing IPv6 network will continue to serve as the control plane, bearer plane, or session organization function for a long time; the existing WGS-84, local coordinate system, H3, S2, and other systems will continue to serve as the location representation, spatial grid division, and spatial indexing function for a long time.

[0028] However, existing technologies typically lack a unified mechanism capable of establishing scalable mapping, encapsulation, bridging, or indexing relationships between native address objects of the spatial Internet and existing logical network address systems, spatial grid indexing systems, and coordinate reference systems, while maintaining the independence of these objects. Furthermore, existing technologies also typically lack a physical semantic interface mechanism capable of converting physical spatial coordinates, medium constraints, time phase, reference system conditions, continuity residuals, or their equivalent expressions into interface expressions that can be invoked by existing logical network address systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems.

[0029] 10. Existing technologies lack a unified underlying protocol solution suitable for high-value private networks and extreme physical environments.

[0030] In low-altitude unmanned systems, unmanned docks, mines, tunnels, underwater spaces, vehicle / shipborne space connections, and other scenarios with high obstruction, high dynamics, and high continuity requirements, traditional addressing and routing mechanisms oriented towards logical nodes and logical links are more likely to expose problems such as spatial delivery mismatch, insufficient adaptation to topology changes, excessive path recovery costs, and insufficient continuity maintenance capabilities.

[0031] Current technologies lack a unified underlying protocol solution that can simultaneously meet the requirements of native spatial addressing, cross-media cooperative routing, continuous recovery, and compatibility with existing infrastructure in such high-value private networks or extreme physical environments.

[0032] 11. Overall shortcomings of existing technologies

[0033] In summary, the existing technology has at least the following shortcomings:

[0034] (1) It is difficult to construct a native addressing system that directly addresses physical space units;

[0035] (2) It is difficult to ensure that the spatial address vector is consistently generated, parsed and restored by the sending end, receiving end, routing node, edge node or control node under non-fixed topology conditions;

[0036] (3) It is difficult to perform physical layer coherent correction of phase drift, clock jitter, Doppler spread and path switching errors in high-frequency communication environments based on a highly stable physical reference.

[0037] (4) It is difficult to achieve hierarchical configuration and collaborative provision of highly stable physical reference benchmarks across different deployment levels;

[0038] (5) It is difficult to calculate the physical path cost and perform path sorting, path filtering, path switching, path rejection or path reselection based on the medium parameters, phase time information and continuity residual in the address vector;

[0039] (6) It is difficult to allocate different verification, correction and path acceptability judgment loads between ordinary nodes and critical nodes in order to balance real-time performance and accuracy.

[0040] (7) It is difficult to inherit the phase continuity fingerprint and complete the break resynchronization when the path is switched, the medium is converted, the path is unverifiable or the link is interrupted for a short time;

[0041] (8) It is difficult to directly feed back the survival state determination and conflict detection results in the spatial state machine to the cooperative routing decision-making process;

[0042] (9) It is difficult to establish a unified and scalable compatibility relationship between the native address objects of the spatial Internet and the existing IPv6 address system, spatial grid index system and coordinate reference system through a unified physical semantic interface layer.

[0043] Therefore, it is necessary to propose a non-fixed topology addressing physical correction cooperative routing method and system for the space Internet, which integrates spatial address generation, physical layer correction, path cost evaluation, cross-media path selection, path switching or path rejection, state feedback, continuity inheritance, break resynchronization, and compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems through the physical semantic interface layer into the same underlying protocol framework. Summary of the Invention

[0044] To address the problems of existing technologies, such as difficulty in natively representing physical spatial units, difficulty in maintaining consistency between spatial addresses and physical paths in high-frequency and cross-media environments, difficulty in directly executing cooperative routing decisions based on physical fields in addresses, and difficulty in establishing a unified and compatible relationship with existing logical network address systems, spatial grid index systems, and coordinate reference systems, this invention provides a non-fixed topology addressing physical correction cooperative routing method and system for the spatial Internet.

[0045] This invention aims to construct a low-level protocol system for space internet scenarios, which integrates physical space coordinates, medium parameters, vertical hierarchy, time phase, object fingerprint, reference system version, and cross-media continuity residual information into the address expression framework. Through dynamic seed local deterministic derivation, non-fixed topology mapping, highly stable physical reference coherent correction, physical path cost evaluation, cross-media cooperative routing selection, path switching or path rejection, spatial state machine feedback, phase continuity inheritance, break resynchronization, and through a physical semantic interface layer to achieve compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems, it realizes the generation, parsing, correction, routing, recovery, and bridging of spatial addresses.

[0046] To achieve the above objectives, the present invention adopts the following technical solution:

[0047] This invention provides a non-fixed topology addressing physical correction cooperative routing method for the space Internet, comprising the following steps:

[0048] S1. Obtain the original field set corresponding to the target physical space unit.

[0049] The original field set includes at least physical space coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference frame version information, and cross-medium continuity residual information. This original field set serves as the fundamental input for spatial internet address vector generation, path evaluation, continuity verification, and break resynchronization.

[0050] S2. Based on the shared physical synchronization conditions, the sending end, receiving end, routing node, edge node, or control node each deterministically derive a dynamic seed locally.

[0051] The shared physical synchronization conditions include at least one or more of the following: a reference clock, a reference time or reference phase reference, a time slot identifier, a beam identifier, reference system version information, phase summary information, a physical characteristic entropy summary, a medium state summary, and negotiation parameters. The dynamic seed is independently calculated locally by multiple nodes based on the same input conditions, without being explicitly transmitted through ordinary network control signaling.

[0052] S3. Based on the topology descriptor and the dynamic seed, perform a non-fixed topology mapping on the original field set to generate a spatial internet address vector.

[0053] The spatial internet address vector, as a native address object oriented towards physical spatial units, is used to carry spatial semantics, medium semantics, temporal semantics, object semantics, and continuity semantics. Preferably, the spatial internet address vector is a 256-bit address vector, used to uniformly carry one or more of the following fields: medium identifier field, spatial hash field, vertical hierarchy field, phase timestamp field, object fingerprint field, reference frame version field, continuity residual field, and topology descriptor field; wherein, the spatial internet address vector may include a static spatial code portion for representing relatively stable spatial semantics, and a dynamic offset fingerprint portion for representing phase, continuity residual, dynamic medium state, or path state.

[0054] Furthermore, the topology descriptor field is used to indicate the arrangement order, segmentation method, field boundaries, interpretation relationship, or mapping template of the remaining fields in the spatial Internet address vector; the non-fixed topology mapping is a non-linear bijective mapping driven by the topology descriptor and the dynamic seed, so that the spatial Internet address vector has different field topology structures under different physical locations, time phases, media states, path states, or routing jump conditions, and can be consistently resolved by nodes with the same shared physical synchronization conditions.

[0055] S4. Based on the phase reference provided by the highly stable physical reference benchmark, perform physical layer coherent correction on at least one stage of the spatial Internet address vector during generation, transmission, resolution, path evaluation, routing decision, or continuity verification.

[0056] The phase-time constraint of the spatial Internet address vector is kept associated with the phase reference. The highly stable physical reference is used to provide a highly stable phase reference that meets the preset requirements for spatial addressing accuracy, path switching accuracy, or continuity maintenance accuracy. It corrects at least one of phase noise, clock jitter, frequency doubling error, Doppler diffusion, medium refractive index change, or path switching phase deviation in high-frequency, terahertz, or cross-medium transmission environments through reference mapping, time-frequency locking, phase injection, synchronous reference distribution, electro-optic mapping, or equivalent methods.

[0057] Furthermore, the highly stable physical reference reference is preferably an optical-grade physical reference source, and in a preferred embodiment, it is an optical frequency comb. The highly stable physical reference reference can be provided by a centrally deployed reference source, a distributed reference network, a terminal-side reference source, an edge-side reference source, or a combination thereof. As long as the preset spatial addressing accuracy, path switching accuracy, or continuous maintenance accuracy requirements are met, it is considered a highly stable physical reference reference.

[0058] S5. The routing node, edge node, or control node parses the medium parameter field, phase-time field, and cross-medium continuity residual field from the spatial Internet address vector, and calculates the physical path cost based on at least two of the medium parameter field, phase-time field, and cross-medium continuity residual field.

[0059] The physical path cost is used to characterize the comprehensive cost of the current path or candidate path in terms of media adaptability, phase consistency, continuity maintenance, propagation loss, path stability, security and reliability, or resource consumption.

[0060] Furthermore, the physical path cost is calculated based on one or more of the following in the spatial Internet address vector: medium parameter field, cross-medium continuity residual field, phase timestamp field, physical feature entropy summary, local link feedback, field strength feature, delay deviation, path loss, medium refractive index, Doppler feature, security level, energy consumption constraint, or routing resource occupancy status. The physical path cost is used to perform path sorting, path filtering, path switching triggering, path rejection, or path reselection on multiple candidate medium paths. The physical path cost can be implemented using explicit cost functions, weighted summation, threshold determination, rule matching, graph optimization, machine learning models, neural network scoring, policy network output, or equivalent forms.

[0061] Furthermore, the calculation of physical path cost, residual verification, or path acceptability determination can be performed by ordinary nodes with lightweight processing, and by edge nodes, media switching nodes, candidate path screening nodes, continuity anomaly nodes, or other key nodes with phased residual verification, enhanced correction, or path acceptability determination.

[0062] S6. Based on the physical path cost, perform cooperative routing path selection, adaptive path switching, path rejection, or path reselection among at least two of the following: dielectric path, optical medium path, quantum medium path, terahertz path, free-space optical path, reconfigurable smart surface reflection path, or other medium paths with different propagation parameters.

[0063] The path processing uses the physical field in the spatial Internet address vector or its equivalent representation as the path basis, so that the address vector simultaneously undertakes addressing semantics and routing semantics.

[0064] S7. During the cooperative routing path selection, adaptive path switching, path rejection, or path reselection process, cross-media phase continuity inheritance and continuity verification are performed based on at least one of the phase time field, phase continuity fingerprint, or cross-media continuity residual field in the spatial Internet address vector.

[0065] To maintain the recoverable consistency of physical source relationships, spatial identity relationships, or continuity relationships before and after cross-media transmission.

[0066] S8. Perform liveness determination and conflict detection on the spatial Internet address vector based on the spatial state machine, and use the liveness determination result or conflict detection result as feedback input for the cooperative routing path selection, adaptive path switching, path rejection or path reselection.

[0067] Preferably, the spatial state machine includes S-TTL time-to-live determination and S-CD conflict detection, used to implement address refresh, conflict arbitration and routing feedback.

[0068] S9. In the event of continuous interruption, path switching failure, unverifiable path, or physical layer obstruction, perform break resynchronization based on the most recent valid residual summary within a preset recovery window, and trigger readdressing, link fallback, path reselection, state failure, or security lockout if resynchronization fails.

[0069] The break resynchronization is used to prioritize the recovery of address context and routing context in the event of short-term obstruction, handover mismatch, or continuous break, rather than immediately performing full-link reconstruction.

[0070] Furthermore, the spatial internet address vector establishes an atomic binding relationship with medium parameter information, time phase information, cross-medium continuity residual information, path status information, recovery context information, or their equivalent representations; the atomic binding relationship is used to ensure that the address vector maintains synchronous interpretation, synchronous refresh, synchronous failure, or synchronous recovery with its corresponding physical context during path evaluation, path selection, path switching, path rejection, path reselection, continuity verification, or breakage resynchronization processes.

[0071] S10. Through the physical semantic interface layer, map, encapsulate, bridge, or index the spatial internet address vector, at least some fields in the original field set, or their equivalent representations, with the existing logical network address system, spatial grid index system, or coordinate reference system to achieve compatible interaction between the spatial internet protocol and existing network protocols or spatial coordinate systems.

[0072] The physical semantic interface layer is used to convert physical space coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference system version information, cross-media continuity residual information, or their equivalent representations into interface expression results that can be called by the existing system. The above-mentioned compatible mapping, encapsulation, bridging, or index association does not change the native protocol status of the spatial Internet address vector. The existing logical network address system, spatial grid index system, and coordinate reference system participate in protocol interaction as one of the input layer, carrier layer, bridging layer, or index layer.

[0073] Furthermore, the physical spatial coordinate information, spatial hash field, reference system version field, or their equivalent representation can be generated from the WGS-84 coordinate system, local coordinate system, geospatial grid index system, spatial hash index system, or a combination thereof; the geospatial grid index system includes one or more of the H3 geometric index, S2 geometric index, or other discrete spatial unit partitioning systems, and can be used as the input field, spatial hash field, index field, or bridging field of the spatial Internet address vector.

[0074] Furthermore, the physical semantic interface layer is used to convert the spatial Internet address vector, at least some fields in the original field set, the continuity residual field, the medium parameter field, or their equivalent representations into an interface expression result that can be called by existing logical network address systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems, and to encapsulate, map, index, or bridge the interface expression result; the existing logical network address system includes the IPv6 address system, the IPv6 extension header system, the network layer message system, or their equivalent systems.

[0075] This invention also provides a non-fixed topology addressing physical correction cooperative routing system for the space internet, comprising: a space information acquisition module, a dynamic seed synchronization module, an address generation module, a physical layer correction module, a path cost evaluation module, a cooperative routing decision module, a space state machine module, a continuity verification and resynchronization module, and a compatible bridging module. Wherein:

[0076] The spatial information acquisition module is used to acquire the original field set corresponding to the target physical space unit; the dynamic seed synchronization module is used to deterministically derive dynamic seeds locally based on shared physical synchronization conditions.

[0077] The address generation module is used to perform non-fixed topology mapping on the original set of fields based on the topology descriptor and dynamic seed to generate spatial Internet address vectors.

[0078] The physical layer correction module is used to perform coherent correction on the spatial Internet address vector, routing path or cross-media transmission process based on a highly stable physical reference.

[0079] The path cost evaluation module is used to parse the medium parameter field, phase time field, cross-medium continuity residual field or their equivalent representation in the spatial Internet address vector, and to calculate the physical path cost.

[0080] The cooperative routing decision module is used to perform cooperative routing path selection, adaptive path switching, path rejection, or path reselection among at least two different media paths based on the physical path cost.

[0081] The spatial state machine module is used to perform S-TTL lifetime determination and S-CD collision detection, and output state feedback to the cooperative routing decision module.

[0082] The continuity verification and resynchronization module is used to perform phase continuity fingerprint inheritance, continuity verification and break resynchronization when there is cross-media transmission, path switching, path rejection, continuity interruption or path unverifiable.

[0083] A compatible bridging module is used to establish mapping, encapsulation, bridging, or index association between the spatial internet address vector, at least some fields in the original field set, spatial hash field, continuous residual field, medium parameter field, reference system version field, or their equivalent representation, and existing logical network address system, coordinate reference system, geospatial grid index system, or a combination thereof, through the physical semantic interface layer.

[0084] In some implementations, the physical semantic interface layer is used to output one or more of the following: field mapping results, interface metadata, bridging context objects, index association objects, control plane interface parameters, bearer plane interface parameters, session context parameters, or routing metadata objects. These modules can be centrally deployed on a single device or distributed across terminals, base stations, photonic gateways, reconfigurable smart surface nodes, edge nodes, low-altitude communication nodes, vehicle-mounted communication nodes, unmanned system nodes, or cloud-edge collaborative control platforms. They work collaboratively around the same spatial internet address vector, shared physical synchronization conditions, and continuous residuals to achieve spatial internet address vector generation, physical correction, path cost evaluation, collaborative routing selection, cross-media handover, status feedback, continuity verification, break resynchronization, and compatible interaction with existing address systems or spatial coordinate systems. Further, in some implementations, the highly stable physical reference benchmark is preferably deployed on base stations, photonic gateways, edge nodes, or cloud-edge collaborative control platforms. Terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes preferably perform local phase calculation, residual tracking, address resolution, or constrained synchronization recovery.

[0085] Compared with the prior art, the present invention has at least the following beneficial effects:

[0086] (1) This invention integrates physical space coordinates, medium parameters, vertical hierarchy, time phase, object fingerprint, reference system version and cross-media continuity residual information into the original field set and spatial Internet address vector, so that the address object can directly face the physical space unit for native expression and native addressing, reducing spatial drift, content misalignment and delivery inaccuracy caused by the disconnect between logical address and real spatial location.

[0087] (2) This invention drives non-fixed topology mapping by using a 256-bit spatial Internet address vector, topology descriptor and dynamic seed, so that the address field structure can change dynamically with physical location, time phase, medium state, path state or routing jump conditions, which improves the address structure’s ability to resist bypassing field rearrangement, protocol wrapping, static reverse analysis and substitution expression; at the same time, by dividing the address vector into a static spatial code part and a dynamic offset fingerprint part, it is beneficial to realize address layer processing and computing power decoupling without changing the original semantics of the address.

[0088] (3) By sharing physical synchronization conditions, the present invention can deterministically derive dynamic seeds locally on multiple nodes, thereby reducing the signaling overhead, synchronization delay and leakage risk caused by explicit seed distribution, enabling the sending end, receiving end, routing node, edge node or control node to maintain a consistent encoding, parsing, field reorganization and routing processing basis around the same address semantics.

[0089] (4) The present invention performs physical layer coherent correction on the address generation, transmission, resolution, path evaluation, routing decision and continuity verification process through a highly stable physical reference benchmark, which improves the phase consistency, time consistency and spatial alignment accuracy between spatial address and real physical path in high frequency, terahertz and cross-medium environments; at the same time, by describing the highly stable physical reference benchmark as a general physical constraint source that can be provided by a centralized deployment reference source, a distributed reference network, a terminal-side reference source, an edge-side reference source or a combination thereof, rather than being limited to a single device, a single reference source form or a single path correction method, the universality of the underlying protocol and the hierarchical deployment capability of the present invention are enhanced.

[0090] (5) This invention analyzes the medium parameter field, phase time field and cross-medium continuity residual field in the spatial Internet address vector and calculates the physical path cost accordingly, thereby upgrading the routing decision from the traditional logical link-oriented selection method to a spatial routing decision oriented towards physical medium, phase continuity and path state; the path cost supports multiple implementation methods such as explicit cost function, weighted summation, threshold determination, rule matching, graph optimization, machine learning model, neural network scoring, policy network output, etc., which improves the compatibility and scalability of different algorithm implementation paths.

[0091] (6) By allowing ordinary nodes to perform lightweight path processing, and allowing edge nodes, media switching nodes, candidate path screening nodes, continuity anomaly nodes or other key nodes to perform phased residual verification, enhanced correction or path acceptability determination, the present invention reduces the real-time computing pressure caused by full hop-by-hop recalculation of the entire network, which is conducive to improving latency performance and system resource utilization efficiency while ensuring the protocol accuracy target.

[0092] (7) The present invention can perform cooperative routing path selection, adaptive switching, path rejection and path reselection between dielectric path, optical path, quantum path, terahertz path, free space optical path, reconfigurable smart surface reflection path or other heterogeneous medium path, and perform phase continuity inheritance and continuity verification based on phase time field, phase continuity fingerprint or cross-medium continuity residual field during the switching process, thereby improving the data delivery continuity and link availability in complex occlusion, multipath reflection, medium change and high dynamic scenarios.

[0093] (8) This invention incorporates spatial state machine feedback directly into the collaborative routing decision-making process through S-TTL lifetime determination and S-CD conflict detection, enabling displacement changes, phase changes, field strength characteristics, object fingerprints, path costs and routing resource status to participate in address refresh, conflict arbitration, path acceptance or path rejection, thereby improving the real-time performance, robustness and security of spatial address management and routing resource management.

[0094] (9) This invention establishes an atomic binding relationship between the spatial Internet address vector and medium parameter information, time phase information, cross-medium continuity residual information, path state information, recovery context information or their equivalent representations, and inherits the phase continuity fingerprint when the path is switched, the cross-medium transmission is carried out, the path is rejected, the path is unverifiable or the continuity is interrupted. Based on the most recent valid residual digest, the break resynchronization is performed, so that the address context, routing context and its corresponding physical context can be synchronously interpreted, synchronously refreshed, synchronously invalidated or synchronously recovered after short-term occlusion, switching mismatch or medium switching, thereby reducing the latency and state loss caused by full readdressing, full reconnection or full link reconstruction.

[0095] (10) This invention converts the spatial Internet address vector, at least some fields in the original field set, the continuity residual field, the medium parameter field, or their equivalent representation into an interface expression result that can be called by existing logical network address systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems through the physical semantic interface layer, and encapsulates, maps, indexes, or bridges such interface expression results. This allows the invention to maintain its native spatial addressing capabilities while possessing compatibility and interaction capabilities with existing IPv6 network systems, spatial indexing systems such as H3 / S2, and existing coordinate systems. At the same time, it connects the physical semantic interface layer through a compatibility bridging module. The output field mapping results, interface metadata, bridging context objects, index association objects, control plane interface parameters, bearer plane interface parameters, session context parameters, or routing metadata objects are supported. It also supports the centralized deployment of highly stable physical reference benchmarks in base stations, photonic gateways, edge nodes, or cloud-edge collaborative platforms, and the execution of local phase calculations and limited synchronization recovery on resource-constrained nodes. This enables the invention to support both centralized deployment and collaborative work between terminals, vehicle-mounted nodes, wearable nodes, and other distributed nodes, providing unified underlying technical support for scenarios such as mixed reality space interaction, real-scene annotation, digital asset mounting, embodied intelligent collaboration, low-altitude economic scheduling, and accident physical tracing.

[0096] (11) The spatial Internet address vector and physical semantic interface layer in this invention can serve as the basis for unified address expression and interface call in the spatial Internet scenario, enabling different terminals, nodes, bearer protocols, spatial grid index systems, coordinate reference systems or control systems to extend access, be compatible with calls and be collaboratively developed around the same native address object. This is conducive to improving the adaptability and promotion value of this invention under multiple devices, multiple networks and multiple scenarios, and provides technical support for the subsequent formation of a unified spatial addressing and bridging interface basis. Attached Figure Description

[0097] Figure 1A schematic diagram of the overall process and feedback loop of the non-fixed topology addressing physical correction cooperative routing method for the space Internet;

[0098] Figure 2 This is a schematic diagram illustrating the relationship between a primitive set of fields, a spatial address input vector, and a spatial internet address vector.

[0099] Figure 3 This is a schematic diagram of a dynamic seed local deterministic derivation process based on shared physical synchronization conditions.

[0100] Figure 4 This is a schematic diagram of a non-fixed topology mapping and address vector generation process based on topology descriptors and dynamic seeds;

[0101] Figure 5 This is a schematic diagram of a physical layer coherent polarization correction process based on a highly stable physical reference benchmark.

[0102] Figure 6 This is a schematic diagram of a physical path cost assessment and path selection process.

[0103] Figure 7 This is a schematic diagram of a cross-media collaborative routing path selection, adaptive path switching, path rejection and path reselection process.

[0104] Figure 8 This is a schematic diagram of an S-TTL lifetime determination, S-CD collision detection, and cooperative routing feedback process.

[0105] Figure 9 This is a schematic diagram of a cross-medium phase continuity inheritance, continuity verification, and breakage resynchronization process;

[0106] Figure 10 A schematic diagram of the collaborative routing system modules for non-fixed topology addressing in the space internet, involving physical correction and coordination.

[0107] Figure 11 This is a schematic diagram of a spatial Internet address vector compatibility mapping and bridging relationship. Detailed Implementation

[0108] The specific embodiments of the present invention will be further described below with reference to the accompanying drawings. It should be understood that the following embodiments are for illustrative purposes only and are not intended to limit the scope of protection of the present invention. Without departing from the concept of the present invention, any equivalent substitutions, structural adjustments, module splitting, module merging, parameter changes, deployment location changes, media replacements, reference datum replacements, algorithm implementation replacements, bearer form replacements, or bridging method replacements made by those skilled in the art based on this specification should fall within the scope of protection of the present invention.

[0109] This invention constructs a low-level protocol framework for spatial internet scenarios, with the spatial internet address vector as its core object. This spatial internet address vector is not simply a logical address, coordinate label, or index identifier, but rather a native protocol object formed around physical spatial units, media environment, time phase, object state, continuity residuals, and reference system conditions. It is used to uniformly support spatial addressing, physical layer correction, path cost evaluation, cross-media cooperative routing, state machine feedback, continuity verification, break resynchronization, and compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems.

[0110] In some embodiments, the method steps of this invention can be executed centrally by a single device or distributed across multiple nodes; these multiple nodes may include terminals, base stations, photonic gateways, reconfigurable smart surface nodes, edge nodes, low-altitude communication nodes, vehicle-mounted communication nodes, unmanned system nodes, cloud-edge collaborative control platforms, or combinations thereof. As long as the nodes collaboratively complete address generation, physical correction, path evaluation, collaborative routing, state feedback, continuity restoration, and compatibility bridging around the same spatial internet address vector, sharing physical synchronization conditions, physical reference benchmarks, and continuity residuals, it falls within the scope of this invention's implementation.

[0111] In some implementations, the present invention can run independently on the native protocol stack of the space internet, or it can run collaboratively with existing logical network protocols, coordinate reference systems, spatial grid indexing systems, control plane systems, or bearer message systems, without being contingent on any single hardware device, single medium link, single spatial indexing system, or single existing network protocol. Preferably, existing IPv6 address systems, IPv6 extension header systems, WGS-84 coordinate systems, local coordinate systems, H3 geometric indexes, S2 geometric indexes, or their equivalents can participate in the protocol interaction of the present invention as input layers, bridging layers, bearer layers, or indexing layers, without changing the native protocol status of the space internet address vectors.

[0112] Similarly, the physical layer correction and phase constraint in this invention do not require a single reference source as a prerequisite. As long as a highly stable physical reference benchmark can be provided that meets the preset requirements for spatial addressing accuracy, path switching accuracy, or continuity maintenance accuracy, it can be used as an implementation method of this invention. The highly stable physical reference benchmark can be implemented in a hierarchical manner, such as centralized deployment, distributed deployment, terminal side, edge side, or a combination thereof.

[0113] In some implementations, the address semantics, path semantics, and continuity semantics in the spatial Internet address vector can be processed in a layered manner. Ordinary nodes can perform lightweight address resolution, basic path processing, local residual judgment, or field inheritance, while edge nodes, media switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other critical nodes can perform phased residual verification, enhanced correction, path acceptability judgment, or recovery control. This reduces the real-time computing power pressure caused by hop-by-hop full computation while ensuring addressing accuracy and continuity objectives.

[0114] To facilitate understanding of this invention, some of the terms used in this invention are explained below. It should be understood that the following explanations of terminology are used to interpret the technical solutions of this invention and are not intended to limit the scope of protection of this invention. Equivalent interpretations, equivalent substitutions, or synonymous extensions of related terms without departing from the concept of this invention shall fall within the scope of protection of this invention.

[0115] (1) Spatial Internet address vector

[0116] A spatial internet address vector is an address representation used to characterize information such as a target physical space unit, medium environment, time phase, object state, reference frame version, and continuity residuals. The spatial internet address vector can be used for spatial addressing, physical correction, path cost evaluation, cooperative routing, path switching, path rejection, continuity verification, and break resynchronization. Preferably, the spatial internet address vector is a 256-bit address vector.

[0117] (2) Static spatial code

[0118] Static spatial code refers to the field portion of the spatial internet address vector used to represent relatively stable spatial semantics. The static spatial code is preferably used to carry spatial hashes, vertical hierarchies, reference frame versions, relatively stable object semantics, or other spatial representations with low update frequencies. The static spatial code can be preferentially processed by local low-power modules, terminal-side basic processing units, or other basic computing units.

[0119] (3) Dynamic offset fingerprint

[0120] Dynamic offset fingerprints refer to the field portion of a spatial Internet address vector used to characterize phase, continuity residuals, dynamic medium states, path states, or other parameters that change over time and with the propagation environment. The dynamic offset fingerprint preferably carries phase timestamps, continuity residuals, local medium disturbance summaries, dynamic synchronization states, path state summaries, or combinations thereof, and can be preferentially processed by edge nodes, high-performance gateways, critical nodes, or cloud-edge collaborative platforms.

[0121] (4) Non-fixed topology mapping

[0122] Non-fixed topology mapping refers to the dynamic configuration of the original field set by the combined action of topology descriptors and dynamic seeds, which includes the field arrangement order, splitting method, field boundaries, interpretation relationship or mapping template. This makes the address field structure independent of fixed offsets and fixed layouts, and can change with changes in physical location, time phase, media status, path status or routing jump conditions.

[0123] (5) Topological descriptor

[0124] A topology descriptor is control information used to indicate the order of fields, segmentation methods, field boundaries, interpretation relationships, or mapping templates in a spatial Internet address vector. The topology descriptor can be part of the address vector or as resolution control information associated with the address vector.

[0125] (6) Dynamic seeds

[0126] A dynamic seed is a dynamic control quantity that is deterministically derived locally by a sender, receiver, routing node, edge node, or control node based on shared physical synchronization conditions. It is used to drive non-fixed topology mapping, address resolution, field reassembly, path evaluation-related field interpretation, or routing-related topology configuration. Preferably, the dynamic seed is not explicitly transmitted through ordinary network control signaling.

[0127] (7) Shared physical synchronization conditions

[0128] Shared physical synchronization conditions refer to synchronization input conditions that can be jointly obtained or consistently recovered by the transmitting end, receiving end, routing node, edge node, or control node under the same time window, the same physical constraints, or the same reference frame. The shared physical synchronization conditions may include one or more of the following: reference clock, reference time or reference phase reference, time slot identifier, beam identifier, reference frame version information, phase summary information, physical characteristic entropy summary, medium state summary, and negotiation parameters.

[0129] (8) Highly stable physical reference standard

[0130] A highly stable physical reference benchmark refers to a reference benchmark that can provide highly stable physical constraints that meet preset requirements for spatial addressing accuracy, path switching accuracy, or continuous maintenance accuracy. The highly stable physical reference benchmark can be an optical-grade physical reference source, an atomic clock benchmark, a quantum time and frequency benchmark, a phase-locked microwave benchmark, a satellite timing benchmark, a distributed highly stable reference network, or other highly stable reference benchmarks that meet preset accuracy requirements; preferably, it is an optical-grade physical reference source, and more preferably, an optical frequency comb. The highly stable physical reference benchmark can be implemented in a hierarchical manner, such as centralized deployment, distributed deployment, terminal-side, edge-side, or a combination thereof.

[0131] (9) Physical path cost

[0132] Physical path cost refers to the path evaluation result calculated based on medium parameters, phase time, continuity residuals, local link feedback, and other path state information in the spatial Internet address vector. It is used to characterize the cost of the current path in terms of phase consistency, propagation loss, delay deviation, medium adaptability, path stability, continuity maintenance, security reliability, or resource consumption. The physical path cost can be used for path ranking, path filtering, path switching triggering, path rejection, or path reselection.

[0133] (10) Lightweight treatment

[0134] Lightweight processing refers to protocol processing methods with relatively low computational complexity, such as basic address resolution, local path determination, field inheritance, basic cost calculation, local residual determination, or other computationally inefficient operations performed by ordinary nodes. Lightweight processing is preferably used in ordinary forwarding nodes, resource-constrained nodes, terminal-side basic processing units, or other nodes that do not undertake full-scale enhanced verification responsibilities.

[0135] (11) Periodic verification of key nodes

[0136] Critical node phase verification refers to an enhanced verification process performed by edge nodes, media switching nodes, candidate path screening nodes, continuity anomaly nodes, or other critical nodes at specific stages on continuity residuals, path acceptability, correction effects, recovery conditions, or combinations thereof. The critical node phase verification may include residual verification, enhanced correction, path acceptability determination, continuity closure determination, or recovery trigger determination.

[0137] (12) Cooperative routing

[0138] Cooperative routing refers to the process of selecting, switching, rejecting, or reselecting paths among dielectric paths, optical paths, quantum paths, terahertz paths, free-space optical paths, reconfigurable smart surface reflection paths, or other heterogeneous media paths, based on the spatial Internet address vector and the physical field information it carries.

[0139] (13) Path veto

[0140] Path rejection refers to the process of preventing a candidate path from being selected as the target path when it is reachable but does not meet preset conditions such as phase continuity, media compatibility, path reliability, security, resource constraints, or continuity recovery.

[0141] (14) Phase continuity fingerprint

[0142] Phase continuity fingerprint refers to summary information of phase residuals, delay residuals, field strength residuals, path loss residuals, or combinations thereof used to characterize the previous transmission stage, previous routing path, previous medium state, or previous recovery state. It is used for continuity verification during cross-medium transmission, path switching, path rejection, or break resynchronization processes.

[0143] (15) Fracture Resynchronization

[0144] Disruption resynchronization refers to the process of constructing a temporary recovery state within a preset recovery window based on the most recent valid residual summary when phase continuity is interrupted, path switching mismatch occurs, path is unverifiable, physical layer obstruction occurs, residual mutation occurs, or routing path is unrecoverable. Then, based on the recovery quality assessment results, continuity is restored or readdressing, link fallback, path reselection, state failure, security lockout, or audit log is triggered.

[0145] (16) Restore context

[0146] Recovery context refers to a set of state information used to support break resynchronization, continuity recovery, address interpretation recovery, or route recovery. The recovery context may include the most recent valid residual digest, phase continuity fingerprint, path state information, reference frame version information, media state digest, address interpretation state, or a combination thereof.

[0147] (17) Physical semantic interface layer

[0148] The Physical Semantic Interface Layer (PSI) is an interface-based expression layer located between the spatial Internet address vector and existing logical network address systems, spatial grid indexing systems, coordinate reference systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems. The PSI transforms physical spatial coordinates, medium parameters, vertical hierarchy, time phase, object fingerprints, reference frame versions, continuity residuals, or their equivalent representations into interface expressions that can be invoked by existing systems. The PSI participates in protocol interaction as one of the input layer, bearer layer, bridging layer, or indexing layer, but does not alter the native protocol status of the spatial Internet address vector.

[0149] (18) Interface expression results

[0150] Interface representation results refer to the result objects output by the physical semantic interface layer that can be called, encapsulated, mapped, indexed, or bridged by existing systems. These interface representation results may include field mapping results, interface metadata, bridging context objects, index association objects, control plane interface parameters, bearer plane interface parameters, session context parameters, routing metadata objects, or combinations thereof.

[0151] (19) Atomic binding relationship

[0152] Atomic binding refers to the synchronous association established between a spatial Internet address vector and medium parameter information, time phase information, cross-medium continuity residual information, path state information, recovery context information, or their equivalent representations. This atomic binding ensures that the address vector maintains synchronized interpretation, synchronous refresh, synchronous failure, or synchronous recovery with its corresponding physical context during path evaluation, path selection, path switching, path rejection, path reselection, continuity verification, or breakage resynchronization processes.

[0153] (20) Equivalent representation

[0154] An equivalent representation is a compressed field, feature vector, intermediate resolution state, mapping index, context object, or other equivalent data representation that corresponds to the semantics of fields in the spatial Internet address vector and can be used for path evaluation, routing, path rejection, continuity verification, break resynchronization, or compatible bridging.

[0155] 1. Overall Process Implementation Example

[0156] The following is combined Figure 1 This document describes the overall process of the present invention. This embodiment illustrates the overall execution flow of the non-fixed topology addressing physical correction cooperative routing method for the space internet. This method can be deployed in space internet terminals, 6G / WiFi 8 base stations, photonic gateways, reconfigurable smart surface nodes, edge computing nodes, low-altitude communication nodes, vehicle-mounted communication nodes, unmanned system nodes, cloud-edge collaborative control platforms, or any combination thereof. It is used to achieve address generation, physical correction, path cost evaluation, cooperative routing selection, path switching, path rejection, path reselection, status feedback, continuity verification, break resynchronization, and compatible bridging of target physical space units.

[0157] In this embodiment, the target physical space unit can be a spatial voxel, a real geographic coordinate region, an interior space unit of a building, a low-altitude airway unit, a road space unit, a vehicle-mounted or ship-mounted mobile space unit, an augmented reality content mounting point, a digital asset binding point, an embodied intelligent control area, or other physical space areas that can be identified and reached by the Space Internet Protocol. The target physical space unit is not limited to a static geographical location, but can also be a spatial state unit that dynamically changes with the terminal, vehicle, drone, robot, or other mobile object.

[0158] In some implementations, the highly stable physical reference benchmark in this embodiment can be implemented in a hierarchical manner, such as centralized deployment, distributed deployment, terminal-side, edge-side, or a combination thereof; the address semantics, path semantics, and continuity semantics in the spatial Internet address vector can be processed in a layered manner, with ordinary nodes performing lightweight processing, and edge nodes, media switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other key nodes performing phased residual verification, enhanced correction, or path acceptability determination; compatible interaction is preferably completed through the physical semantic interface layer.

[0159] The method in this embodiment includes the following steps:

[0160] 1.1 Obtaining the Original Field Set

[0161] The system acquires the original field set corresponding to the target physical space unit. This original field set includes at least physical space coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference frame version information, and cross-medium continuity residual information. This original field set serves not only as input for address generation but also as the basis for path evaluation, continuity verification, and break resynchronization.

[0162] 1.2 Dynamic Seed Local Deterministic Derivation

[0163] Based on shared physical synchronization conditions, the system deterministically derives dynamic seeds locally at the transmitting end, receiving end, routing node, edge node, or control node. The shared physical synchronization conditions include at least one or more of the following: reference clock, reference time or reference phase reference, time slot identifier, beam identifier, reference system version information, phase summary information, physical characteristic entropy summary, medium state summary, and negotiation parameters. The dynamic seeds are not explicitly transmitted via ordinary network control signaling.

[0164] 1.3 Non-fixed topology address generation

[0165] The system performs a non-fixed topology mapping on the original field set based on the topology descriptor and the dynamic seed to generate a spatial internet address vector. Preferably, the spatial internet address vector is a 256-bit address vector used to uniformly select one or more of the following fields: bearer medium identifier field, spatial hash field, vertical hierarchy field, phase timestamp field, object fingerprint field, reference frame version field, continuity residual field, and topology descriptor field.

[0166] In some implementations, the spatial internet address vector may include a static spatial code portion and a dynamic offset fingerprint portion. The static spatial code portion is preferably used to carry relatively stable spatial semantics, while the dynamic offset fingerprint portion is preferably used to carry phase, continuity residual, dynamic medium state, path state, or other dynamically changing semantics.

[0167] 1.4 Physical Layer Coherent Polarization Correction

[0168] The system performs physical layer coherent correction on the spatial Internet address vector at least in one stage of generation, transmission, resolution, path evaluation, routing decision or continuity verification based on a phase reference provided by a highly stable physical reference, and keeps the phase time constraint of the spatial Internet address vector associated with the phase reference.

[0169] In some implementations, the highly stable physical reference reference may be provided by a base station, a photonic gateway, an edge node, a cloud-edge collaborative control platform, a terminal-side reference source, or a combination thereof; the high-precision reference capability is preferably centrally deployed in the base station, photonic gateway, edge node, or cloud-edge collaborative control platform, and the terminal, vehicle-mounted node, wearable node, or other resource-constrained node preferably performs local phase calculation, residual tracking, address resolution, or constrained synchronization recovery.

[0170] 1.5 Physical Path Cost Assessment

[0171] Routing nodes, edge nodes, or control nodes parse the medium parameter field, phase-time field, and cross-medium continuity residual field from the spatial Internet address vector, and calculate the physical path cost based on at least two of these fields. The physical path cost characterizes the combined cost of the current or candidate path in terms of media adaptability, phase consistency, continuity maintenance, propagation loss, path stability, security reliability, or resource consumption.

[0172] In some implementations, ordinary nodes can perform basic cost judgment, local field inheritance, or lightweight residual processing; edge nodes, media switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other critical nodes can perform phased residual verification, enhanced correction, or path acceptability judgment.

[0173] 1.6 Cooperative Routing Path Processing

[0174] Based on the physical path cost, the system performs cooperative routing path selection, adaptive path switching, path rejection, or path reselection among at least two of the following: dielectric path, optical path, quantum path, terahertz path, free-space optical path, reconfigurable smart surface reflection path, or other medium paths with different propagation parameters. The path processing uses the physical field in the spatial Internet address vector or its equivalent representation as the path basis.

[0175] In some embodiments, the present invention is preferably applicable to low-altitude unmanned systems, unmanned docks, mines, tunnels, underwater spaces, vehicle / shipborne space connections, and other scenarios with high obstruction, high dynamics, and high continuity requirements.

[0176] 1.7 Cross-media continuity inheritance and verification

[0177] During the collaborative routing path selection, adaptive path switching, path rejection, or path reselection process, the system uses at least one of the phase time field, phase continuity fingerprint, or cross-media continuity residual field in the spatial Internet address vector as a benchmark to perform cross-media phase continuity inheritance and continuity verification to determine whether the physical source relationship, spatial identity relationship, and continuity relationship before and after cross-media transmission remain recoverably consistent.

[0178] 1.8 Spatial State Machine Feedback

[0179] The system performs liveness determination and conflict detection on the spatial Internet address vectors based on a spatial state machine, and uses the liveness determination result or conflict detection result as feedback input for cooperative routing path selection, adaptive path switching, path rejection, or path reselection. Preferably, the spatial state machine includes S-TTL liveness determination and S-CD conflict detection.

[0180] In some implementations, when an S-TTL determination is abnormal, an S-CD conflict is aggravated, a path cost change occurs abruptly, a continuous residual change occurs abruptly, or an object fingerprint conflict occurs, the state machine feedback can trigger enhanced verification of critical nodes, path rejection, break resynchronization, or security locking.

[0181] 1.9 Fracture Resynchronization

[0182] When the system detects a continuous interruption, path switching failure, unverifiable path, or physical layer obstruction, the system performs break resynchronization within a preset recovery window based on the most recent valid residual summary; when resynchronization fails, it triggers readdressing, link fallback, path reselection, state failure, or security lock.

[0183] In some implementations, break resynchronization is preferably performed in combination with recovery context, phase continuity fingerprint, reference frame version information and path state information, so as to prioritize the recovery of address context and routing context, rather than immediately performing full link reconstruction.

[0184] 1.10 Bridge Compatibility

[0185] The system establishes mapping, encapsulation, bridging, or index association between the spatial Internet address vector, at least some fields in the original field set, or their equivalent representations, and the existing logical network address system, spatial grid index system, or coordinate reference system through the physical semantic interface layer.

[0186] In some implementations, the physical semantic interface layer can convert physical spatial coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference system version information, cross-media continuity residual information, or their equivalent representations, into interface expression results that can be invoked by existing systems. Preferably, the existing logical network address system includes the IPv6 address system, the IPv6 extension header system, the network layer packet system, or their equivalent systems; the spatial grid index system includes one or more of the H3 geometric index, the S2 geometric index, or other discrete spatial unit partitioning systems; and the coordinate reference system includes the WGS-84 coordinate system, the local coordinate system, or a combination thereof. The above-mentioned compatible interaction does not change the native protocol status of the spatial Internet address vector.

[0187] 1.11 Overall Technical Effects

[0188] Through the above process, this embodiment integrates spatial address generation, physical layer correction, path cost evaluation, cooperative routing path selection, path switching, path rejection, path reselection, state machine feedback, phase continuity inheritance, break resynchronization, and compatibility bridging with the existing system into the same underlying protocol process. This enables the spatial Internet address vector to not only express the target spatial location, but also participate in path evaluation, path acceptance, path rejection, state determination, recovery control, and bridging interaction.

[0189] Meanwhile, by introducing a hierarchical implementation of a highly stable physical reference benchmark, a layered organization of address vectors, a layered processing mechanism between ordinary nodes and key nodes, and a physical semantic interface layer, this embodiment further improves the stability, continuity, compatibility, deployability, and engineering implementation capabilities of the space internet in high-frequency, cross-media, high-dynamic, and multi-object competition scenarios.

[0190] 2. Example of Original Field Set and Spatial Address Input

[0191] The following is combined Figure 2 This embodiment explains the original field set and spatial address input vector. It further illustrates the acquisition, encoding, and spatial address input construction methods for the original field set corresponding to the target physical spatial unit. The original field set serves as the foundational input for subsequent dynamic seed local deterministic derivation, non-fixed topology mapping, physical layer coherent correction, physical path cost evaluation, cooperative routing path selection, path switching, path rejection, continuity verification, and break resynchronization. Unlike ordinary field inputs that only address generation, the original field set in this embodiment simultaneously serves three functions: spatial addressing input, physical path evaluation input, and continuity inheritance input.

[0192] In some implementations, the original set of fields is preferably represented as:

[0193]

[0194] in, Represents physical space coordinate information. Indicates medium parameter information, Represents vertical hierarchy information. Indicates time phase information, Represents the fingerprint information of the object. Indicates reference frame version information. This represents cross-media continuity residual information. The above field set is only a preferred representation. Without departing from the concept of this invention, the original field set may also include service priority, link status, beam status, path status, bridging status, security summary, or other fields related to spatial addressing, cooperative routing, and compatible bridging.

[0195] 2.1 Obtaining the original field set

[0196] In this embodiment, when the system starts a routing cycle, it acquires multi-source physical information corresponding to the target physical space unit through terminal-side sensing units, access-side nodes, edge-side nodes, cloud-control-side nodes, environment-side nodes, reconfigurable smart surface nodes, photonic gateways, or combinations thereof, and standardizes the multi-source physical information into an original field set. The target physical space unit can be a fixed spatial voxel or a dynamic spatial unit that changes with users, vehicles, drones, robots, shipborne platforms, or other moving objects. The original field set can be collected independently by a single node or collected distributed by multiple nodes and then fused, aligned, or restored.

[0197] 2.2 Physical Spatial Coordinate Information

[0198] The physical space coordinate information Used to describe the location of the target physical space unit in the real physical world. Preferably, the physical space coordinate information may include longitude, latitude, and elevation information in a global coordinate system, or it may include three-dimensional coordinate information in a local coordinate system, venue coordinate system, road coordinate system, building coordinate system, low-altitude airway coordinate system, or a hybrid reference system.

[0199] In some implementations, the physical spatial coordinate information can be obtained from GNSS, RTK, UWB, IMU, VIO, 6G / WiFi 8 integrated sensing, millimeter-wave radar, lidar, environmental anchors, spatial maps, or combinations thereof. For outdoor large-space scenarios, the physical spatial coordinate information can be obtained by fusing satellite positioning, ground base stations, and inertial measurement; for indoor or semi-outdoor scenarios, the physical spatial coordinate information can be obtained by constraining local anchors, visual inertial units, radio frequency sensing, and spatial maps.

[0200] The physical space coordinate information is not only used for address generation, but also serves as a spatial target constraint for subsequent physical path cost evaluation, path selection, path switching, path rejection, and continuity verification. When selecting a dielectric path, optical medium path, terahertz path, free space optical path, quantum medium path, or reconfigurable smart surface reflection path, the system can determine the position, orientation, distance, occlusion relationship, propagation geometry, and reachability of the target spatial unit based on the physical space coordinate information.

[0201] 2.3 Media Parameter Information

[0202] The medium parameter information This is used to describe the propagation characteristics of the medium environment in which the target physical space unit and its adjacent transmission path are located. Preferably, the medium parameter information may include one or more of the following: medium type, relative permittivity, magnetic permeability, electrical conductivity, refractive index, absorption coefficient, scattering coefficient, attenuation coefficient, propagation speed, path loss, ambient humidity, air density, wall material, water condition, metal reflection environment, electromagnetic interference level, or reconfigurable smart surface condition.

[0203] In some embodiments, the medium parameter information may correspond to air medium, underwater medium, solid-penetrating medium, vacuum medium, building wall medium, glass medium, vegetation-blocking medium, free-space light transmission medium, terahertz transmission medium, quantum link transmission medium, or a combination thereof. The medium parameter information may be jointly determined by environmental sensors, base station-side integrated sensing feedback, terminal-side link measurement, photonic gateway detection, reconfigurable smart surface feedback, edge node fusion, or historical environment models.

[0204] In this invention, medium parameter information is not only used to generate spatial internet address vectors, but also serves as an important input for physical path cost assessment, path ranking, path filtering, path switching triggering, path rejection, and path reselection. When the current path passes through walls, water bodies, areas with strong air disturbances, complex reflection areas, or high-loss medium areas, the system can increase the corresponding path cost based on the medium parameter information and trigger enhanced correction, path rejection, cross-medium switching, or path reselection.

[0205] 2.4 Vertical Hierarchical Information

[0206] The vertical hierarchy information This is used to address the issue of potential overlap between layers of different heights, floors, airspaces, or depths on two-dimensional projected coordinates. Preferably, the vertical hierarchy information can be used to distinguish between underground space, surface space, building floors, bridge layers, tunnel layers, low-altitude airway layers, near-Earth orbit layers, underwater layers, or other vertical space layers.

[0207] In the context of the space internet, relying solely on planar latitude and longitude coordinates can easily lead to address conflicts between objects on different floors, at different heights, or in different airspace paths. By incorporating vertical hierarchy information into the original field set, the system can distinguish multiple spatial levels at the same planar location when generating space internet address vectors, thereby improving the uniqueness of spatial voxel addresses and enhancing the accuracy of subsequent path evaluation, path selection, and conflict detection.

[0208] 2.5 Time Phase Information

[0209] The time phase information This information is used to describe the time phase state at the moment of address generation, transmission, resolution, path evaluation, or route switching. Preferably, the time phase information may include one or more of the following: reference time, phase timestamp, reference phase, carrier phase, phase summary, phase residual, or phase synchronization state.

[0210] The time phase information has at least the following functions in this invention:

[0211] (1) Used for participating in the local deterministic derivation of dynamic seeds;

[0212] (2) Used to participate in physical layer coherent polarization correction;

[0213] (3) Used for participating in cross-media cooperative routing handover;

[0214] (4) Used as a physical time reference for judging the acceptability of candidate paths and rejecting paths.

[0215] 2.6 Object fingerprint information

[0216] The object fingerprint information This is used to identify physical feature summaries of entities, terminal devices, digital assets, controlled objects, or virtual objects within a target physical space unit. Preferably, the object fingerprint information may originate from hardware unique fingerprints, physically unclonable functions, device fingerprints, material reflection characteristics, morphological characteristics, density characteristics, digital asset identifiers, controlled object identifiers, or combinations thereof.

[0217] In some implementations, the object fingerprint information can be used to distinguish multiple objects entering the same spatial voxel and provide an arbitration basis for S-CD conflict detection. When multiple objects compete for the spatial cell or routing resource corresponding to the same spatial Internet address vector, the system can determine the dominant object, subordinate object, candidate object, or object to be isolated based on the object fingerprint information, field strength characteristics, reflection characteristics, matter density fingerprint, and phase continuity fingerprint.

[0218] 2.7 Reference Frame Version Information

[0219] Reference system version information The reference system used to identify the current physical spatial coordinates, spatial hashes, vertical hierarchy, and medium parameters is the interpretation condition of the reference system. Since spatial maps, geographic models, building models, low-altitude flight path models, elevation benchmarks, local coordinate systems, and global coordinate systems may all be updated over time, failure to record the reference system version can easily lead to the same address being interpreted as a different physical location in different systems.

[0220] In some implementations, the reference frame version information may include one or more of the following: global coordinate reference version, local spatial map version, building information model version, low-altitude airway version, media model version, spatial anchoring rule version, or protocol interpretation version. When performing address resolution, path cost evaluation, continuity verification, routing node decoding, path rejection, or breakage resynchronization, the system can determine whether the current address vector is still under valid interpretation conditions based on the reference frame version information.

[0221] 2.8 Cross-medium continuity residual information

[0222] The cross-medium continuity residual information This is used to record a summary of physical residuals from the previous transmission stage, the previous routing path, the previous medium state, or the previous correction process. Preferably, the cross-medium continuity residual information may include one or more of the following: phase residual, time delay residual, field strength residual, path loss residual, multipath residual, interference feature residual, medium switching residual, refractive index compensation residual, path rejection residual, or link quality residual.

[0223] In this invention, cross-medium continuity residual information is one of the key fields for connection addressing, physical correction, and cooperative routing. When generating address vectors, the system incorporates this residual information into the address representation framework, enabling the address vectors to carry the continuity memory of the physical path from the previous stage. When performing physical path cost evaluation, routing nodes, edge nodes, or control nodes can parse this field and determine whether the current path or candidate path has phase distortion, abnormal delay, increased attenuation, continuity break risk, or should be directly rejected.

[0224] 2.9 Construction of Spatial Address Input Vector

[0225] After obtaining the above fields, the system performs standardized encoding on each field to form a spatial address input vector. Preferably, the system can encode physical spatial coordinate information as a spatial hash field, medium parameter information as a medium identifier field, vertical hierarchy information as a vertical hierarchy field, time phase information as a phase timestamp field, object fingerprint information as an object fingerprint field, reference frame version information as a reference frame version field, and cross-medium continuity residual information as a continuity residual field.

[0226] In some implementations, the spatial address input vector can be represented as:

[0227]

[0228] in, Represents the spatial address input vector. This indicates the media identification field. Indicates a spatial hash field. Indicates a vertical hierarchy field. This indicates the phase timestamp field. Represents the object fingerprint field. This indicates the reference version field. This indicates a continuous residual field.

[0229] The spatial address input vector, as the direct input to the non-fixed topology mapping, is mapped into a spatial Internet address vector after being driven by the topology descriptor and the dynamic seed.

[0230] 2.10 Hierarchical Organization of Static Spatial Codes and Dynamic Offset Fingerprints

[0231] In some implementations, the spatial address input vector or the spatial internet address vector may be organized in a hierarchical manner, including at least a static spatial code portion and a dynamic offset fingerprint portion.

[0232] The static spatial code portion is preferably used to carry spatial hashes, vertical hierarchies, reference frame versions, and other relatively stable spatial semantics; the dynamic offset fingerprint portion is preferably used to carry phase timestamps, continuity residuals, dynamic medium states, path state summaries, or other dynamic semantics related to the current link, current phase, and current continuity.

[0233] Therefore, the system can use different granularities to process spatial semantics with low update frequency and continuous semantics with high update frequency, thus providing a foundation for subsequent lightweight processing of ordinary nodes, phased residual verification of key nodes, edge enhancement correction, and decoupling of computing power.

[0234] 2.11 Compatible Input Between Existing Coordinate Systems and Grid Index Systems

[0235] In some implementations, the physical spatial coordinate information, spatial hash field, reference frame version field, or their equivalent representation, can be generated from the WGS-84 coordinate system, local coordinate system, geospatial grid index system, spatial hash index system, or a combination thereof. The geospatial grid index system includes one or more of the H3 geometric index, S2 geometric index, or other discrete spatial unit partitioning systems, and can serve as an input field, spatial hash field, index field, or bridging field for the spatial Internet address vector.

[0236] Therefore, existing coordinate systems and grid index systems are preferred in this invention as input layers, bridging layers, or index layers to participate in protocol interaction, rather than directly replacing the native protocol status of spatial Internet address vectors.

[0237] 2.12 Equivalent Representation

[0238] Furthermore, the fields can participate in non-fixed topology mapping in plaintext form, or they can participate in subsequent physical path cost evaluation, path selection, path switching, path rejection, continuity verification, break resynchronization, or compatibility bridging as compressed fields, feature vectors, intermediate resolution states, mapping indexes, context objects, or other equivalent representations. As long as the equivalent representation corresponds semantically to the address vector field and is used to drive subsequent protocol processing, it falls under the implementation of this invention.

[0239] 2.13 Technical Effects of This Embodiment

[0240] In this embodiment, physical space coordinates, medium parameters, vertical hierarchy, time phase, object fingerprint, reference frame version, and cross-medium continuity residual information are uniformly incorporated into the same original field set and further constructed as a spatial address input vector or its equivalent representation.

[0241] Therefore, this embodiment has at least the following technical effects:

[0242] First, it enables spatial internet addresses to be more than just logical node identifiers; they now possess the ability to express physical space, media environment, temporal phase, object state, and continuous residuals in a composite manner.

[0243] Secondly, it makes medium parameters, time phase, and continuity residuals common inputs for address generation, path evaluation, path switching, path rejection, and continuity verification.

[0244] Third, it enables the spatial address input vector to adopt a hierarchical organization method of static spatial code and dynamic offset fingerprint, which provides a foundation for subsequent decoupling of computing power, lightweight processing of ordinary nodes and phased residual verification of key nodes.

[0245] Fourth, it enables existing systems such as WGS-84, local coordinates, H3, and S2 to work collaboratively with native spatial internet protocols in the form of an input layer or index layer.

[0246] Fifth, it provides a unified data foundation for subsequent dynamic seed local derivation, non-fixed topology mapping, physical layer coherent correction, cooperative routing processing, and phase continuity maintenance.

[0247] 3. Dynamic Seed Local Deterministic Derivation Implementation Example

[0248] The following is combined Figure 3 This embodiment further illustrates the local deterministic derivation process of dynamic seeds. This mechanism enables the sending end, receiving end, routing node, edge node, or control node to independently calculate a consistent dynamic seed locally based on shared physical synchronization conditions, without explicitly transmitting the dynamic seed through ordinary network control signaling. This provides a consistent topology configuration basis for subsequent non-fixed topology mapping, address resolution, physical path cost evaluation, cooperative routing path selection, path switching, path veto, and continuity verification.

[0249] 3.1 Purpose of Dynamic Seed Derivation

[0250] In the context of the space-based Internet, the target physical space unit, terminal status, media environment, beam status, path status, and routing path may continuously change. If a fixed field layout or fixed seed configuration is used, the address structure is easily circumvented by reverse engineering, wrapping, or field replacement, and it is also difficult to adapt to cross-media path changes in a highly dynamic environment.

[0251] Therefore, this embodiment controls the arrangement order, segmentation method, field boundaries, interpretation relationships, or mapping templates of address fields through a dynamic seed, enabling the same address protocol system to form different field topologies under different physical locations, time phases, media states, path states, or routing hop conditions. As long as the sending end, receiving end, routing node, edge node, or control node has the same shared physical synchronization conditions, they can restore the same dynamic seed locally and perform consistent encoding, parsing, path evaluation, or routing-related processing on the address vector accordingly.

[0252] 3.2 Shared Physical Synchronization Conditions

[0253] In this embodiment, the shared physical synchronization condition is the input basis for the local deterministic derivation of the dynamic seed. Preferably, the shared physical synchronization condition includes one or more of the following: a reference clock, a reference time or reference phase reference, a time slot identifier, a beam identifier, reference frame version information, phase summary information, a physical feature entropy summary, a medium state summary, and negotiation parameters.

[0254] The reference time or reference phase reference can be provided by a highly stable physical reference reference, a base station-side synchronization unit, a terminal-side synchronization unit, a photonic gateway, an edge node, or a control node. The time slot identifier is used to characterize the current communication time slot, routing time window, or address generation period. The beam identifier is used to characterize the beam direction, beam index, or physical channel state under the current 6G / WiFi 8, terahertz, millimeter wave, or other high-frequency links. The reference system version information is used to ensure that the same coordinate interpretation conditions are used during address generation, address resolution, and path evaluation. The phase summary information is used to characterize the current physical layer phase state or the phase residual from the previous correction stage. The medium state summary is used to characterize the medium change state of the current path or candidate path. The negotiation parameters are used to characterize common parameters formed during protocol initialization, session establishment, security policy configuration, or path policy configuration.

[0255] 3.3 Summary of Physical Feature Entropy

[0256] In some implementations, the shared physical synchronization condition further includes a physical feature entropy summary. The physical feature entropy summary is derived from the physical random characteristics of the current spatial location, current time, or current medium environment, and is used to enhance the binding relationship between the dynamic seed and the on-site physical conditions.

[0257] Preferably, the physical feature entropy summary may be derived from one or more of the following: multipath fading residual, environmental electromagnetic noise features, link phase disturbance features, field strength fluctuation features, medium propagation disturbance summary, instantaneous beam feedback features, reconfigurable smart surface reflection disturbance features, or local link noise statistics.

[0258] In some implementations, when the shared physical constraints are met, the sending end, receiving end, routing node, edge node, or control node synchronously samples, digests, or maps the physical feature entropy summary, and uses it as one of the inputs for dynamic seed derivation. Thus, the dynamic seed is determined not only by logical control parameters but also by the physical random characteristics of the current spatiotemporal environment.

[0259] 3.4 Entropy Source Purity Detection

[0260] In some implementations, the system can also perform entropy source purity detection on the reference time or reference phase reference participating in dynamic seed derivation. The entropy source purity detection is used to determine whether the reference source participating in dynamic seed derivation meets preset stability and phase purity requirements, preventing low-precision reference sources, low-precision sensors, or synchronous inputs obtained by software simulation from entering the dynamic seed derivation process.

[0261] Preferably, the entropy source purity detection can be based on Allan variance, phase noise spectral density, frequency stability index, short-term phase drift index, or a combination thereof, to evaluate the short-term stability and phase purity of the input reference source.

[0262] In some implementations, the system can set a reference source stability threshold. When the evaluation result is lower than the preset threshold, the system determines that the dynamic seed generated based on the reference source is invalid and triggers actions such as rejecting derivation, resampling, falling back to a higher-level reference source, degrading the route, security locking, or audit logging.

[0263] 3.5 Dynamic Seed Derivation Function

[0264] In some implementations, the dynamic seed can be generated through a deterministic derivation function from a reference time or reference phase reference, a time slot identifier, a beam identifier, reference frame version information, phase summary information, a physical characteristic entropy summary, a medium state summary, and negotiated parameters. Preferably, the dynamic seed derivation function can be expressed as:

[0265]

[0266] in, Indicates a dynamic seed. Indicates a reference time or reference phase base. Indicates time slot identifier, Indicates beam identifier, cell identifier, or physical channel identifier. Indicates reference frame version information. This represents a phase summary or a physical residual summary. Represents a summary of physical feature entropy. Indicates a summary of the media status. This indicates negotiation parameters or configuration parameters. This represents a dynamic seed derived function.

[0267] The dynamic seed derivation function can be implemented using a one-way hash function, a physical layer security function, a key derivation function, an error correction auxiliary function, a hardware security function, or a combination thereof. It should be understood that the above formula is only a preferred representation; without departing from the concept of this invention, equivalent input combinations, function forms, or hardware-software co-implementation methods can also be used to achieve local deterministic derivation of the dynamic seed.

[0268] 3.6 Multi-node local derivation mechanism

[0269] In this embodiment, before generating the spatial Internet address vector, the transmitting end reads the reference time or reference phase reference, current time slot identifier, current beam identifier, reference system version information, phase summary information, physical feature entropy summary, medium state summary and negotiation parameters that have passed the entropy source purity detection, and inputs them into the local deterministic seed derivation module to calculate the dynamic seed.

[0270] After receiving the spatial internet address vector, the receiving end does not require the sending end to transmit an additional dynamic seed. Instead, it performs the same derivation process based on the shared physical synchronization conditions obtained through local synchronization to recover the same dynamic seed as the sending end. Subsequently, the receiving end performs non-fixed topology reverse parsing on the address vector based on this dynamic seed and the topology descriptor to recover the semantic structure of the fields.

[0271] When performing cooperative routing path selection, path switching, path rejection, or path reselection, routing nodes, edge nodes, or control nodes can also derive dynamic seeds based on the shared physical synchronization conditions obtained locally. The nodes can use the dynamic seed to resolve the medium parameter field, phase time field, continuity residual field, or their equivalent representation in the address vector, and further perform physical path cost evaluation, candidate path ranking, path rejection determination, or path switching processing.

[0272] 3.7 Relationship between dynamic seeds and non-fixed topological mappings

[0273] In this embodiment, a dynamic seed is used to drive non-fixed topology mapping. Specifically, the dynamic seed can be used to determine one or more of the following: address field arrangement order, field segmentation length, field boundary position, field interpretation relationship, mapping template number, routing field explicit / implicit strategy, address payload obfuscation method, or field priority.

[0274] In some implementations, the dynamic seed changes when physical location, time phase, medium state, path state, or routing hop conditions change, thereby altering the field topology of the spatial Internet address vector. Nodes with the same shared physical synchronization conditions can still recover the same dynamic seed and perform consistent resolution accordingly; nodes without the same shared physical synchronization conditions will find it difficult to correctly restore the field structure.

[0275] 3.8 Dynamic Seed Synchronization Consistency Verification

[0276] In some implementations, the system can also perform consistency checks on the dynamic seed derivation results. Preferably, after the receiving end, routing node, edge node, or control node derives the dynamic seed locally, it can perform joint verification with the topology descriptor, reference frame version, phase digest, physical feature entropy digest, and message structure integrity information to determine whether the dynamic seed can correctly support reverse resolution of address vectors, path evaluation, or routing decisions.

[0277] When the restored set of fields satisfies the constraints of address structure integrity, field semantic closure, reference system version consistency, physical phase consistency, path evaluation field resolvability, and continuity field recoverability, the system determines that dynamic seed synchronization is successful. When the restoration result shows field conflicts, abnormal field boundaries, semantic breaks, inconsistent reference system versions, physical phase mismatch, unresolvable path evaluation fields, unrecoverable path rejection fields, or failure to close continuity residuals, the system determines that dynamic seed synchronization has failed and triggers resynchronization, packet dropping, path reselection, path rejection, security locking, or audit log processing.

[0278] 3.9 Assisted Synchronization During Dynamic Seed Derivation Mismatch

[0279] In some implementations, when the sender, receiver, routing node, edge node, or control node is unable to complete the local deterministic derivation of the dynamic seed due to shared physical synchronization condition drift, unrecoverable field topology, reference phase mismatch, or local occlusion, the system can call the most recent valid residual digest, phase continuity fingerprint, or recovery context to perform auxiliary synchronization or cold start recovery within a limited recovery window.

[0280] The auxiliary synchronization does not explicitly transmit the complete dynamic seed through ordinary network control signaling. Instead, it restores the limited synchronization state used for current address resolution, path evaluation, or route determination based on the most recent valid residual digest, continuous residual closure result, reference frame version information, phase digest information, or a combination thereof.

[0281] When the auxiliary synchronization is successfully restored, the system allows the continued execution of address resolution, path evaluation, candidate path filtering, or break resynchronization; when the auxiliary synchronization is not restored, the system triggers readdressing, link fallback, path reselection, security locking, or audit logging.

[0282] 3.10 Technical Effects of this Embodiment

[0283] Through the above methods, this embodiment has at least the following technical effects:

[0284] Firstly, it enables dynamic seeds to be deterministically derived locally by multiple nodes based on shared physical synchronization conditions, reducing the signaling overhead and synchronization risks associated with explicit seed distribution.

[0285] Secondly, by introducing physical feature entropy summaries, dynamic seeds are bound to the current spatial location, current time, current medium environment, and current path state, thereby improving the physical unclonability and anti-simulation capability of the seed derivation process.

[0286] Third, by using an entropy source purity detection mechanism, the risk of low-precision reference sources, low-precision sensors, or software-simulated phase references participating in dynamic seed derivation is reduced.

[0287] Fourth, it provides a unified dynamic topology foundation for subsequent non-fixed topology mapping, address resolution, path cost evaluation, cooperative routing processing, and continuity maintenance.

[0288] 4. Examples of Non-Fixed Topology Mapping and Address Vector Generation

[0289] The following is combined Figure 4 This document describes the non-fixed topology mapping and address vector generation process based on topology descriptors and dynamic seeds. This embodiment further illustrates how an original set of fields or a spatial address input vector, through the combined action of topology descriptors and dynamic seeds, is mapped into a spatial internet address vector, and how an address representation structure capable of simultaneously carrying relatively stable spatial semantics and dynamic continuous semantics is formed within the address vector.

[0290] In this invention, the non-fixed topology mapping is not a simple field concatenation or fixed offset filling, but rather a dynamic configuration of the field arrangement order, segmentation method, field boundaries, interpretation relationships, or mapping templates based on the topology descriptor and dynamic seed. This allows the spatial Internet address vector to have different field topology structures under different physical locations, time phases, media states, path states, or routing hop conditions. Therefore, the spatial Internet address vector does not depend on a fixed layout and fixed interpretation position, which improves its resistance to bypassing under field rearrangement, protocol wrapping, static reverse analysis, and alternative expression methods.

[0291] 4.1 Input Objects for Non-Fixed Topology Mapping

[0292] In some implementations, the input object for the non-fixed topology mapping can be the original field set described in Section 2, or it can be a spatial address input vector formed after standardizing and encoding the original field set. Preferably, the spatial address input vector includes one or more of the following: medium identifier field, spatial hash field, vertical hierarchy field, phase timestamp field, object fingerprint field, reference frame version field, and continuity residual field.

[0293] In this embodiment, the input object can participate in the mapping in plaintext field form, or in compressed field, feature vector, intermediate parsing state, mapping index, context object, or other equivalent representation form. As long as the input object can be used for subsequent address generation, path evaluation, cooperative routing, continuity verification, or compatibility bridging, it is an implementation of the present invention.

[0294] 4.2 General Formula for Non-Fixed Topology Mapping

[0295] In some implementations, the spatial Internet address vector at time t can be represented as:

[0296]

[0297] in, Indicates time Spatial Internet address vector, Indicates time The original set of fields or spatial address input vector, Represents a topological descriptor. Indicates a dynamic seed. This represents a non-fixed topology mapping function.

[0298] The above non-fixed topology mapping function This function is used to perform field reorganization, field splitting, field order adjustment, field boundary configuration, interpretation relationship selection, or mapping template switching on the original field set. Unlike the fixed address layout method, this function... The output changes with the topology descriptor and dynamic seed, enabling the spatial Internet address vector to dynamically adapt to changes in the physical environment, media state, and routing state.

[0299] 4.3 Synergistic effect of topological descriptors and dynamic seeds

[0300] In some implementations, the topology descriptor is used to indicate the order of fields, segmentation method, field boundaries, interpretation relationship or mapping template in the spatial Internet address vector; the dynamic seed is used to dynamically drive the specific selection result, mapping parameters, field reorganization rules or interpretation control result of the topology descriptor under shared physical synchronization conditions.

[0301] Therefore, under the premise of having the same shared physical synchronization conditions, different nodes can deterministically recover the same dynamic seed locally and generate and resolve address vectors in a consistent manner based on the same topology descriptor. At the same time, under different physical locations, time phases, media states, path states, or route jumps, the generated address vectors can have different field topology structures.

[0302] 4.4 Basic Fields of an Address Vector

[0303] In some implementations, the spatial internet address vector is preferably a 256-bit address vector, used to uniformly carry one or more of the following fields: carrier medium identifier field, spatial hash field, vertical hierarchy field, phase timestamp field, object fingerprint field, reference frame version field, continuity residual field, and topology descriptor field.

[0304] The 256-bit address vector is only a preferred implementation and does not limit the invention to using fixed field offsets or fixed field lengths. In actual implementation, each field can adopt equal-length, variable-length, sparse mapping, compressed mapping, segmented mapping, or other expression methods jointly controlled by the topological descriptor and dynamic seed.

[0305] 4.5 Hierarchical Mapping of Static Spatial Codes and Dynamic Offset Fingerprints

[0306] In some implementations, the spatial internet address vector may include a static spatial code portion and a dynamic offset fingerprint portion, the relationship of which can be expressed as follows:

[0307]

[0308] in, Indicates time The static space code portion, Indicates time The dynamic offset fingerprint portion, This indicates a combined expression operation resulting from splicing, combining, and mapping.

[0309] The static spatial code portion is preferably used to carry spatial hashes, vertical hierarchies, reference frame versions, and other relatively stable spatial semantics; the dynamic offset fingerprint portion is preferably used to carry phase timestamps, continuity residuals, dynamic medium states, path state summaries, or other dynamic semantics related to the current link, current phase, and current continuity state.

[0310] 4.6 Layered Generation of Static and Dynamic Components

[0311] In some implementations, the static spatial code portion and the dynamic offset fingerprint portion can be generated using different mapping methods, and their relationship can be further expressed as follows:

[0312]

[0313] in, This represents a relatively stable subset of fields. This represents a dynamically changing subset of fields. Represents the static space code mapping function. This represents the dynamic offset fingerprint mapping function.

[0314] Therefore, the static spatial code portion can adopt a relatively low-frequency update and high-stability topological organization method, while the dynamic offset fingerprint portion can adopt a relatively high-frequency update and high-flexibility dynamic topological organization method. Through this hierarchical mapping method, the address vector can simultaneously maintain relatively stable spatial positioning expression capability and highly dynamic continuity adaptation capability.

[0315] 4.7 Address layering and decoupling of computing power

[0316] In some implementations, the static spatial code portion is preferably processed by the terminal-side basic processing unit, low-power module, local control unit, or other processing units with low resource consumption; the complex interpretation, enhanced correction, residual closure, path acceptability judgment, or recovery control of the dynamic offset fingerprint portion can be processed by edge nodes, high-performance gateways, media switching nodes, candidate path filtering nodes, or other key nodes.

[0317] Therefore, this invention can achieve decoupling of computing power through address layering without changing the original semantics of the spatial Internet address vector. This allows ordinary nodes to avoid bearing the full and complex calculation of all fields, while key nodes can undertake enhanced verification and high-complexity processing tasks at necessary stages.

[0318] 4.8 Address Vector Generation Process

[0319] In some implementations, the address vector generation process may include the following steps:

[0320] (1) Obtain the original field set or spatial address input vector;

[0321] (2) Determinely derive dynamic seeds locally based on the current shared physical synchronization conditions;

[0322] (3) Determine the current field topology rule, field mapping template, or field interpretation relationship based on the topology descriptor;

[0323] (4) Control the field arrangement order, field boundaries, field segmentation granularity, or dynamic offset relationship based on the dynamic seed;

[0324] (5) Write the static spatial code part and the dynamic offset fingerprint part into the spatial Internet address vector to form a native address object that can be used for subsequent parsing, path evaluation, cooperative routing, continuity verification and compatible bridging calls.

[0325] In some implementations, the address vector generation process may also synchronously record a phased residual summary, a path state summary, or a recovery-related context for subsequent break resynchronization, atomic binding recovery, or interface layer calls.

[0326] 4.9 Consistent Resolution of Address Vectors

[0327] In some implementations, when the sending end, receiving end, routing node, edge node, or control node has the same shared physical synchronization conditions, they can perform consistent resolution of the spatial Internet address vector based on the same dynamic seed and the same topology descriptor.

[0328] Consistent resolution does not require all nodes to undertake field interpretation tasks of the same complexity. Ordinary nodes can preferentially resolve fields directly related to local path decisions, lightweight forwarding, or local state judgments; edge nodes, candidate path filtering nodes, continuous anomaly nodes, or other critical nodes can perform more complete field interpretation, enhanced verification, residual closure, or recovery control. Thus, this invention allows different nodes to undertake different levels of protocol processing tasks while maintaining address semantic consistency.

[0329] 4.10 Relationship between address vectors and subsequent modules

[0330] The spatial Internet address vector generated in this embodiment is not only used for addressing, but can also directly participate in subsequent physical path cost evaluation, cooperative routing selection, path switching, path rejection, continuity verification, break resynchronization, and physical semantic interface layer compatibility bridging.

[0331] Specifically, the phase-time related semantics, continuity residual related semantics, and path-state related semantics in the dynamic offset fingerprint portion can be directly used as the basis for subsequent path evaluation, staged residual verification, phase continuity inheritance, recovery context construction, and physical semantic interface layer calls. Therefore, the address vector in this invention undertakes not only addressing semantics but also routing semantics, recovery semantics, and bridging semantics.

[0332] 4.11 Boundary between existing system inputs and native address objects

[0333] In some implementations, WGS-84, local coordinate system, H3 geometric index, S2 geometric index or other discrete spatial unit partitioning system can participate in non-fixed topology mapping as part of the original field set or spatial address input vector, and further form spatial hash field, index field, reference field or bridging field in spatial Internet address vector.

[0334] However, the aforementioned existing coordinate system or index system is preferred in this invention as one of the input layer, bridging layer or index layer to participate in protocol interaction, rather than directly replacing the spatial Internet address vector as the native address object.

[0335] 4.12 Technical Effects of this Embodiment

[0336] Through the above methods, this embodiment has at least the following technical effects:

[0337] Firstly, by using topological descriptors and dynamic seeds to jointly drive non-fixed topology mapping, the spatial Internet address vector does not depend on fixed field layout and fixed offset interpretation, thereby enhancing the address structure's resistance to bypassing.

[0338] Secondly, by formulaically defining the relationship between the spatial Internet address vector and the static spatial code and dynamic offset fingerprint, relatively stable spatial semantics and highly dynamic continuous semantics can be organized with different granularities and updated with different frequencies, thereby improving the adaptability of address objects in highly dynamic scenarios.

[0339] Third, by decoupling address layering from computing power, ordinary nodes can perform lightweight processing, while critical nodes can undertake enhanced verification, complex interpretation, and recovery control, thereby reducing the real-time computing power pressure brought by hop-by-hop full computation while maintaining the protocol's accuracy target.

[0340] Fourth, it enables spatial Internet address vectors to simultaneously undertake addressing semantics, routing semantics, recovery semantics, and bridging semantics, providing a unified native address foundation for subsequent physical path cost assessment, cooperative routing, break resynchronization, and physical semantic interface layer compatible interaction.

[0341] 5. Implementation Example of Highly Stable Physical Reference Standard and Coherent Correction of Physical Layer

[0342] The following is combined Figure 5 This embodiment explains the process of using a highly stable physical reference benchmark and physical layer coherent correction. It further illustrates how a highly stable physical reference benchmark can be used to perform physical layer coherent correction on at least one stage of the spatial Internet address vector during generation, transmission, resolution, path evaluation, routing decision, or continuity verification, and how to provide hierarchical high-precision physical constraint capabilities across different deployment levels.

[0343] 5.1 The role of a highly stable physical reference standard

[0344] In this embodiment, the highly stable physical reference benchmark is used to provide a highly stable phase benchmark that meets preset requirements for spatial addressing accuracy, path switching accuracy, or continuity maintenance accuracy. The highly stable phase benchmark can be applied to at least one of the following stages of the spatial Internet address vector generation, transmission, resolution, path evaluation, routing decision, or continuity verification stage to suppress, compensate for, or correct phase noise, clock jitter, frequency doubling error, Doppler diffusion, changes in medium refractive index, path switching phase deviation, or other sources of error affecting continuity.

[0345] In some implementations, the physical layer coherent polarization correction process can be represented as:

[0346]

[0347] in, This represents the spatial internet address vector before correction. This represents the corrected spatial internet address vector. Indicates time A highly stable physical reference standard Indicates time The set of error perturbations, This represents the correction function.

[0348] The set of error disturbances This can include phase noise, clock jitter, frequency doubling error, Doppler diffusion, refractive index variation, switching phase deviation, or a combination thereof. Therefore, the corrected spatial internet address vector can maintain higher consistency in subsequent path evaluation, cooperative routing, continuity verification, and break resynchronization processes.

[0349] 5.2 Implementation Forms of Highly Stable Physical Reference Bases

[0350] In some embodiments, the highly stable physical reference reference may be an optical-grade physical reference source, an atomic clock reference, a quantum time and frequency reference, a phase-locked microwave reference, a satellite timing reference, a distributed highly stable reference network, or other highly stable reference references that meet preset accuracy requirements; wherein, an optical-grade physical reference source is preferred, and an optical frequency comb is more preferred.

[0351] In this invention, the optical frequency comb is only one preferred embodiment, not the only implementation. Any reference reference used that can provide a highly stable phase reference that meets the preset requirements for spatial addressing accuracy, path switching accuracy, or continuity maintenance accuracy is considered an implementation of this invention.

[0352] 5.3 Hierarchical Provision of Highly Stable Physical Reference Standards

[0353] In some implementations, the highly stable physical reference reference may be provided by a centrally deployed reference source, a distributed reference network, an end-side reference source, an edge-side reference source, or a combination thereof.

[0354] In a centralized deployment mode, high-precision reference benchmarks are preferably deployed at base stations, photonic gateways, edge nodes, or cloud-edge collaborative control platforms to provide a unified, highly stable phase reference to multiple terminals, access nodes, routing nodes, or space internet service nodes.

[0355] In a distributed reference network approach, multiple reference nodes can form a cooperative constraint network through synchronous reference distribution, reference mapping, or time-frequency locking to maintain reference consistency in large-scale, cross-media, or cross-regional scenarios.

[0356] In the terminal-side reference mode, the terminal, vehicle-mounted node, wearable node, low-altitude node or other resource-constrained node can use a reference source that meets the local accuracy requirements to perform local phase constraint, local correction or local synchronization recovery.

[0357] In edge-side reference mode, edge nodes can output reference summaries, phase compensation amounts, differential correction amounts, or restricted synchronization results to terminals or downstream nodes based on their own reference sources.

[0358] 5.4 Execution method of physical layer coherent polarization correction

[0359] In this embodiment, the physical layer coherent correction can be achieved through reference mapping, time-frequency locking, phase injection, synchronous reference distribution, electro-optic mapping, or equivalent methods.

[0360] In some implementations, the system can associate the phase-time field in the spatial Internet address vector with a highly stable physical reference and perform corrections on the address vector based on the current medium state, path state, routing stage, or continuity constraints.

[0361] For example, in free-space optical links, terahertz links, millimeter-wave links, reconfigurable smart surface reflection paths, or rapidly changing media paths, the system can compensate for the phase-time related fields in the address vector based on the phase error, Doppler diffusion, refractive index disturbance, or switching deviation of the current link; during cross-media switching, the system can suppress phase mismatch caused by path abrupt changes based on the reference reference and continuity residual.

[0362] 5.5 Edge Differential Correction and Simplified Terminal Solution

[0363] In some implementations, a highly stable physical reference reference is preferably deployed in a base station, photonic gateway, edge node, or cloud-edge collaborative control platform. The node can generate differential correction, phase compensation, reference summary, or restricted synchronization results based on the highly stable reference source and provide reference assistance to terminals, vehicle-mounted nodes, wearable nodes, low-altitude nodes, or other resource-constrained nodes.

[0364] Correspondingly, in some implementations, terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes do not need to be configured with the highest precision reference source, but preferably perform local phase calculation, residual tracking, address resolution, or constrained synchronization recovery.

[0365] In some implementations, the above relationship can be expressed as:

[0366]

[0367] in, This represents the differential correction result generated from the edge side or the concentrated side. Indicates the edge-side or concentration-side reference datum. Indicates local link observation information, Represents continuous residual information. This represents the differential correction generation function.

[0368] The terminal can perform local corrections based on the differential correction results without incurring the full deployment cost of the highest-precision reference source. Therefore, this invention reduces the terminal's reliance on high-cost reference sources and highly complex correction hardware while maintaining high-precision physical correction capabilities.

[0369] 5.6 Synergy with Path Assessment and Continuity Maintenance

[0370] The highly stable physical reference benchmark in this embodiment is not only used for simple phase calibration, but also serves as a common physical basis for path evaluation and continuity maintenance.

[0371] In some implementations, the calculation of physical path cost can refer to the current correction results, link phase stability, residual convergence degree, or continuity maintenance degree after switching; during the break resynchronization process, the system can also impose consistency constraints on the recovery context based on a highly stable physical reference benchmark to improve the reliability of the recovery results.

[0372] Therefore, in this invention, a highly stable physical reference benchmark is preferably used throughout the entire process of address generation, path evaluation, continuity verification, and recovery control, rather than as a local synchronization means for a single link.

[0373] 5.7 Technical Effects of This Embodiment

[0374] Through the above methods, this embodiment has at least the following technical effects:

[0375] First, by introducing a highly stable physical reference into the generation, transmission, resolution, path evaluation, routing decision and continuity verification process of spatial Internet address vectors, the phase consistency, time consistency and spatial alignment capabilities in high-frequency and cross-medium environments are improved.

[0376] Secondly, by allowing highly stable physical reference benchmarks to adopt a hierarchical implementation method provided by centralized deployment reference sources, distributed reference networks, terminal-side reference sources, edge-side reference sources, or combinations thereof, the universality of the underlying protocol and its engineering implementation capability of the present invention are enhanced.

[0377] Third, by having base stations, photonic gateways, edge nodes, or cloud-edge collaborative control platforms provide differential correction amounts, phase compensation amounts, or reference summaries, and having terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes perform local phase calculations, residual tracking, or constrained synchronization recovery, it is beneficial to reduce the hardware threshold for deploying high-precision physical correction capabilities on the terminal side.

[0378] 6. Example of Physical Path Cost Assessment

[0379] The following is combined Figure 6 This document describes the physical path cost evaluation process based on medium parameters, phase-time, and continuity residuals. Specifically, it explains how to parse the medium parameter field, phase-time field, and cross-medium continuity residual field from the spatial Internet address vector, calculate the physical path cost accordingly, and allocate different levels of path calculation, residual verification, and path acceptability judgment tasks between ordinary nodes and critical nodes.

[0380] 6.1 The basic meaning of physical path cost

[0381] In this embodiment, the physical path cost is used to characterize the comprehensive cost of the current path or candidate path in terms of media adaptability, phase consistency, continuity maintenance, propagation loss, path stability, security and reliability, or resource consumption.

[0382] Unlike traditional routing methods that rely solely on logical link reachability, hop count, or bandwidth, the path cost in this embodiment is directly based on the physical semantics carried by the spatial Internet address vector, enabling routing decisions to be executed in response to propagation conditions, medium constraints, and continuous states in real space.

[0383] 6.2 Input fields for physical path cost

[0384] In some implementations, the physical path cost can be calculated based on one or more of the following: medium parameter field in the spatial Internet address vector, cross-medium continuity residual field, phase timestamp field, physical feature entropy summary, local link feedback, field strength feature, delay deviation, path loss, medium refractive index, Doppler feature, security level, energy consumption constraint, or routing resource occupancy status.

[0385] Among them, the medium parameter field is used to describe the medium characteristics of the propagation environment in which the candidate path is located; the phase time field is used to reflect the degree of matching between the current path and the reference phase or time base; the continuity residual field is used to characterize whether the current path can inherit the continuity semantics of the previous stage; local link feedback, field strength characteristics, time delay deviation and path loss are used to characterize link quality; security level, energy consumption constraint and routing resource occupancy status are used to characterize service constraints and system constraints.

[0386] 6.3 Formula for Calculating Physical Path Cost

[0387] In some implementations, the physical path cost can be expressed as:

[0388]

[0389] in, Indicate candidate path Physical path cost, Indicates quantities related to medium parameters. This represents a phase-time correlation quantity. This represents the correlation quantity of continuous residuals. Indicates link state related quantities. This indicates quantities related to safety, energy consumption, or resource usage. This represents the cost calculation function.

[0390] In some implementations, the above cost function A weighted summation method can be further used, for example:

[0391]

[0392] in, to The weighting coefficients represent different cost dimensions, and these weighting coefficients can be dynamically adjusted based on service priority, system status, degree of media change, or routing strategy.

[0393] It should be understood that the above weighted summation form is only a preferred example, and the physical path cost can also be implemented by threshold determination, rule matching, graph optimization, machine learning model, neural network scoring, policy network output or equivalent forms.

[0394] 6.4 Lightweighting of Ordinary Nodes

[0395] In some implementations, ordinary nodes preferably perform basic cost calculation, local field inheritance, local residual judgment, preliminary screening of candidate paths, or lightweight forwarding processing.

[0396] For example, a regular node can perform basic judgments based on at least a portion of the medium parameter field, phase time field, and continuity residual field in the current address vector, without having to perform full enhanced verification on all candidate paths. This reduces the real-time computing pressure caused by hop-by-hop full recalculation, making the invention applicable to terminals, resource-constrained nodes, or high-frequency forwarding scenarios.

[0397] 6.5 Phased Residual Verification of Key Nodes

[0398] In some implementations, edge nodes, media switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other critical nodes may perform phased residual verification, enhanced correction, or path acceptability determination.

[0399] The objects of phased verification at critical nodes may include continuity residuals, phase deviations, path losses, Doppler features, refractive index perturbations, link uncertainties, restoration of context consistency, or combinations thereof. These phased verifications are not required to be performed at every hop, but are preferably triggered before and after medium switching, during candidate path rearrangement, during unverifiable path stages, during state machine feedback anomalies, or during continuity anomaly stages. Therefore, this invention can ensure the accuracy control of critical locations while avoiding all nodes continuously bearing the highest complexity computational tasks.

[0400] 6.6 Path Acceptability Determination and Path Rejection

[0401] In some implementations, the system can perform path sorting, path filtering, path switching triggering, path rejection, or path reselection on multiple candidate media paths based on the physical path cost.

[0402] If a path is logically reachable, but its cost exceeds a preset threshold, or its continuity residual, phase deviation, security level, energy consumption cost, or resource occupancy status does not meet business requirements, the system can reject its execution. Conversely, if a path's cost meets the acceptance criteria and can maintain continuity inheritance, phase consistency, and recoverability, the system can select it as the target path.

[0403] In some implementations, path acceptability determination can be expressed as:

[0404]

[0405] in, Representing a path The acceptance determination result, Indicates the preset cost threshold. When In such cases, the system can perform path rejection, path reselection, or enhanced verification.

[0406] 6.7 Relationship with continuity verification and fracture resynchronization

[0407] The physical path cost evaluation in this embodiment is not only used for candidate path ranking, but can also be directly used for continuity verification and break resynchronization determination.

[0408] In some implementations, when the system detects that a candidate path, although reachable, suffers from continuously accumulating residuals, increasing phase deviations, inconsistent recovery contexts, or abnormal state machine feedback, critical nodes can trigger phased residual checks or enhanced corrections before the formal path switchover. If the acceptance criteria are still not met after enhanced checks, the system can perform path rejection, path reselection, or breakage resynchronization. Thus, path evaluation, path acceptability judgment, continuity checks, and recovery control form a unified closed loop in this invention.

[0409] 6.8 Relationship with address layering and decoupling of computing power

[0410] In some implementations, the stable semantics carried by the static spatial code portion, such as spatial hash, vertical hierarchy, and reference frame version, can be preferentially used for the initial screening of the spatial range of candidate paths; while the phase timestamp, continuity residual, path state summary, and dynamic medium state carried by the dynamic offset fingerprint portion can be preferentially used for the stage residual verification, enhancement correction, or path acceptability determination of key nodes.

[0411] Therefore, the physical path cost evaluation in this embodiment does not rely solely on a single full resolution, but can be combined with the address hierarchy structure to allocate evaluation tasks of different complexities among different nodes, thereby achieving decoupling of computing power.

[0412] 6.9 Technical Effects of This Embodiment

[0413] Through the above methods, this embodiment has at least the following technical effects:

[0414] First, by directly parsing the medium parameter field, phase time field, and continuity residual field in the spatial Internet address vector, path evaluation is upgraded from an evaluation method oriented towards logical links to an evaluation method oriented towards real physical propagation conditions and continuity constraints.

[0415] Secondly, by allowing ordinary nodes to perform lightweight processing and key nodes to perform phased residual verification, enhanced correction or path acceptability determination, the real-time computing power pressure caused by full hop-by-hop recalculation of the entire network is reduced.

[0416] Third, by unifying path cost, path acceptability determination, path rejection, path reselection, continuity verification, and break resynchronization into the same evaluation closed loop, the routing stability and recovery capability under highly dynamic, cross-media, and complex occlusion scenarios are improved.

[0417] Fourth, by assigning different roles to static spatial codes and dynamic offset fingerprints during path evaluation, the operability of address hierarchies and computing power decoupling in engineering implementation is further enhanced.

[0418] 7. Cross-media cooperative routing path selection example

[0419] The following is combined Figure 7This embodiment describes the cross-media cooperative routing path selection, adaptive path switching, path rejection, and path reselection processes. It further illustrates the cooperative routing path selection, adaptive path switching, path rejection, and path reselection mechanisms based on physical path cost. The cooperative routing processing mechanism is used to select a target path that meets the current spatial Internet address vector transmission requirements among dielectric paths, optical paths, quantum medium paths, terahertz paths, free-space optical paths, reconfigurable smart surface reflection paths, or other medium paths with different propagation parameters, and, when necessary, reject or reselect candidate paths that do not meet preset conditions.

[0420] 7.1 Purpose of Cooperative Routing Processing

[0421] In the context of the space internet, data packets, spatial content, control commands, or digital asset access requests are no longer simply forwarded to a logical network node, but need to be precisely delivered to the target physical space unit. The target physical space unit may be located in an occluded environment, a complex reflection environment, a high-speed movement environment, an indoor-outdoor switching environment, an underwater environment, a low-altitude environment, a wall-penetrating environment, or an environment crossing electro-optical media boundaries.

[0422] Traditional routing mechanisms primarily rely on link reachability, network hop count, congestion status, or policy rules for path selection. They struggle to proactively switch transmission paths based on the medium characteristics of the target physical space unit, phase continuity requirements, residual state, and path reliability. Furthermore, they are ill-equipped to reject paths that are reachable but do not meet preset physical conditions. This embodiment, by parsing the physical fields in the spatial internet address vector and combining them with physical path cost calculations, enables routing selection to be aware of the real physical space and heterogeneous media environment.

[0423] 7.2 Candidate Path Types

[0424] In this embodiment, the cooperative routing decision module can maintain multiple candidate paths. The candidate paths may include one or more of the following:

[0425] (1) Dielectric path, including 6G, WiFi 8, millimeter wave, terahertz radio frequency link or other electromagnetic communication path, suitable for wide area coverage, terminal access, mobile communication and unobstructed space transmission;

[0426] (2) Optical medium path, including free space optical link, photonic gateway link, optical modulator link, optical reflection path or optical communication relay path, which is suitable for environments with high bandwidth, low latency, strong directionality or strong electromagnetic interference.

[0427] (3) Quantum medium path, including quantum secure link, quantum key auxiliary link, quantum state transmission auxiliary link or other transmission path with quantum security features, which is suitable for high security level, strong identity authentication or tamper-proof scenarios;

[0428] (4) Terahertz path, including narrow beam transmission path in the near terahertz or terahertz frequency band, is suitable for ultra-high bandwidth, short distance, high precision spatial alignment or high density node communication scenarios.

[0429] (5) Free space light path, including direct-view free space light path, specular reflection light path or beam pointing control path, which is suitable for high-directional transmission and low-interference space scenarios;

[0430] (6) Reconfigurable smart surface reflection paths, including non-line-of-sight paths formed by RIS, metasurfaces, smart reflective surfaces or environmentally controllable reflection nodes, suitable for shading, corners, insufficient wall diffraction or complex building environments.

[0431] (7) Other heterogeneous media paths, including underwater communication paths, solid-penetrating communication paths, satellite relay paths, low-altitude relay paths, vehicle-mounted relay paths, ship-mounted relay paths, or combinations thereof.

[0432] The above path types are only preferred examples. The system can expand the candidate path set according to different application scenarios, hardware deployments and protocol versions.

[0433] 7.3 Routing Decision Input

[0434] In this embodiment, the cooperative routing decision module receives at least one or more of the following inputs:

[0435] (1) Physical space coordinate information in the spatial Internet address vector;

[0436] (2) Medium parameter information in the spatial Internet address vector;

[0437] (3) Phase and time information in the spatial Internet address vector;

[0438] (4) Cross-media continuity residual information in spatial Internet address vectors;

[0439] (5) Object fingerprint information in the spatial Internet address vector or its corresponding security verification result;

[0440] (6) The path cost results, path ranking results, path filtering results, or path rejection suggestions output by the physical path cost evaluation module;

[0441] (7) Phase consistency index of the output of a highly stable physical reference;

[0442] (8) Local link feedback information;

[0443] (9) S-TTL survival time determination results;

[0444] (10) S-CD conflict detection and arbitration results;

[0445] (11) Business level, security level, latency constraints, energy consumption constraints, resource constraints or audit strategy.

[0446] With the above inputs, the collaborative routing decision module can simultaneously consider the target spatial location, medium environment, phase constraints, link status, spatial state machine feedback, service requirements, and security requirements to form a comprehensive routing decision for the space Internet.

[0447] 7.4 Path Selection Logic

[0448] In some implementations, cooperative routing path selection can be based on physical path cost. The system calculates the physical path cost for each candidate path in the candidate path set and selects the path that meets preset constraints and has the lowest cost as the target path. Preferably, path selection can be expressed as:

[0449]

[0450] in, Indicates the selected collaborative routing path. Represents the set of candidate paths. Indicates the first The physical path cost of each candidate path.

[0451] In some implementations, the system can also modify the path selection results by considering factors such as service level, security level, energy consumption constraints, path resource occupancy status, path continuity closure conditions, and path switching hysteresis conditions. For example, for low-latency services, the priority of high-latency paths can be reduced; for high-security services, the priority of quantum medium paths or paths with strong physical coherence verification can be increased; for low-power services, paths with lower energy consumption and that meet basic continuity requirements can be selected; and for high-stability services, frequent path switching can be avoided.

[0452] The above path selection formula is only a preferred expression. In actual implementation, it can also be implemented using multi-factor scoring, rule engines, threshold determination, historical path stability statistics, machine learning-assisted decision-making, neural network scoring, policy network output, or a hybrid hardware and software routing strategy. As long as it evaluates, filters, accepts, or rejects candidate paths based on the physical field and physical path cost in the address vector, it falls under the implementation of this invention.

[0453] 7.5 Adaptive Path Switching

[0454] When the physical path cost of the current path exceeds a preset path cost threshold, or when a candidate path has a cost advantage relative to the current path that meets a preset improvement margin, the system can perform cross-media adaptive path switching.

[0455] In some implementations, the cross-media adaptive path switching may include:

[0456] (1) Switch from the dielectric path to the free space optical path to bypass electromagnetic interference or high-bandwidth congested areas;

[0457] (2) Switch from the terahertz path to a reconfigurable smart surface reflection path to bypass people, walls, vehicles or other obstructions;

[0458] (3) Switch from free space optical path to dielectric path to cope with optical path blockage, fog, rain, snow or beam misalignment;

[0459] (4) Switch from ordinary dielectric path to quantum dielectric path or quantum key-assisted path to meet the requirements of high security level transmission;

[0460] (5) Switch from ground links to low-altitude relay, satellite relay, vehicle relay or ship relay paths to maintain continuous delivery in large-scale mobile scenarios;

[0461] (6) Perform composite routing between multiple paths, so that critical fields, control commands or security verification information are transmitted along the high-reliability path, and ordinary payloads are transmitted along the high-bandwidth path.

[0462] When performing path switching, the system can output switching commands to the radio frequency antenna array, terahertz transceiver module, optical modulator, beam pointing controller, reconfigurable smart surface controller, quantum link control module, relay node control unit, or other media execution unit.

[0463] 7.6 Path Veto Mechanism

[0464] In this embodiment, path rejection is an important component of cooperative routing processing. Path rejection means that even if a candidate path is physically or logically reachable, it will be prevented from being selected as the target path if it does not meet preset conditions such as phase continuity, media compatibility, security and trustworthiness, resource constraints, continuity recovery, or physical coherence constraints.

[0465] In some implementations, the system may perform path rejection in the following situations:

[0466] (1) The phase deviation of the candidate path exceeds the preset phase threshold;

[0467] (2) The continuity residuals of the candidate paths do not meet the preset continuity closure condition;

[0468] (3) The media environment of the candidate path does not match the current business requirements;

[0469] (4) The path loss, time delay deviation or Doppler disturbance of the candidate path continues to exceed the preset range;

[0470] (5) The object identity, link security level, or audit traceability of the candidate path do not meet the requirements;

[0471] (6) Although the candidate path is reachable, it may lead to high resource contention or high energy consumption;

[0472] (7) The candidate path is still not verifiable within the fracture resynchronization recovery window.

[0473] By introducing a path rejection mechanism, the system can avoid incorrectly selecting a candidate path simply because the link is reachable or the local cost is low, thereby improving the physical reliability and stability of path acceptance decisions.

[0474] 7.7 Path Reselection Mechanism

[0475] In some implementations, the system can perform path reselection when the current path fails, the target path is rejected, path switching fails, the path is unverifiable, or the spatial state machine feedback does not meet the requirements. Path reselection differs from ordinary path switching, and its triggering conditions typically include the current target path no longer meeting the acceptance conditions, or previous candidate paths being eliminated after continuity verification, security verification, or recovery quality assessment.

[0476] During the path reselection process, the system can re-extract unrejected candidate paths from the candidate path set, recalculate their path cost, continuity closure, security reliability, and resource constraint status, and select the next priority path that meets the conditions; if there is no acceptable path, the system can trigger link fallback, break resynchronization, security lock, or audit logging.

[0477] 7.8 Address Vector Driven Routing

[0478] In this embodiment, path selection, path switching, path rejection, and path reselection are not simply triggered by the link layer state, but are driven by the physical field in the spatial Internet address vector and the path cost.

[0479] For example, when the medium parameter field in the address vector indicates that the target space cell is behind a high-loss wall, and the local link feedback indicates that the current terahertz path is blocked, the system can increase the cost of the current terahertz path and select a reconfigurable smart surface reflection path or a dielectric bypass path.

[0480] For example, when the continuity residual field in the address vector shows that the previous path has a stable optical phase residual, while the current dielectric path has a large phase deviation, the system can increase the priority of the optical dielectric path or the free space optical path to maintain phase continuity.

[0481] For example, when the vertical hierarchy field in the address vector indicates that the target is located in the low-altitude airway layer, and the current ground base station link is obstructed or has severe multipath, the system can select a low-altitude relay path, a vehicle-mounted relay path, or a satellite-assisted path; if a candidate path is geometrically reachable, but its continuity residual or security reliability does not meet the requirements, the system can reject the candidate path.

[0482] Therefore, the spatial Internet address vector is not only used to identify where the target space is, but also to guide which physical path should be taken to reach the target space, and which paths should not be accepted.

[0483] 7.9 Phase Continuity Constraints in Path Switching

[0484] During the collaborative routing path switching process, the system uses the phase-time field, phase continuity fingerprint, or cross-media continuity residual field in the spatial Internet address vector as a benchmark to constrain the phase continuity before and after the path switching.

[0485] In some implementations, when the system switches from the current path to a candidate path, the system can calculate the path switching phase deviation based on the phase state difference, delay difference, and residual difference between the current path and the candidate path. Preferably, the path switching phase deviation can be expressed as:

[0486]

[0487] in, Indicates the path switching phase deviation. Indicates the current path phase state. Indicates the phase state of the candidate path. Indicates the current path delay. Indicates the candidate path delay. This represents the residual summary of the current path. Represents a summary of candidate path residuals. and This represents the weighting coefficient or coupling coefficient.

[0488] When the path switching phase deviation does not exceed the preset switching threshold, the system allows path switching to be performed; when the path switching phase deviation exceeds the preset switching threshold, the system may trigger physical layer enhancement correction, candidate path reselection, path rejection, break resynchronization, or link backoff.

[0489] This mechanism allows the system to avoid selecting candidate paths with discontinuous phases solely based on lower path costs, thereby improving the verifiability and continuity of cross-media cooperative routing. It should be understood that the above formula is only a preferred expression; in actual implementation, equivalent phase difference functions, delay difference functions, residual matching functions, coherence determination functions, or physical path cost correction functions can be used.

[0490] 7.10 Routing Resource Allocation and Physical Layer Execution

[0491] In this embodiment, the results of the cooperative routing process can be further used to control physical layer resource allocation and media execution actions.

[0492] In some implementations, the system may perform the following controls based on the selected path type:

[0493] (1) When the dielectric path is selected, the system controls the radio frequency antenna array, beamforming unit or base station transceiver module to perform the corresponding beam pointing, frequency band selection and modulation parameter configuration;

[0494] (2) When the terahertz path is selected, the system controls the terahertz transceiver module to perform narrow beam alignment, frequency selection, power control and Doppler compensation;

[0495] (3) When the free space optical path is selected, the system controls the beam pointing module, optical modulator or optical receiving module to perform optical path alignment, optical intensity adjustment and optical phase calibration;

[0496] (4) When a reconfigurable smart surface reflection path is selected, the system controls the reconfigurable smart surface node to adjust the reflection phase, reflection direction, reflection gain, or unit encoding state.

[0497] (5) When the quantum medium path is selected, the system controls the quantum link module to perform key assistance, entanglement state verification, quantum state fidelity detection or high-security transmission strategy;

[0498] (6) When a relay path is selected, the system controls the low-altitude air relay, vehicle-mounted relay, ship-mounted relay or satellite relay node to perform forwarding path establishment and continuity verification;

[0499] (7) When a candidate path is rejected, the system releases or does not allocate the corresponding path resources and transfers the resource scheduling to other candidate paths that have not been rejected.

[0500] Therefore, the result of the cooperative routing process is not only a logical layer path identifier, but can also directly drive the physical layer transmission resources and media path execution units.

[0501] 7.11 Address State Update After Routing Processing

[0502] After completing path selection, path switching, path rejection, or path reselection, the system can update the relevant status of the spatial Internet address vector. Preferably, the system can write the medium identifier, path loss residual, phase residual, delay residual, path switching flag, path rejection flag, or path reselection flag of the new path into the continuity residual field, medium status field, or equivalent representation of the address vector in the next cycle.

[0503] In some implementations, when a path switch is successful, the system can use the phase continuity fingerprint of the new path as the basis for continuity verification in subsequent transmission stages; when a path switch fails, the system can trigger break resynchronization, path reselection, link rollback, or security locking; when a path is rejected, the system can write the rejection result and its corresponding residual summary into the subsequent recovery context to avoid repeatedly selecting the same unacceptable path in a short period of time.

[0504] By feeding back the routing processing results to the address vector state update process, this embodiment enables the cooperative routing results to influence subsequent addressing and path selection, thereby forming a closed loop between addressing and routing.

[0505] 7.12 Technical Effects of This Embodiment

[0506] Through the above methods, this embodiment has at least the following technical effects:

[0507] First, it enables spatial Internet routing to no longer rely solely on logical link states or network topology rules, but rather on medium parameters, phase and time information, continuity residuals, and physical path costs in the address vector for path selection.

[0508] Secondly, it enables the system to adaptively switch between dielectric, optical, quantum, terahertz, free-space light, reconfigurable smart surface reflection, and other heterogeneous media paths;

[0509] Third, by using path rejection and path reselection mechanisms, we avoid selecting candidate paths that are physically reachable but do not meet the requirements of continuity, security, or trustworthiness.

[0510] Fourth, by determining the phase deviation during path switching, we can avoid selecting candidate paths that have lower physical cost but do not meet the phase continuity requirements.

[0511] Fifth, it enables the results of collaborative routing processing to directly drive physical layer resource configuration and to influence address state updates in reverse, thereby improving the continuity and robustness of cross-media space Internet transmission.

[0512] 8. S-TTL, S-CD, and Cooperative Routing Feedback Examples

[0513] The following is combined Figure 8This embodiment explains the S-TTL lifetime determination, S-CD collision detection, and cooperative routing feedback process. It further illustrates the S-TTL lifetime determination and S-CD collision detection in the spatial state machine, and how the spatial state machine outputs feedback signals to the cooperative routing path selection, path switching, path rejection, or path reselection processes. Unlike state management in traditional networks, which is only used for logical connection maintenance, the spatial state machine in this embodiment simultaneously participates in address refresh, route state maintenance, path reselection, path rejection, physical layer modulation parameter adjustment, route resource allocation, and unauthorized access blocking.

[0514] 8.1 Purpose of Setting Up a Spatial State Machine

[0515] In the context of the space internet, target physical space units, terminal devices, drones, vehicles, robots, digital content, or other objects may be in constant motion and undergoing state changes. If a space address remains valid even after a physical object has crossed boundaries, its phase state has drifted, its path continuity has become unbalanced, or its routing resources have been occupied, it can easily lead to address drift, inaccurate delivery, path conflicts, mis-sending of control signals, incorrect path selection, or security risks.

[0516] Therefore, this embodiment sets up a spatial state machine to perform liveness status determination and conflict detection on the spatial Internet address vector. The determination results of the spatial state machine are not only used for address refresh and state failure handling, but also serve as feedback input for cooperative routing path selection, path switching, path rejection, path reselection, physical layer modulation parameter adjustment, routing resource allocation, and unauthorized access blocking.

[0517] 8.2 S-TTL Survival Time Determination

[0518] In this embodiment, the S-TTL (Spatial Time-to-Live) determination is used to determine whether the spatial internet address vector still corresponds to the current real physical space state. The S-TTL is not a traditional time-to-live based on a decrementing time counter, but rather a space survival state determination mechanism triggered by physical events.

[0519] In some implementations, the S-TTL lifetime determination includes at least one or more of the following determination conditions:

[0520] (1) Whether the cumulative displacement exceeds the preset voxel boundary threshold;

[0521] (2) Whether the phase displacement integral exceeds the preset phase displacement threshold;

[0522] (3) Whether the Doppler integral exceeds the preset Doppler threshold;

[0523] (4) Whether the path switching phase deviation exceeds the preset switching threshold;

[0524] (5) Whether the state of the medium undergoes a sudden change;

[0525] (6) Whether the continuous residual exceeds the preset residual threshold;

[0526] (7) Whether there have been incompatible changes in the reference system version;

[0527] (8) Whether the physical path cost continuously exceeds the preset path cost threshold;

[0528] (9) If the path is reachable but does not meet the preset acceptance conditions, should it be switched to the path rejection state?

[0529] When any of the above conditions are met, the system can determine that the current spatial Internet address vector is in an abnormal state and trigger address refresh, path switching, path rejection, path reselection, route status failure, enhanced correction, breakage resynchronization, or security lock processing.

[0530] 8.3 S-TTL Decision Function

[0531] In some implementations, the S-TTL survival time determination can preferably be expressed as:

[0532]

[0533] in, Indicates the cumulative displacement. This indicates the preset voxel boundary threshold. This represents the amount of phase displacement change. This indicates the preset phase displacement threshold. Indicates Doppler frequency shift, This indicates the preset Doppler threshold. Represents the physical path cost. This indicates the preset path cost threshold.

[0534] When any of the above conditions are met, the system may trigger address refresh, path switching, path rejection, path reselection, or routing status failure. It should be understood that the above formulas are merely preferred implementations, and those skilled in the art can employ equivalent displacement determination, phase determination, Doppler determination, path cost determination, or multi-factor comprehensive determination methods without departing from the inventive concept.

[0535] 8.4 Relationship between S-TTL and routing state

[0536] In this embodiment, the S-TTL determination result can be used as feedback input for the cooperative routing decision module. When the S-TTL determines that the current address is still valid, the cooperative routing decision module can continue to use the current spatial internet address vector for path cost evaluation and path selection; when the S-TTL determines that the current address is about to expire or has already expired, the cooperative routing decision module can reduce the priority of the current path, triggering path switching, path rejection, path reselection, or requesting the address generation module to regenerate the spatial internet address vector.

[0537] For example, when the cumulative displacement of the mobile terminal exceeds the current voxel boundary threshold, the system can trigger an address refresh and re-evaluate the candidate paths corresponding to the target spatial unit. When the Doppler integral continuously increases, the system can determine that the current path is not stable enough in the direction of movement and prioritize paths with better beam tracking capabilities. When the physical path cost continuously exceeds the threshold, the system can determine that the current path is not suitable to continue carrying the current address vector and trigger cross-medium path switching or path rejection.

[0538] 8.5 S-CD Collision Detection

[0539] In this embodiment, S-CD conflict detection is used to perform conflict identification and arbitration when multiple objects compete for the same spatial unit or routing resource corresponding to the same spatial Internet address vector. The objects may include physical terminals, mobile robots, drones, vehicles, digital assets, virtual content, control requests, routing sessions, or other objects that require space units or transmission resources.

[0540] In some implementations, the S-CD collision detection may be performed based on one or more of the following features:

[0541] (1) Field strength characteristics, used to determine the signal strength distribution of the object in the target space cell;

[0542] (2) Reflection characteristics, used to determine whether an object has stable solid reflection;

[0543] (3) Material density fingerprint, used to determine the physical material or space occupancy status of the object;

[0544] (4) Object fingerprint, used to determine object identity, device legitimacy or digital asset ownership;

[0545] (5) Phase continuity fingerprint, used to determine whether an object inherits a valid continuous chain;

[0546] (6) Reference system version consistency, used to determine whether objects are based on the same spatial interpretation system;

[0547] (7) Routing resource occupancy status, used to determine whether an object is contending for the same routing path, beam resource, beam resource, reflector resource or recovery window resource.

[0548] In some implementations, S-CD conflict detection preferably employs a hierarchical conflict arbitration mechanism. The system first performs spatial slicing of the target spatial unit based on vertical hierarchical information to distinguish the object occupancy relationships in different floors, different height layers, different low-altitude airway layers, different underground layers, or different underwater layers; then, it performs interpretation consistency checks based on reference frame version information to distinguish between apparent overlap and actual spatial conflicts caused by reference frame differences.

[0549] When multiple objects overlap at the same projected position on the same plane, the system preferentially performs the first-level conflict reduction based on the vertical hierarchy information and the reference frame version information, and then performs the second-level conflict arbitration by combining the object fingerprint, phase continuity fingerprint, field strength characteristics, reflection characteristics and routing resource occupancy status.

[0550] 8.6 S-CD Conflict Arbitration Logic

[0551] In some implementations, the system can arbitrate multiple objects competing for the same spatial unit or routing resource based on one or more of the following methods: rule arbitration, threshold arbitration, priority arbitration, multi-factor scoring, or machine learning-assisted arbitration.

[0552] Preferably, objects with stable entity reflection, valid object fingerprints, high continuity inheritance scores, and that satisfy routing resource priority constraints can be identified as dominant objects. Objects lacking entity reflection, with abnormal object fingerprints, incomplete continuity chains, or that do not meet routing resource authorization conditions or path acceptance conditions in the current scenario can be downgraded, attached, delayed, switched to backup paths, placed in a pending rejection state, or directly blocked.

[0553] In some implementations, S-CD conflict arbitration may follow the following processing logic:

[0554] (1) When a physical object and a virtual object compete for the same spatial unit, the spatial state corresponding to the physical object shall be reserved first;

[0555] (2) When multiple entities compete for the same spatial unit, arbitration is carried out based on field strength characteristics, reflection characteristics, object fingerprints and phase continuity fingerprints;

[0556] (3) When multiple sessions compete for the same routing resource, arbitration shall be conducted based on service level, security level, continuity status, path cost and recovery acceptability;

[0557] (4) When an unauthorized object is detected occupying space unit or routing resources, unauthorized access blocking, security lock, path rejection or audit log is triggered.

[0558] 8.7 Collision Detection and Routing Resource Allocation

[0559] In this embodiment, S-CD collision detection is used not only for determining space cell occupancy but also for routing resource allocation. The routing resources may include radio frequency beam resources, terahertz narrow beam resources, free-space beam resources, reconfigurable smart surface reflector resources, quantum secure link resources, relay node resources, path switching window resources, or recovery window resources.

[0560] When multiple objects compete for the same routing resource, the system can determine the resource allocation order based on the S-CD conflict arbitration result. For example, objects with higher security levels, more complete continuity chains, more stable entity reflections, higher business priorities, or stronger recovery acceptability can obtain routing resources first. Objects judged as unauthorized, low-trust, having abnormal continuity, or currently not meeting the path acceptance conditions can be blocked, downgraded, delayed, switched to an alternative path, or have their path rejected.

[0561] Through this mechanism, S-CD conflict detection can unify spatial object conflict determination with routing resource management, so that both space occupancy and path occupancy in the spatial Internet are subject to physical state constraints.

[0562] 8.8 State machine feedback to cooperative routing decision

[0563] In this embodiment, the output of the spatial state machine can serve as a feedback signal for the cooperative routing decision module. The feedback signal may include:

[0564] (1) Address valid status;

[0565] (2) The address is about to expire;

[0566] (3) Voxel boundary crossing state;

[0567] (4) Phase displacement exceeds threshold state;

[0568] (5) Doppler integral exceeding threshold state;

[0569] (6) Object conflict state;

[0570] (7) Routing resource conflict status;

[0571] (8) Unauthorized access status;

[0572] (9) Route switching suggestions;

[0573] (10) Path rejection recommendations;

[0574] (11) Path reselection suggestions;

[0575] (12) Suggestions for adjusting modulation parameters;

[0576] (13) Security Lock Recommendation.

[0577] The cooperative routing decision module can perform path selection, path switching, path rejection, path reselection, beam reconfiguration, beam pointing adjustment, reconfigurable intelligent surface state update, routing resource release, and unauthorized object blocking or breakage resynchronization based on the aforementioned feedback signals. Therefore, the spatial state machine not only exists as an address management component but also becomes the feedback control component in the cooperative routing closed loop.

[0578] 8.9 Physical Layer Modulation Parameter Adjustment

[0579] In some implementations, the determination results of S-TTL or S-CD can be used to adjust the physical layer modulation parameters. These physical layer modulation parameters may include one or more of the following: transmit power, beam direction, modulation order, coding scheme, carrier frequency, terahertz beamwidth, light intensity modulation parameters, free-space light pointing parameters, reconfigurable smart surface reflection phase, or quantum link security parameters.

[0580] For example, when S-TTL determines that the current object is in a high-speed moving state, the system can reduce the modulation order, increase the beam tracking frequency, or switch to a more stable path; when S-CD detects routing resource contention, the system can reserve high-priority resources for the dominant object and switch subordinate objects to backup paths; when a candidate path is detected to be reachable but would lead to serious conflicts or high resource consumption, the system can trigger path rejection; when an unauthorized object is detected attempting to occupy space units or routing resources, the system can block the corresponding access and write it to the audit log.

[0581] 8.10 Synergy with Fracture Resynchronization

[0582] In this embodiment, the spatial state machine can also work in conjunction with the break resynchronization mechanism. When the S-TTL determines that the address state is abnormal but the continuity chain can still be recovered, the system can preferentially enter the break resynchronization process instead of immediately performing a full readdressing. When the S-CD determines that there is an object conflict but a legitimate dominant object exists, the system can preserve the continuity chain of the dominant object and perform subordinate attachment, sub-address derivation, alternative path allocation, path rejection, or delay processing on other objects.

[0583] When both S-TTL and S-CD indicate that the current state is unrecoverable, or when all candidate paths are rejected, the system can trigger address re-addressing, link fallback, path reselection, state failure, or security locking. Through this mechanism, the spatial state machine can coordinate address refresh, path switching, path rejection, path reselection, and continuity recovery, avoiding unnecessary full-link reconstruction.

[0584] 8.11 Technical Effects of This Embodiment

[0585] Through the above methods, this embodiment has at least the following technical effects:

[0586] First, by using S-TTL (Time to Live) to determine the validity of spatial Internet address vectors, the validity is driven by real physical events rather than solely by time counts, thus improving the consistency between address state and physical state.

[0587] Secondly, by incorporating physical path cost and path acceptance conditions into S-TTL determination, continuous path instability can trigger address refresh, path switching, path rejection, or route state failure, thereby improving the dynamic response capability of cooperative routing.

[0588] Third, by using S-CD conflict detection, conflict arbitration can be performed based on physical characteristics when multiple objects compete for the same spatial unit or routing resource, thereby improving the determinism of spatial and routing resource management.

[0589] Fourth, by feeding back the determination results of S-TTL and S-CD to the cooperative routing decision module, the spatial state machine is extended from simple address state management to a cooperative routing feedback control mechanism.

[0590] Fifth, by using the conflict arbitration results for physical layer modulation parameter adjustment, routing resource allocation, path rejection, and unauthorized access blocking, the security, robustness, and commercial viability of the space internet in high-density, multi-object, and highly dynamic environments are improved.

[0591] 9. Example of Phase Continuity Inheritance and Discontinuity Resynchronization

[0592] The following is combined Figure 9 This document explains the process of cross-media phase continuity inheritance, continuity verification, and break resynchronization. It further illustrates how to maintain the physical continuity, spatial identity continuity, and path context continuity carried by the spatial Internet address vector in scenarios involving cross-media transmission, path switching, path rejection, unverifiable paths, or physical layer occlusion, and how to perform break resynchronization through a recovery window, the most recent valid residual digest, and the recovery context when continuity is broken.

[0593] In this invention, continuity restoration does not merely mean reconnecting the link, but requires that the address context, path context, and their corresponding physical context remain recoverably consistent before and after the handover. In other words, this embodiment not only focuses on whether a connection is re-established, but also on whether, after reconnection, the restored address interpretation, path semantics, phase state, and continuity relationships can still form a verifiable inheritance relationship with the state before the handover.

[0594] 9.1 Objects with Phase Continuity Inheritance

[0595] In some implementations, the objects of phase continuity inheritance may include:

[0596] (1) The phase-time field in the spatial Internet address vector;

[0597] (2) Phase continuity fingerprint;

[0598] (3) Cross-media continuity residual field;

[0599] (4) Path status summary;

[0600] (5) Restore context information;

[0601] (6) Medium parameter information, time phase information, path status information or their equivalent representation that establish an atomic binding relationship with the current address vector.

[0602] One or more of the above objects can be used together as the basis for determining continuity inheritance and restoration.

[0603] 9.2 Most recent valid residual summary

[0604] In some implementations, the system can continuously record the staged residual results during address generation, physical layer correction, path evaluation, path switching, path rejection, or path reselection, and generate the most recent valid residual summary when preset valid conditions are met.

[0605] The most recent valid residual summary is preferably used to characterize the phase residual, time delay residual, field strength residual, path loss residual, multipath residual, medium switching residual, recovery context summary, or a combination thereof at the most recent moment before the discontinuity break.

[0606] In this invention, the most recent valid residual digest is not ordinary log information, but is preferably used as the core recovery basis for break resynchronization. As long as the system can obtain the most recent valid residual digest within the recovery window, it can prioritize attempting to restore continuous semantics without immediately triggering full-link reconstruction.

[0607] 9.3 Restore Window

[0608] In some implementations, when the system detects a continuity interruption, path switching failure, unverifiable path, or physical layer obstruction, it can initiate a preset recovery window. The recovery window refers to a time period within which the system is allowed to prioritize continuous recovery, recovery context reconstruction, partial synchronization recovery, or restricted path reselection within a limited timeframe.

[0609] The settings for the recovery window can be determined based on service latency requirements, media switching frequency, link stability, object movement speed, state machine feedback results, or a combination thereof.

[0610] In some implementations, when the system is within the recovery window, it is preferable to first call the most recent valid residual digest, phase continuity fingerprint, recovery context, and atomic binding relationship to perform break resynchronization; if recovery cannot be completed after the recovery window ends, it is preferable to trigger readdressing, link fallback, path reselection, state failure, or security lock.

[0611] 9.4 Restoring the Context

[0612] Recovery context refers to a set of state information used to support break resynchronization, continuity recovery, address interpretation recovery, or routing recovery.

[0613] In some implementations, restoring the context may include:

[0614] (1) The most recent valid residual summary;

[0615] (2) Phase continuity fingerprint;

[0616] (3) Path status information;

[0617] (4) Reference system version information;

[0618] (5) Summary of media status;

[0619] (6) Address interpretation status;

[0620] (7) Information related to atomic binding relationships;

[0621] (8) State machine feedback results;

[0622] (9) Other auxiliary information to support local recovery.

[0623] The recovery context can be generated, cached, transmitted, inherited, or recovered by the terminal, edge node, media switching node, candidate path filtering node, photonic gateway, or cloud-edge collaborative control platform.

[0624] 9.5 Basic Process of Fracture Resynchronization

[0625] In some implementations, the break resynchronization process may include the following steps:

[0626] (1) Detection of continuity interruption, path switching failure, path unverifiable, physical layer occlusion, residual mutation or other recovery trigger conditions;

[0627] (2) Start the recovery window;

[0628] (3) Retrieve the most recent valid residual summary, phase continuity fingerprint, and restored context;

[0629] (4) Construct a temporary recovery state based on the recovery context, current media status, current path status, and reference system version information;

[0630] (5) Perform continuity closure judgment, path acceptability judgment, state machine consistency judgment or enhanced correction on the temporary recovery state;

[0631] (6) When the recovery result meets the preset recovery conditions, restore the address context, path context and its corresponding physical context;

[0632] (7) When recovery fails, trigger readdressing, link fallback, path reselection, status failure, security lock or audit log.

[0633] 9.6 Recovery Judgment Relationship for Fracture Resynchronization

[0634] In some implementations, the recovery determination process can be represented as:

[0635]

[0636] in, Indicates time The recovery judgment result, This represents the most recent valid residual summary. This indicates phase continuity fingerprinting or recovery context information. This indicates the current media status, path status, reference system version information, or a combination thereof. This represents the function for determining the recovery.

[0637] When the recovery determination result meets the preset conditions, the system can perform continuous recovery; when the recovery determination result does not meet the preset conditions, the system can switch to path reselection, link rollback or status failure process.

[0638] In some implementations, the recovery determination can also be expressed as:

[0639]

[0640] in, Indicates whether the recovery was successful. This indicates the current recovery quality assessment value. Indicates the recovery threshold. When When, the system performs recovery; when When this happens, the system performs address relocation, path reselection, link fallback, or security locking.

[0641] The above-mentioned restoration quality assessment values It can be determined based on the degree of residual closure, phase consistency, path acceptability, state machine feedback consistency, or a combination thereof.

[0642] 9.7 The role of atomic binding relationships in recovery

[0643] In some implementations, the spatial Internet address vector is atomically bound to medium parameter information, time phase information, cross-medium continuity residual information, path state information, recovery context information, or their equivalent representations.

[0644] Therefore, during the resynchronization process, the system does not simply restore a single address identifier, but prioritizes synchronization recovery:

[0645] (1) Address interpretation relationship;

[0646] (2) Path interpretation relationship;

[0647] (3) Medium constraint relationship;

[0648] (4) Semantic relations of continuity;

[0649] (5) Restore the context.

[0650] When atomic binding relationships can be maintained, the restored address context, path context, and their corresponding physical context can be synchronously interpreted, refreshed, invalidated, or restored. When atomic binding relationships cannot be maintained, the system can directly determine that the current restoration conditions are insufficient and then proceed to readdressing, rerouting, or security processing.

[0651] 9.8 Allocation of Recovery Responsibilities between Ordinary Nodes and Critical Nodes

[0652] In some implementations, ordinary nodes preferably perform local continuity inheritance, basic state inheritance, local residual judgment, or lightweight recovery attempt; edge nodes, media switching nodes, continuity anomaly nodes, candidate path filtering nodes, or other critical nodes preferably perform recovery context reconstruction, enhanced correction, recovery judgment, atomic binding relationship verification, or strategy diversion after recovery failure.

[0653] Therefore, this invention can avoid all nodes simultaneously performing the most complex recovery process after a continuity interruption, thereby reducing the instantaneous recovery overhead of the overall system and improving the accuracy and controllability of recovery at critical locations.

[0654] 9.9 Relationship with state machine feedback and path evaluation

[0655] In some implementations, the break resynchronization process is not executed in isolation, but rather forms a unified closed loop together with spatial state machine feedback, physical path cost assessment, and path acceptability determination.

[0656] For example, when S-TTL determination is abnormal, S-CD conflict is aggravated, path cost changes abruptly, continuous residuals continue to accumulate, or object fingerprint conflicts occur, the system can trigger enhanced recovery determination first; if the enhanced recovery determination result does not meet the requirements, path rejection, path reselection, link rollback, or security locking can be further executed.

[0657] Therefore, the resynchronization of the fracture in this embodiment is not only a continuity recovery mechanism, but also a convergence link of path assessment, state feedback and recovery control.

[0658] 9.10 Technical Effects of this Embodiment

[0659] Through the above methods, this embodiment has at least the following technical effects:

[0660] First, by introducing the most recent valid residual summary, phase continuity fingerprint, recovery context, and recovery window into the continuity recovery process, the system can prioritize attempting to recover continuity semantics in scenarios such as short-term occlusion, path switching mismatch, unverifiable path, or media switching, rather than immediately performing full-link reconstruction.

[0661] Secondly, by establishing atomic binding relationships between the spatial Internet address vector and medium parameter information, time phase information, continuity residual information, path state information and recovery context information, the recovered address context, path context and their corresponding physical context can be synchronously interpreted, synchronously refreshed, synchronously invalidated or synchronously recovered.

[0662] Third, by layering and distributing the recovery responsibilities between ordinary nodes and critical nodes, the computational and latency pressure caused by the simultaneous execution of highly complex recovery processes across the entire network is reduced;

[0663] Fourth, by integrating the fracture resynchronization with state machine feedback, path cost assessment, and path acceptability judgment into the same recovery closed loop, the recovery efficiency, recovery reliability, and overall system robustness in cross-media, high-dynamic, and complex occlusion scenarios are improved.

[0664] 10. System Module Collaboration and Compatibility Bridging Implementation Examples

[0665] The following is combined Figure 10 and Figure 11This paper describes the module collaboration relationships and compatibility bridging process of the non-fixed topology addressing physical correction collaborative routing system of the Space Internet. This embodiment further illustrates how the system of the present invention works collaboratively around the same Space Internet address vector, shared physical synchronization conditions, a highly stable physical reference benchmark, and continuous residuals, and establishes compatible interactive relationships with existing logical network address systems, spatial grid index systems, or coordinate reference systems through the physical semantic interface layer.

[0666] In this invention, the system layer does not separate address generation, physical correction, path evaluation, cooperative routing, continuity restoration, and compatibility bridging into independent processing modules. Instead, it establishes a unified underlying protocol closed loop around the same native address object. That is, although the modules can be executed separately according to the deployment environment, their inputs, outputs, and feedback are preferably organized around the same spatial Internet address vector, the same shared physical synchronization conditions, and the same continuity semantics.

[0667] 10.1 Overall System Module Composition

[0668] In some embodiments, the system of the present invention includes:

[0669] (1) Spatial information acquisition module, used to acquire the original field set corresponding to the target physical space unit;

[0670] (2) Dynamic seed synchronization module, used to deterministically derive dynamic seeds locally based on shared physical synchronization conditions;

[0671] (3) Address generation module, used to perform non-fixed topology mapping on the original field set according to the topology descriptor and dynamic seed to generate spatial Internet address vector;

[0672] (4) Physical layer correction module, used to perform coherent correction on the spatial Internet address vector, routing path or cross-media transmission process based on a highly stable physical reference benchmark;

[0673] (5) Path cost evaluation module, used to parse the medium parameter field, phase time field, cross-medium continuity residual field or their equivalent representation in the spatial Internet address vector, and calculate the physical path cost;

[0674] (6) A cooperative routing decision module, used to perform cooperative routing path selection, adaptive path switching, path rejection or path reselection between at least two different media paths based on the physical path cost;

[0675] (7) Spatial state machine module, used to perform S-TTL lifetime determination and S-CD collision detection, and output state feedback to the cooperative routing decision module;

[0676] (8) Continuity verification and resynchronization module, used to perform phase continuity fingerprint inheritance, continuity verification and break resynchronization when there is cross-media transmission, path switching, path rejection, continuity interruption or path unverifiable.

[0677] (9) A compatible bridging module is used to establish mapping, encapsulation, bridging or index association between the spatial Internet address vector, at least some fields in the original field set, spatial hash field, continuous residual field, medium parameter field, reference system version field or their equivalent representation, and existing logical network address system, coordinate reference system, geospatial grid index system or their combination, through the physical semantic interface layer.

[0678] 10.2 The Main Principle of System Module Collaboration

[0679] In some implementations, the overall system processing flow can be summarized as follows:

[0680] After the spatial information acquisition module obtains the original field set, the dynamic seed synchronization module locally and deterministically derives a dynamic seed based on shared physical synchronization conditions. The address generation module generates a spatial internet address vector based on the topology descriptor and the dynamic seed. Subsequently, the physical layer correction module performs coherent correction on the address vector or related paths based on a highly stable physical reference benchmark. The path cost evaluation module calculates the physical path cost based on the physical fields in the address vector. The cooperative routing decision module performs cross-media path selection, adaptive switching, path rejection, or path reselection based on the physical path cost. The spatial state machine module feeds back the S-TTL and S-CD results to the cooperative routing decision module. The continuity verification and resynchronization module performs continuity inheritance, continuity verification, and break resynchronization as needed. Finally, the compatibility bridging module outputs the results through the physical semantic interface layer to support compatible interaction with existing logical network address systems, spatial grid index systems, or coordinate reference systems.

[0681] 10.3 Centralized Deployment vs. Distributed Deployment

[0682] In some implementations, the modules can be centrally deployed on a single device, or distributed across terminals, base stations, photonic gateways, reconfigurable smart surface nodes, edge nodes, low-altitude communication nodes, vehicle-mounted communication nodes, unmanned system nodes, or cloud-edge collaborative control platforms.

[0683] In a centralized deployment mode, the system preferably uses the same device to complete the acquisition of original fields, dynamic seed derivation, address generation, physical layer correction, path evaluation, collaborative routing decision-making, continuity recovery, and interface bridging. This is suitable for partially closed scenarios, small private network scenarios, or system verification scenarios.

[0684] In a distributed deployment, different modules can be collaboratively undertaken by different nodes. For example, terminal-side nodes are preferably responsible for obtaining raw fields, resolving basic addresses, and performing local lightweight processing; base stations, photonic gateways, or edge nodes are preferably responsible for providing highly stable physical reference benchmarks, enhancing error correction, performing phased residual verification, determining path acceptability, and controlling recovery; and the cloud-edge collaborative control platform is preferably responsible for cross-regional policy control, reference collaboration, historical path statistics, or recovery policy management.

[0685] 10.4 Deployment Coordination of Highly Stable Physical Reference Benchmarks

[0686] In some implementations, a highly stable physical reference reference is preferably deployed at a base station, photonic gateway, edge node, or cloud-edge collaborative control platform. The node can provide downstream nodes with a highly stable phase reference, differential correction, phase compensation, reference summary, or constrained synchronization results based on a centrally deployed reference source, a distributed reference network, an edge-side reference source, or a combination thereof.

[0687] Terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes are preferably not responsible for the full deployment of the highest-precision reference source, but instead perform local phase calculation, residual tracking, address resolution, or limited synchronization recovery.

[0688] Thus, this invention achieves hierarchical provision of highly stable physical reference capabilities at the system level, enabling centralized deployment of high-precision correction capabilities, while local nodes can still participate in the same protocol loop through differential correction, reference summaries, or local synchronization recovery.

[0689] 10.5 Allocation of Responsibilities between Ordinary Nodes and Critical Nodes

[0690] In some implementations, ordinary nodes in the system preferably perform lightweight address resolution, local field inheritance, basic path judgment, basic residual processing, or primary path filtering; edge nodes, media switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other critical nodes preferably perform phased residual verification, enhanced correction, path acceptability determination, context recovery reconstruction, or break resynchronization trigger control.

[0691] By using this method of assigning responsibilities, the present invention does not require all nodes to always bear the most complex parsing, correction and recovery tasks. Instead, it allows the system to dynamically allocate the processing load based on the node's capabilities, link stage and path status, thereby reducing the latency pressure caused by hop-by-hop full processing and improving the system's resource utilization efficiency.

[0692] 10.6 Compatible Bridge Module

[0693] In some implementations, the compatibility bridging module is used to map, encapsulate, bridge, or index the spatial Internet address vector, at least some fields in the original field set, spatial hash field, continuous residual field, medium parameter field, reference frame version field, or equivalent representation thereof, with an existing logical network address system, coordinate reference system, geospatial grid index system, or a combination thereof.

[0694] The function of the compatibility bridging module is not to replace the native address objects of the spatial Internet with the existing system, but to enable the existing IPv6 network system, H3 / S2 index system, WGS-84 or local coordinate system to participate in the protocol interaction of the present invention as one of the input layer, bearer layer, bridging layer or index layer.

[0695] Therefore, in this invention, the existing system and the native protocols of the space Internet form a compatible bridging relationship, rather than a replacement relationship.

[0696] 10.7 Physical Semantic Interface Layer

[0697] In some implementations, the compatibility bridging module further includes a physical semantic interface layer. This physical semantic interface layer is located between the spatial internet address vector and existing logical network address systems, spatial grid index systems, coordinate reference systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems, and is used to perform interface-based expression processing of the spatial internet address vector and its related fields.

[0698] The physical semantic interface layer can convert physical space coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference frame version information, cross-media continuity residual information, spatial hash field, continuity residual field, medium parameter field or its equivalent representation into one or more of the following: field mapping results, interface metadata, bridging context object, index association object, control plane interface parameters, bearer plane interface parameters, session context parameters or routing metadata object.

[0699] In some implementations, the output relationship of the physical semantic interface layer can be represented as:

[0700]

[0701] in, Indicates time The interface expresses the result. Represents the spatial Internet address vector. This represents at least some of the fields in the original field set, or their equivalent representation. This indicates the current bridging context, session context, control plane state, bearer plane state, or a combination thereof. This represents the physical semantic interface conversion function.

[0702] The interface expression result It can be invoked, encapsulated, mapped, indexed, or bridged by existing logical network address systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems. Therefore, this invention can pinpoint the key interface conversion process from "physical semantics to network semantics / index semantics".

[0703] 10.8 Relationship between the Physical Semantic Interface Layer and the Existing System

[0704] In some implementations, the existing logical network address system includes the IPv6 address system, the IPv6 extension header system, the network layer message system, or equivalent systems; the spatial grid index system includes the H3 geometric index, the S2 geometric index, or other discrete spatial unit partitioning systems; and the coordinate reference system includes the WGS-84 coordinate system, the local coordinate system, or combinations thereof.

[0705] The role of the physical semantic interface layer is to enable the above system to call, encapsulate, map, bridge, or index the physical semantics carried by the spatial Internet address vector without changing the status of the spatial Internet address vector as a native protocol object.

[0706] Therefore, even if different systems use different hardware benchmarks, different bearer protocols, or different spatial indexing forms, as long as they involve converting physical spatial location, medium constraints, time phase, reference frame conditions, continuity residuals, or their equivalent expressions into network addressing semantics, control semantics, session semantics, bearer semantics, or indexing semantics, they can all be incorporated into the compatibility bridging mechanism of this invention through the physical semantic interface layer.

[0707] 10.9 Synergy with State Machines, Recovery, and Path Evaluation

[0708] In some implementations, the compatibility bridging module and physical semantic interface layer are not executed in isolation only in the final stage of the system, but can be linked with the spatial state machine module, path cost evaluation module, and continuity verification and resynchronization module.

[0709] For example, when the system needs to perform a break resynchronization, the physical semantic interface layer can call the recovery context, path state information, atomic binding relationship or other interface objects to participate in recovery assistance; when the path evaluation result, state machine feedback result or recovery judgment result changes, the interface expression result can also be updated synchronously to ensure that the external bearing system, control system and index system obtain consistent interpretation results.

[0710] Therefore, the physical semantic interface layer in this embodiment not only serves as a bridge, but also serves to express the protocol state to the outside world and maintain the consistency of the system context to the outside world.

[0711] 10.10 Technical Effects of this Embodiment

[0712] Through the above methods, this embodiment has at least the following technical effects:

[0713] Firstly, by unifying spatial information acquisition, dynamic seed synchronization, address generation, physical layer correction, path cost evaluation, cooperative routing selection, spatial state machine feedback, continuity verification, break resynchronization, and compatible bridging into the same system framework, this invention possesses a unified underlying protocol closed-loop capability.

[0714] Secondly, by supporting centralized and distributed deployment, and allowing highly stable physical reference benchmarks to be preferably concentrated in base stations, photonic gateways, edge nodes, or cloud-edge collaborative control platforms, while terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes perform local phase calculations, residual tracking, or limited synchronization recovery, the engineering deployability of this invention is enhanced.

[0715] Third, by outputting field mapping results, interface metadata, bridging context objects, index association objects, control plane interface parameters, bearer plane interface parameters, session context parameters, or routing metadata objects through the physical semantic interface layer, this invention maintains native spatial addressing capabilities while possessing compatibility and interaction capabilities with existing IPv6 network architectures, H3 / S2 spatial indexing systems, and coordinate reference systems.

[0716] Fourth, by linking the compatible bridging module with state machine feedback, path evaluation, and continuity recovery, the operability of progressive deployment and consistent maintenance between the space internet native protocol and existing networks and space infrastructure is improved.

[0717] This invention is particularly applicable to low-altitude unmanned systems, unmanned docks, mines, tunnels, underwater spaces, vehicle-mounted or ship-mounted space connections, and other private network scenarios with high obstruction, high dynamics, and high continuity requirements. Preferred application scenarios will be further described in subsequent embodiments.

[0718] In some implementations, the spatial internet address vector and physical semantic interface layer can also serve as a unified address representation and interface call basis, allowing different terminals, nodes, bearer systems, indexing systems, or control systems to perform extended access, compatible development, or collaborative calls around the same native address object.

[0719] 11. Preferred Application Scenarios and Examples

[0720] In some embodiments, the present invention is preferably applied to high-value private networks or extreme physical environment scenarios that require high spatial addressing accuracy, cross-media routing stability, continuous recovery capability, and compatibility with existing infrastructure. These scenarios may include low-altitude unmanned system collaboration scenarios, unmanned dock scenarios, mine or tunnel scenarios, underwater space scenarios, vehicle-mounted or shipborne space connection scenarios, digital asset mounting scenarios, accident physical tracing scenarios, or combinations thereof.

[0721] In low-altitude unmanned system collaborative scenarios, UAV swarms, low-altitude logistics platforms, inspection flight platforms, or other low-altitude mobile nodes can perform native addressing of target airspace units based on spatial internet address vectors, and perform candidate path sorting, path switching, path rejection, or path reselection based on medium parameter fields, phase time fields, and continuity residual fields. Due to the rapid changes in topology, complex occlusion relationships, and significant dynamic fluctuations in beam and medium conditions in the low-altitude environment, the non-fixed topology mapping, physical path cost evaluation, key node stage residual verification, and break resynchronization mechanism in this invention are beneficial for improving the stability and continuity of low-altitude collaborative routing.

[0722] In unmanned docks, mines, tunnels, underwater spaces, or other environments with high obstruction, high reflection, and high loss, traditional addressing and routing mechanisms that only address logical links are prone to problems such as spatial delivery mismatch, high path recovery costs, and difficulty in quickly recovering from continuity interruptions. This invention integrates physical spatial coordinates, medium parameters, vertical hierarchy, time phase, object fingerprint, reference frame version, and cross-medium continuity residual information into the spatial Internet address vector. It maintains physical continuity and spatial identity consistency through a highly stable physical reference benchmark, phased residual verification, and break resynchronization mechanisms, making it more suitable for deployment in such private network environments.

[0723] In vehicle-mounted or ship-mounted spatial connectivity scenarios, target spatial units can dynamically change as the vehicle, ship, or carrier platform moves continuously. The spatial internet address vector in this invention can natively represent dynamic spatial units and achieve stable spatial connectivity, content mounting, state synchronization, and compatible interaction with existing network architectures in mobile scenarios through cross-media collaborative routing, continuity inheritance, context recovery, and physical semantic interface layers.

[0724] In scenarios such as digital asset mounting, physical tracing of incidents, or embodied intelligent collaboration, this invention can establish atomic binding relationships through spatial Internet address vectors and medium parameter information, time phase information, continuity residual information, path status information, and recovery context information. This enables the address semantics, routing semantics, and recovery semantics of the target spatial unit to be interpreted, refreshed, invalidated, or recovered synchronously with its physical context, which is beneficial to improving the reliability of spatial object mounting, event tracing, and collaborative control.

[0725] It should be understood that the above application scenarios are merely preferred embodiments used to illustrate the applicability of the present invention in high-value private networks or extreme physical environments, and do not constitute a limitation on the scope of protection of the present invention. The present invention is applicable to any scenario involving native addressing of target physical space units, physical layer correction, path cost assessment, cross-media cooperative routing, continuity restoration, and compatibility with existing systems.

Claims

1. A non-fixed topology addressing, physical correction, and cooperative routing method for the space internet, characterized in that: Includes the following steps: S1. Obtain the original field set corresponding to the target physical space unit. The original field set includes at least physical space coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference frame version information, and cross-medium continuity residual information. S2. Based on the shared physical synchronization conditions, the sending end, receiving end, routing node, edge node or control node shall respectively deterministically derive dynamic seeds locally; S3. Perform non-fixed topology mapping on the original field set according to the topology descriptor and the dynamic seed to generate a spatial Internet address vector; S4. Based on the phase reference provided by the high-stability physical reference, perform physical layer coherent correction on at least one stage of the spatial Internet address vector in the generation, transmission, resolution, path evaluation, routing decision or continuity verification, and keep the phase time constraint of the spatial Internet address vector associated with the phase reference. S5. The routing node, edge node, or control node parses the medium parameter field, phase time field, and cross-medium continuity residual field in the spatial Internet address vector, and calculates the physical path cost based on at least two of the medium parameter field, phase time field, and cross-medium continuity residual field. S6. Based on the physical path cost, perform cooperative routing path selection, adaptive path switching, path rejection, or path reselection among at least two of the following: dielectric path, optical path, quantum path, terahertz path, free space optical path, reconfigurable smart surface reflection path, or other medium paths with different propagation parameters. S7. During the process of cooperative routing path selection, adaptive path switching, path rejection or path reselection, cross-media phase continuity inheritance and continuity verification are performed based on at least one of the phase time field, phase continuity fingerprint or cross-media continuity residual field in the spatial Internet address vector. S8. Perform survivability determination and conflict detection on the spatial Internet address vector based on the spatial state machine, and use the survivability determination result or conflict detection result as feedback input for the cooperative routing path selection, adaptive path switching, path rejection or path reselection. S9. In the event of continuous interruption, path switching failure, unverifiable path, or physical layer obstruction, perform break resynchronization based on the most recent valid residual summary within the preset recovery window, and trigger readdressing, link fallback, path reselection, state failure, or security lock when resynchronization fails. S10. Through the physical semantic interface layer, the spatial internet address vector, at least some fields in the original field set, or their equivalent representations are mapped, encapsulated, bridged, or indexed with the existing logical network address system, spatial grid index system, or coordinate reference system to achieve compatible interaction between the spatial internet protocol and the existing network protocol or spatial coordinate system. The physical semantic interface layer is used to convert physical spatial coordinate information, medium parameter information, vertical hierarchy information, time phase information, object fingerprint information, reference system version information, cross-medium continuity residual information, or their equivalent representations, into interface expression results that can be called by the existing system. The aforementioned compatible mapping, encapsulation, bridging, or indexing relationship does not change the original protocol status of the spatial internet address vector. The existing logical network address system, spatial grid index system, and coordinate reference system participate in protocol interaction as one of the input layer, bearer layer, bridging layer, or index layer.

2. The method according to claim 1, characterized in that, The spatial internet address vector is a 256-bit address vector used to uniformly carry one or more of the following fields: medium identifier field, spatial hash field, vertical hierarchy field, phase timestamp field, object fingerprint field, reference frame version field, continuity residual field, and topology descriptor field; wherein, the spatial internet address vector may include a static spatial code portion for characterizing relatively stable spatial semantics, and a dynamic offset fingerprint portion for characterizing phase, continuity residual, dynamic medium state, or path state.

3. The method according to claim 2, characterized in that, The topology descriptor field is used to indicate the arrangement order, segmentation method, field boundaries, interpretation relationship, or mapping template of the remaining fields in the spatial Internet address vector; the non-fixed topology mapping is a non-linear bijective mapping driven by the topology descriptor and the dynamic seed, which enables the spatial Internet address vector to have different field topology structures under different physical locations, time phases, media states, path states, or routing jump conditions, and can be consistently resolved by nodes with the same shared physical synchronization conditions.

4. The method according to claim 1, characterized in that, The shared physical synchronization conditions include at least one or more of the following: reference clock, reference time or reference phase reference, time slot identifier, beam identifier, reference system version information, phase summary information, physical feature entropy summary, medium state summary, and negotiation parameters; the dynamic seed is independently calculated locally by the transmitting end, receiving end, routing node, edge node, or control node according to the same input conditions, without being explicitly transmitted through ordinary network control signaling.

5. The method according to claim 1, characterized in that, The highly stable physical reference reference is used to provide a highly stable phase reference that meets preset requirements for spatial addressing accuracy, path switching accuracy, or continuous maintenance accuracy. It corrects at least one of the following in high-frequency, terahertz, or cross-medium transmission environments: phase noise, clock jitter, frequency doubling error, Doppler diffusion, changes in medium refractive index, or path switching phase deviation, through reference mapping, time-frequency locking, phase injection, synchronous reference distribution, electro-optic mapping, or equivalent methods. The highly stable physical reference reference is an optical-grade physical reference source. It can be provided by a centrally deployed reference source, a distributed reference network, a terminal-side reference source, an edge-side reference source, or a combination thereof, as long as it meets the preset requirements for spatial addressing accuracy, path switching accuracy, or continuous maintenance accuracy.

6. The method according to claim 1, characterized in that, The physical path cost is calculated based on one or more of the following in the spatial Internet address vector: medium parameter field, cross-medium continuity residual field, phase timestamp field, physical feature entropy summary, local link feedback, field strength feature, delay deviation, path loss, medium refractive index, Doppler feature, security level, energy consumption constraint, or routing resource occupancy status. The physical path cost is used to perform path sorting, path filtering, path switching triggering, path rejection, or path reselection on multiple candidate medium paths. The physical path cost can be implemented using explicit cost functions, weighted summation, threshold determination, rule matching, graph optimization, machine learning models, neural network scoring, policy network output, or equivalent forms. The calculation, residual verification, or path acceptability judgment of the physical path cost can be performed by ordinary nodes with lightweight processing, and staged residual verification, enhancement correction, or path acceptability judgment can be performed by edge nodes, medium switching nodes, candidate path filtering nodes, continuity anomaly nodes, or other key nodes.

7. The method according to claim 1 or 2, characterized in that, The physical spatial coordinate information, spatial hash field, reference system version field, or their equivalent representation can be generated from the WGS-84 coordinate system, local coordinate system, geospatial grid index system, spatial hash index system, or a combination thereof; the geospatial grid index system includes one or more of the H3 geometric index, S2 geometric index, or other discrete spatial unit partitioning systems, and can be used as the input field, spatial hash field, index field, or bridging field of the spatial Internet address vector.

8. The method according to claim 1, characterized in that, The physical semantic interface layer is used to convert the spatial Internet address vector, at least some fields in the original field set, the continuity residual field, the medium parameter field, or their equivalent representation into an interface expression result that can be called by existing logical network address systems, control message systems, session context systems, bearer message systems, routing metadata systems, or security credential systems, and to encapsulate, map, index, or bridge the interface expression result; the existing logical network address system includes the IPv6 address system, the IPv6 extension header system, the network layer message system, or their equivalent systems.

9. The method according to claim 1, characterized in that, The spatial internet address vector is atomically bound to medium parameter information, time phase information, cross-medium continuity residual information, path state information, recovery context information, or their equivalent representations. The atomic binding relationship is used to ensure that the address vector maintains synchronous interpretation, synchronous refresh, synchronous failure, or synchronous recovery with its corresponding physical context during path evaluation, path selection, path switching, path rejection, path reselection, continuity verification, or breakage resynchronization.

10. A non-fixed topology addressing, physical correction, and cooperative routing system for the space internet, characterized in that: include: The spatial information acquisition module is used to obtain the original field set corresponding to the target physical space unit; The dynamic seed synchronization module is used to deterministically derive dynamic seeds locally based on shared physical synchronization conditions; The address generation module is used to perform non-fixed topology mapping on the original set of fields based on the topology descriptor and dynamic seed to generate spatial Internet address vectors. The physical layer correction module is used to perform coherent correction on the spatial Internet address vector, routing path or cross-media transmission process based on a highly stable physical reference. The path cost evaluation module is used to parse the medium parameter field, phase time field, cross-medium continuity residual field or their equivalent representation in the spatial Internet address vector, and to calculate the physical path cost. The cooperative routing decision module is used to perform cooperative routing path selection, adaptive path switching, path rejection, or path reselection among at least two different media paths based on the physical path cost. The spatial state machine module is used to perform S-TTL lifetime determination and S-CD collision detection, and output state feedback to the cooperative routing decision module. The continuity verification and resynchronization module is used to perform phase continuity fingerprint inheritance, continuity verification and break resynchronization when there is cross-media transmission, path switching, path rejection, continuity interruption or path unverifiable. A compatible bridging module is used to establish mapping, encapsulation, bridging, or index association between the spatial internet address vector, at least some fields in the original field set, spatial hash field, continuous residual field, medium parameter field, reference system version field, or their equivalent representation, and an existing logical network address system, coordinate reference system, geospatial grid index system, or a combination thereof, through a physical semantic interface layer; wherein, the physical semantic interface layer is used to output one or more of the following: field mapping results, interface metadata, bridging context object, index association object, control plane interface parameters, bearer plane interface parameters, session context parameters, or routing metadata object; The modules can be centrally deployed on a single device or distributed across terminals, base stations, photonic gateways, reconfigurable smart surface nodes, edge nodes, low-altitude communication nodes, vehicle-mounted communication nodes, unmanned system nodes, or cloud-edge collaborative control platforms. They work collaboratively around the same spatial internet address vector, shared physical synchronization conditions, and continuous residuals to achieve spatial internet address vector generation, physical correction, path cost assessment, collaborative routing selection, cross-media switching, status feedback, continuity verification, break resynchronization, and compatibility with existing address or spatial coordinate systems. The highly stable physical reference benchmark can be deployed on base stations, photonic gateways, edge nodes, or cloud-edge collaborative control platforms. Terminals, vehicle-mounted nodes, wearable nodes, or other resource-constrained nodes preferably perform local phase calculation, residual tracking, address resolution, or constrained synchronization recovery.

Images