Path Determination in Space-Air-Ground Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The high-speed movement of satellites in space-air-ground integrated networks results in dynamic and complex network topologies, making it challenging to determine optimal paths that satisfy time constraints in communication networks.
Innovation Solution
A path determination method that acquires network topology and time constraint conditions to identify a target path between nodes, using the constraint-based shortest path first (CSPF) algorithm to ensure valid time durations for links, and employs snapshot routing to manage dynamic network changes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If satellites move at high speed in space-air-ground integrated networks, then network coverage and service capability are improved, but network topology becomes dynamic and complex making path determination difficult
Solution Approach 1:
The system performs preliminary actions by establishing time constraint conditions and valid time durations for links before path determination. The network controller pre-calculates and announces time constraints to all nodes, enabling them to make informed routing decisions without dealing with the full complexity of dynamic topology changes in real-time.
Solution Approach 2:
The patent applies dynamics by introducing time-varying parameters to the network topology. Links are assigned valid time durations that reflect their dynamic nature due to satellite movement. The path determination algorithm dynamically selects paths based on current time and the valid time durations of links, adapting to the changing network topology.
2Ease of manufacture
If traditional routing algorithms are used in dynamic networks, then implementation is simple, but they cannot guarantee time constraint satisfaction for communication paths
Solution Approach 1:
The patent introduces time constraint conditions as an intermediary between the network topology and path selection. Instead of directly handling complex dynamic topology changes, the algorithm uses the intermediary time constraints to filter and evaluate candidate paths. This intermediary layer simplifies the decision-making process while ensuring time constraint satisfaction.
Solution Approach 2:
The patent changes parameters by introducing time-dependent variables to the routing algorithm. Links are characterized by valid time durations, and path selection depends on the current time relative to these durations. This parameter change transforms the routing problem from a static topology-based decision to a time-aware optimization problem.
3Reliability
If path determination considers dynamic topology changes, then path validity is improved, but computational complexity and determination time increase
Solution Approach 1:
The patent segments the path determination process into distinct phases: time constraint condition establishment, candidate path generation, and time constraint verification. This segmentation allows each phase to be optimized independently, reducing overall computational complexity while maintaining path validity through systematic evaluation.
Solution Approach 2:
The network controller performs preliminary actions by pre-calculating and announcing time constraint conditions to all nodes before path determination. This preliminary information availability enables local nodes to quickly evaluate paths without requiring complex real-time calculations, significantly reducing path determination time while ensuring validity.
Data Source
Figure 1~3
Figure 4~5A
Figure 5B~6
AI summary
Provided are a path determination method, and an electronic device and a storage medium. The path determination method comprises: acquiring a time constraint condition and a network topology of a communication network, wherein the network topology is used for indicating nodes and links in the communication network, and the links have valid time periods; and according to the time constraint condition, determining a target path between a first node and a second node from the network topology, wherein the time constraint condition is used for constraining the valid time period of a target link which forms the target path.