Routing method and device based on satellite processing

Abstract

The embodiment of the invention provides a routing method and device based on satellite processing, and the method employs a time slice division mechanism, and constructs a dynamic network topology structure according to a satellite constellation operation period and a link building rule. And the gateway station uploads the corresponding relation data of the time slice and the network topology to the satellite node for storage in advance. And after the satellite node receives the data, based on the network topology corresponding to the current time slice, the shortest path algorithm is adopted to realize autonomous routing calculation, and a next hop forwarding node is determined. And ensuring that the data is transmitted to the target node along the optimal path through a dynamic routing recalculation mechanism of the relay node. According to the method, the defects of the traditional technology in the aspects of routing real-time performance, topology management, on-satellite processing and the like are effectively overcome, and the performance of a satellite communication network is remarkably improved.

Description

Technical Field

[0001] The present application relates to the field of data processing, and in particular to a routing method and device based on on-board processing. Background Art

[0002] The existing on-board routing methods have obvious shortcomings. Traditional systems mainly rely on ground control centers for routing calculations and forwarding decisions, which have problems such as large communication delays and poor real-time performance, and are difficult to adapt to the dynamic changes of satellite networks.

[0003] In addition, existing technologies have bottlenecks in network topology management. Most systems fail to effectively use satellite operation rules for topology prediction and lack a refined division of time slices, resulting in low accuracy and efficiency in routing decisions.

[0004] The existing system has technical shortcomings in onboard routing processing. The lack of a distributed routing calculation mechanism makes it difficult to achieve autonomous decision-making capabilities of satellite nodes, affecting network reliability and communication efficiency. Solving these problems is of great significance to improving the performance of satellite communication networks. Summary of the invention

[0005] In response to the problems in the prior art, the present application provides a routing method and device based on on-board processing, which can effectively solve the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improve the performance of satellite communication networks.

[0006] In order to solve at least one of the above problems, the present application provides the following technical solutions: In a first aspect, the present application provides a routing method based on on-board processing, comprising: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication state. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database; When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0007] Further, the method further includes: the gateway station calculates the distance change rate and the angle change rate between adjacent satellite nodes according to the orbital parameters of the satellite constellation, sets the maximum allowable change rate according to the inter-satellite link establishment rule, divides the time period in which the distance change rate and the angle change rate of adjacent satellite nodes in the orbital period are both less than the maximum allowable change rate into the time slice, and the gateway station performs timestamp encoding on the time slice; The gateway calculates the three-dimensional spatial position coordinates of each satellite node in each time slice based on an inertial coordinate system, determines whether an adjacent satellite node can establish an inter-satellite link according to the communication range and antenna pointing of the satellite node, uses the satellite node as a network node, uses the establishable inter-satellite link as a network edge, calculates the communication distance of the inter-satellite link as a link weight based on the position coordinates of the satellite node, and combines the network nodes, the network edges and the link weights to construct the network topology structure.

[0008] Furthermore, it also includes: the gateway station establishes a mapping relationship between the identification information of each time slice and the corresponding network topology structure, the mapping relationship includes the start and end time of the time slice, the spatial location information of the network node, the connection state of the network edge and the link weight, the gateway station encodes the mapping relationship data in packets according to the satellite-to-ground communication protocol, and sends the encoded data packet to the satellite node through the uplink established between the ground gateway station and the satellite node; The satellite node decodes the data packet after receiving it, extracts the mapping relationship between the time slice and the network topology structure, creates a time index table and a topology structure table in the topology database, writes the time slice information into the time index table, writes the network topology structure into the topology structure table, and establishes an association relationship between the time index table and the topology structure table.

[0009] Furthermore, it also includes: the satellite node obtains the current world coordinated time according to the onboard clock, converts the world coordinated time into the orbital operation time of the satellite constellation, the satellite node retrieves the time range of the orbital operation time in the time index table, extracts the corresponding time slice identification information, and the satellite node combines the time slice identification information with the source node identification and the target node identification in the data packet for encoding; The satellite node queries the topology structure table in the topology database according to the time slice identification information, reads the network topology structure corresponding to the time slice, and the satellite node extracts the spatial location information of the network node, the connection status of the network edge and the link weight from the network topology structure, and generates an adjacency matrix containing node connection relationships and a weight matrix containing link communication costs.

[0010] Furthermore, it also includes: the satellite node determines all reachable paths between the source node and the target node according to the adjacency matrix, calculates the sum of the weight matrix elements corresponding to the network edges passed by each of the paths as the path cost, the satellite node determines the path with the minimum path cost as the routing path based on the Dijkstra shortest path algorithm, and the satellite node extracts the next network node directly connected to the current node from the routing path as the next hop node; The satellite node encapsulates the target node identifier of the data, the routing path information and the service data according to the inter-satellite communication protocol according to the inter-satellite link port number corresponding to the next hop node in the adjacency matrix, the satellite node establishes a communication link with the next hop node through the inter-satellite link port, and the satellite node sends the encapsulated data packet to the next hop node through the communication link.

[0011] Furthermore, the method further includes: the next hop node decapsulates the data packet after receiving it, extracts the target node identifier and the original routing path information in the data packet, the next hop node obtains the current world coordinated time and converts it into orbital operation time, the next hop node queries the corresponding time slice from the topology database according to the orbital operation time, reads the network topology structure corresponding to the time slice and generates a new adjacency matrix and weight matrix; The next hop node uses itself as a new source node, and calculates all reachable paths to the target node based on the new adjacency matrix and the new weight matrix. The next hop node compares the overlap between each reachable path and the original routing path, and preferentially selects a path with a higher overlap with the original routing path as the new routing path under the condition that the path costs are similar.

[0012] Furthermore, the method further comprises: the next hop node extracts the network node directly connected to the current node from the new routing path as the new next hop node, the next hop node checks the intersatellite link communication state of the new next hop node, and if the intersatellite link communication state is normal, the next hop node updates the routing path information in the data packet, and sends the updated data packet to the new next hop node through the corresponding intersatellite link port; After receiving the data packet, the new next-hop node determines whether it is the target node. If it is not the target node, it repeats the process of recalculating the routing path and forwarding data. If it is the target node, it parses the business data in the data packet to complete the data transmission. The target node returns confirmation information of the completion of the data transmission to the source node.

[0013] In a second aspect, the present application provides a routing device based on on-board processing, including: A network topology module, used for the gateway station to divide the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rules, and to build a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status, wherein the network topology structure includes the connection relationship and link weight between the satellite nodes, the gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node, and the satellite node stores the received corresponding relationship data in the topology database; a path determination module, configured to, when the satellite node receives data to be forwarded, obtain the time slice at the current moment, read the network topology structure corresponding to the current moment from the topology database, calculate the routing path of the data based on the shortest path algorithm, the routing path includes a sequence of all relay nodes from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through an intersatellite link established with the next hop node; The inter-satellite routing module is used to recalculate the routing path of the data based on the network topology structure stored in the topology database after the next hop node receives the data. The next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0014] In a third aspect, the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the routing method based on on-board processing when executing the program.

[0015] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the routing method based on on-board processing.

[0016] In a fifth aspect, the present application provides a computer program product, including a computer program / instruction, which implements the steps of the routing method based on on-board processing when executed by a processor.

[0017] It can be seen from the above technical solution that the present application provides a routing method and device based on on-board processing, which adopts a time slice division mechanism to build a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node for storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice, and determines the next-hop forwarding node. The dynamic routing recalculation mechanism of the relay node is used to ensure that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of satellite communication networks. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0019] Figure 1 Schematic diagram of the flow of the routing method based on on-board processing in an embodiment of the present application; Figure 2 is a structural diagram of a routing device based on on-board processing in an embodiment of the present application; Figure 3 It is a schematic diagram of the structure of an electronic device in an embodiment of the present application.

[0020] Reference numerals: Electronic device 9600, central processing unit 9100, memory 9140, communication module 9110, input unit 9120, audio processor 9130, display 9160, power supply 9170, buffer memory 9141, application / function storage unit 9142, data storage unit 9143, driver program storage unit 9144, antenna 9111, speaker 9131, microphone 9132. DETAILED DESCRIPTION

[0021] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0022] The acquisition, storage, use, and processing of data in the technical solution of this application comply with the relevant provisions of national laws and regulations.

[0023] Taking into account the problems existing in the prior art, the present application provides a routing method and device based on on-board processing, which adopts a time slice division mechanism to build a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node for storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice, and determines the next-hop forwarding node. The dynamic routing recalculation mechanism of the relay node is used to ensure that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of satellite communication networks.

[0024] In order to effectively solve the shortcomings of traditional technologies in terms of routing real-time, topology management and on-board processing, and significantly improve the performance of satellite communication networks, the present application provides an embodiment of a routing method based on on-board processing, see Figure 1 The routing method based on on-board processing specifically includes the following contents: Step S101: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database. Optionally, this embodiment innovatively designs a network topology management mechanism based on time slicing in view of the dynamic characteristics of the satellite constellation network. The gateway station first obtains the orbital elements and operating parameters of the satellite constellation, including key parameters such as orbital inclination, right ascension of the ascending node, and mean anomaly. The motion period of the satellite node is calculated based on the Kepler orbit equation. For a typical low-orbit satellite constellation, the orbital period is about 90-100 minutes. The gateway station uses an adaptive time window partitioning method to determine the granularity of the time slice based on the characteristics of the orbital period.

[0025] In the process of time slicing division, this embodiment focuses on the establishment constraints of inter-satellite links. The distance change rate ΔD and the angle change rate ΔA between adjacent satellite nodes are calculated by the following formula: ΔD = |d(t+Δt) - d(t)| / Δt, ΔA = |θ(t+Δt) - θ(t)| / Δt, Where d(t) represents the distance between nodes at time t, θ(t) represents the angle at time t, and Δt is the sampling interval. The gateway sets the maximum allowable change rate threshold based on the tracking capability of the satellite antenna and divides the time period with a change rate less than the threshold into stable time slices.

[0026] This embodiment realizes accurate satellite position calculation. Based on the J2000 inertial coordinate system, the gateway station solves the satellite motion equation by numerical integration method. Considering the influence of perturbation factors such as the earth's gravitational field and atmospheric resistance, the three-dimensional position coordinates of each satellite node in each time slice are calculated. At the same time, the gateway station receives the satellite's telemetry data in real time, corrects the orbit prediction position, and ensures the accuracy of the position information.

[0027] This embodiment constructs a complete network topology. The gateway first calculates the effective communication range based on the communication equipment parameters of the satellite node, including antenna beam width, transmission power, and receiving sensitivity. Combined with the satellite attitude information and antenna pointing, it determines whether the link establishment conditions are met between adjacent nodes. For node pairs that can establish intersatellite links, the gateway calculates the link communication distance, and considers factors such as space loss and Doppler effect to evaluate the link quality index as a weight value.

[0028] This embodiment innovatively designs the organizational structure of topological data. The gateway organizes the identification information, start and end time of each time slice and the corresponding network topological data into a structured mapping relationship. The network topology is stored in a graph data structure, and the node attributes include the location coordinates and device status, and the edge attributes include the link weight and port configuration. The gateway compresses and encodes the topological data to reduce the amount of uploaded data.

[0029] This embodiment optimizes the data uplink mechanism. The gateway decomposes the topology data into data packets suitable for uplink transmission according to the satellite-to-ground communication protocol requirements. Each data packet contains a header, a payload, and verification information. The header carries a time slice identifier and a sequence number. The gateway ensures the complete delivery of the data packet through a reliable transmission mechanism and retransmits it when necessary.

[0030] This embodiment realizes efficient data storage management. After receiving the uploaded data, the satellite node first performs data integrity check and decoding. A topological database is established in the onboard memory, and the data is organized in a combination of time index and space index. The database supports fast time range query and node relationship query, which is convenient for subsequent routing calculation.

[0031] Through the above technical innovations, this embodiment effectively solves the problem of unstable routing caused by dynamic changes in the topology structure in traditional satellite networks. In practical applications, this solution can accurately grasp the evolution law of network topology and provide a reliable data basis for routing calculation. Especially in the scenario of large-scale satellite constellation networking, the computational burden of topology maintenance is significantly reduced through the time slice management mechanism.

[0032] The innovation of this embodiment is mainly reflected in the time slice division strategy, topology construction method and data management mechanism. Through sophisticated spatiotemporal modeling and efficient data organization, dynamic management of satellite network topology is achieved. This solution provides strong support for improving the service quality of satellite communication networks and has important practical value in the construction of space information networks.

[0033] Step S102: When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; Optionally, this embodiment innovatively implements a dynamic routing control mechanism based on time slicing. After receiving the data packet, the satellite node first obtains the precise Universal Coordinated Time (UTC) through the onboard atomic clock. Considering the motion characteristics of the satellite node, the UTC is converted into the orbital operation time of the satellite constellation using the normalization formula: T = (UTC - T0) mod P, Where T0 is the initial epoch time of the constellation, P is the orbital period, and the calculation result T represents the current time in the orbital period.

[0034] This embodiment designs an efficient time slice retrieval method. The satellite node uses a binary search algorithm in the time index table of the topological database to quickly locate the time slice to which the current moment belongs. The index table is organized in chronological order, and each entry contains a slice identifier, start and end time, and a status mark. By comparing the orbital operation time with the slice time range, the currently active time slice is determined.

[0035] This embodiment optimizes the reading strategy of topological data. Based on the time slice identifier, the satellite node queries the topological structure table to obtain the corresponding network topology information. To improve query efficiency, the topological data adopts a storage structure that combines the adjacency list and the adjacency matrix. The adjacency table records the connection relationship of the nodes, which is convenient for traversing adjacent nodes; the adjacency matrix stores the link weights and supports fast path calculation.

[0036] This embodiment implements a dynamic weight calculation method. The link weight W is calculated by a comprehensive evaluation function: W = α D +β Q + γ L , Where D is the link distance, Q is the link quality index, L is the load level, and α, β, and γ are weight coefficients. This method not only takes into account the physical transmission delay, but also reflects the real-time status of the link, and can guide the routing selection to avoid congested links.

[0037] This embodiment constructs an improved shortest path algorithm. Based on the Dijkstra algorithm framework, a heuristic search strategy is introduced to give priority to expanding paths that are more likely to lead to the target node. The algorithm maintains a priority queue, and the priority of the queue element is determined by the path cost and the heuristic value. The pruning mechanism is used to reduce the search of invalid paths and improve the computing efficiency.

[0038] This embodiment innovatively designs a path evaluation mechanism. For the candidate paths searched, the system evaluates them from multiple dimensions. First, the reliability of the path is checked to ensure that all relay nodes are currently in normal working order. Then, the stability of the path is analyzed to evaluate whether the path will be disconnected due to node movement in the current time slice. Finally, load balancing factors are considered to avoid excessive overlap between the path and existing services.

[0039] This embodiment optimizes the next hop selection strategy. The next network node directly connected to the current node is extracted from the calculated optimal routing path. The satellite node checks the status of the intersatellite link between the node and verifies whether the link has sufficient transmission capacity. If the current link is unavailable, the backup path selection mechanism is started to select a new next hop node from the suboptimal path.

[0040] This embodiment implements a reliable data forwarding mechanism. The data packet encapsulation adopts a hierarchical structure, and the packet header carries the target node identifier, routing path information, and service quality requirements. During the forwarding process, the data flow is controlled by a sliding window protocol, and the window size is dynamically adjusted according to the link quality. At the same time, a selective retransmission mechanism is implemented, which only retransmits lost data packets to improve transmission efficiency.

[0041] Through the above technical innovations, this embodiment effectively solves the problems of complex path calculation and poor real-time performance in traditional satellite routing. In practical applications, this solution can quickly respond to changes in network topology and calculate stable and reliable routing paths. Especially in scenarios with large data traffic and changeable network status, intelligent routing control significantly improves the success rate of data transmission.

[0042] The innovation of this embodiment is mainly reflected in time slice management, path algorithm optimization and forwarding control. Through a series of technical innovations, efficient routing of satellite network data is achieved. This solution provides strong support for improving the service quality of satellite communication networks and has important application value in the field of space information networks. The deployment of this technology has significantly improved the service experience of satellite communications and laid a technical foundation for the construction of an integrated space-ground network.

[0043] Step S103: After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0044] Optionally, after the satellite node receives the data packet to be forwarded, the present embodiment first performs data packet parsing. The parsing process follows the intersatellite communication protocol specification and extracts routing control information from the data packet, including the target node identifier, the original routing path sequence and the service data. The integrity of the data packet is ensured by a cyclic redundancy check, and the source node is required to retransmit the data packet that fails the check.

[0045] This embodiment innovatively implements a real-time routing recalculation mechanism. The satellite node obtains accurate world coordinated time based on the onboard atomic clock and converts it into constellation running time through orbital parameters. The time cost Tc of routing calculation is estimated by the following formula: Tc = Tp + Tr + Ts, Where Tp is the path search time, Tr is the routing table update time, and Ts is the state synchronization time. By evaluating the computational overhead, it is ensured that the routing update can be completed within the current time slice.

[0046] This embodiment optimizes the query efficiency of topological data. The satellite node retrieves the corresponding time slice identifier in the topological database according to the current running time. A multi-level cache mechanism is used to accelerate data access, and the topological data of the hot time slice is cached in a fast memory. At the same time, a data pre-fetch mechanism is implemented to load the topological information of the next time slice in advance to avoid query delays.

[0047] This embodiment designs an efficient path calculation strategy. The network structure information read from the topology database is converted into the form of an adjacency matrix and a weight matrix. To reduce the computational complexity, a pruning algorithm is used to preprocess the topology graph and delete unreachable links and low-quality links. In the process of searching for feasible paths, paths with high overlap with the original routing path are given priority to reduce routing oscillation.

[0048] This embodiment implements an innovative routing decision mechanism. In the calculation of path cost, factors such as link communication distance, channel quality and node load are comprehensively considered. The optimal path is quickly located through a heuristic search method. For multiple candidate paths with similar path costs, the path with the highest overlap with the original routing path is selected as the new forwarding path.

[0049] This embodiment builds a reliable data forwarding process. After determining the new routing path, the satellite node extracts the next hop node information from the path sequence. Before forwarding, the link status with the next hop node is checked, including indicators such as carrier lock status, signal-to-noise ratio, and bit error rate. Data forwarding is performed only when the link status meets the communication requirements.

[0050] This embodiment optimizes the access control of the intersatellite link. The satellite node updates the routing information in the data packet according to the new routing path and sends the data through the corresponding intersatellite link port. The transmission process adopts adaptive power control and rate control, and dynamically adjusts the transmission parameters according to the link quality. At the same time, link traffic management is implemented to prevent single link overload.

[0051] This embodiment designs a complete transmission confirmation mechanism. After receiving the data packet, the target node first determines whether its own identity matches the target node identity. After a successful match, the service data is parsed and a confirmation message of the transmission completion is returned to the source node. The confirmation message is transmitted in the reverse direction along the original routing path to ensure end-to-end reliable transmission.

[0052] Through the above technical innovations, this embodiment effectively solves the problems of delayed routing updates and low transmission reliability in traditional satellite networks. In practical applications, this solution can timely perceive changes in network topology and dynamically optimize data transmission paths. Especially in scenarios with large constellations and heavy business loads, the network service quality is significantly improved through distributed routing calculation and intelligent forwarding control.

[0053] The main innovations of this embodiment are reflected in the routing recalculation strategy, path optimization method and transmission control mechanism. Through a series of algorithm optimization and process improvement, efficient and reliable transmission of satellite network data is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the data transmission efficiency and service quality of satellite communication networks, laying an important foundation for the integrated space-ground information network.

[0054] From the above description, it can be seen that the routing method based on on-board processing provided in the embodiment of the present application can construct a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules by adopting a time slice division mechanism. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node for storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice to determine the next-hop forwarding node. The dynamic routing recalculation mechanism of the relay node is used to ensure that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in terms of routing real-time, topology management and on-board processing, and significantly improves the performance of satellite communication networks.

[0055] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S201: the gateway calculates the distance change rate and the angle change rate between adjacent satellite nodes according to the orbital parameters of the satellite constellation, sets the maximum allowable change rate according to the inter-satellite link establishment rule, divides the time period in which the distance change rate and the angle change rate of adjacent satellite nodes in the orbital period are both less than the maximum allowable change rate as the time slice, and the gateway performs timestamp encoding on the time slice; Step S202: The gateway calculates the three-dimensional spatial position coordinates of each satellite node in each time slice based on the inertial coordinate system, determines whether adjacent satellite nodes can establish inter-satellite links according to the communication range and antenna pointing of the satellite nodes, regards the satellite nodes as network nodes, regards the inter-satellite links that can be established as network edges, calculates the communication distance of the inter-satellite links as link weights based on the position coordinates of the satellite nodes, and combines the network nodes, the network edges and the link weights to construct the network topology structure.

[0056] Optionally, this embodiment innovatively implements a spatiotemporal modeling method for a satellite constellation network. The gateway first obtains the orbital elements of the constellation, including parameters such as the semi-major axis, eccentricity, inclination, and right ascension of the ascending node. Based on the SGP4 orbit prediction model, the position and velocity vector of the satellite node are calculated. The dynamic relationship between adjacent nodes is characterized by the distance change rate ΔD and the angle change rate ΔA: ΔD = |V1 - V2|·R / |R|, Where V1 and V2 are node velocity vectors, and R is the position vector between nodes. The angle change rate is calculated by the time derivative of the relative attitude angle between nodes.

[0057] This embodiment optimizes the time slice division strategy. According to the communication characteristics of the intersatellite link, the link establishment constraint conditions are established. The antenna tracking capability determines the maximum allowable angle change rate, and the Doppler compensation capability of the communication equipment limits the maximum allowable distance change rate. Based on these constraints, the gateway searches for the time interval that meets the link establishment conditions within the orbital period and divides it into discrete time slices.

[0058] This embodiment designs an efficient timestamp encoding method. Each time slice adopts a hierarchical encoding structure, including orbital period number, slice number and time range information. The encoding format design takes into account the characteristics of constellation operation and supports fast time positioning and range query. At the same time, it realizes compressed storage of the code and reduces data transmission overhead.

[0059] This embodiment realizes an accurate space positioning mechanism. In the J2000 inertial coordinate system, the gateway calculates the three-dimensional position of the satellite node through the orbital dynamics equation. The influence of the earth's non-spherical gravitational field, solar light pressure, atmospheric drag and other perturbations is considered to improve the orbit prediction accuracy. At the same time, the positioning data of the satellite-borne GPS receiver is used to perform orbit correction.

[0060] This embodiment constructs a complete link visibility analysis method. Based on the position coordinates of the satellite nodes, the line of sight vector between the nodes is calculated. Combined with the satellite platform attitude and antenna beam characteristics, it is determined whether the adjacent nodes meet the communication conditions. Link visibility analysis takes into account the influence of environmental factors such as earth occlusion and solar interference.

[0061] This embodiment optimizes the network topology construction process. Satellite nodes that meet the communication conditions are mapped to network nodes, and inter-satellite links that can be established are mapped to network edges. Node attributes include information such as location coordinates and device status, and edge attributes include parameters such as communication distance and link quality. The connectivity and robustness of the network are analyzed through graph theory methods.

[0062] This embodiment innovatively designs a link weight calculation method. Based on the communication distance D between nodes and the link quality index Q, the comprehensive weight W is calculated by the following formula: W = α D +β Q, Where α and β are dynamic adjustment coefficients. The communication distance affects the transmission delay, and the link quality reflects the communication reliability. The weight calculation fully considers the physical characteristics and communication performance of the intersatellite link.

[0063] This embodiment implements a dynamic update mechanism for the network topology. The gateway monitors the status changes of satellite nodes in real time, including position deviation, equipment failure, etc. When the node status changes significantly, the link visibility and communication performance of the affected area are re-evaluated and the network topology is updated.

[0064] Through the above technical innovations, this embodiment effectively solves the problems of unstable topology and difficulty in link establishment in traditional satellite networks. In practical applications, this solution can accurately describe the dynamic evolution of network topology and provide a reliable decision-making basis for routing control. Especially in large-scale constellation networking scenarios, through precise spatiotemporal modeling and topology management, the connectivity and service quality of the network are significantly improved.

[0065] The innovation of this embodiment is mainly reflected in the spatiotemporal modeling method, link analysis strategy and topology management mechanism. Through a series of algorithm optimization and process improvement, efficient management of satellite network topology is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the networking efficiency and service performance of satellite communication networks, laying a key foundation for the construction of space-ground integrated networks.

[0066] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S301: the gateway establishes a mapping relationship between the identification information of each time slice and the corresponding network topology structure, wherein the mapping relationship includes the start and end time of the time slice, the spatial location information of the network node, the connection state of the network edge and the link weight, and the gateway encodes the mapping relationship data in packets according to the satellite-to-ground communication protocol, and sends the encoded data packet to the satellite node through the uplink established between the ground gateway and the satellite node; Step S302: After receiving the data packet, the satellite node decodes it and extracts the mapping relationship between the time slice and the network topology structure. The satellite node creates a time index table and a topology structure table in the topology database, writes the time slice information into the time index table, writes the network topology structure into the topology structure table, and establishes an association relationship between the time index table and the topology structure table.

[0067] Optionally, this embodiment designs an innovative topology data organization structure. The gateway establishes a bidirectional mapping between the identification information of each time slice and the network topology, and uses a hierarchical structure to store the topology information. The organization structure of the mapping relationship table R is expressed as follows: R = {T, N, E, W} , Where T is the time slice descriptor, including the start and end time and validity period; N is the node attribute set, including location coordinates and status marks; E is the edge set, describing the connection relationship between nodes; W is the weight matrix, storing link communication performance parameters.

[0068] This embodiment optimizes the data encoding mechanism. The gateway converts the mapping relationship data into a binary stream based on the satellite-to-ground communication protocol requirements. The encoding adopts the TLV (type-length-value) format to ensure the scalability of the data structure. For large topological data, hierarchical compression encoding is implemented to reduce transmission overhead. At the same time, a check field is added to the data packet to ensure transmission reliability.

[0069] This embodiment implements an efficient data packetization strategy. Considering the bandwidth limitation and transmission delay of the uplink, the encoded data is divided into data packets of appropriate size. Each data packet contains a common header and a payload part. The header carries the packet sequence number, timestamp and checksum information. The data transmission flow is controlled by the sliding window protocol to ensure that the receiving end can correctly reassemble the data.

[0070] This embodiment builds a reliable uplink transmission mechanism. The gateway calculates the best communication period in advance based on the satellite transit forecast. During the link establishment process, adaptive power control and coding modulation are used to ensure signal quality. The transmission process implements an automatic retransmission request mechanism to retransmit lost or erroneous data packets.

[0071] This embodiment innovatively designs a data decoding process. After receiving a data packet, the satellite node first performs integrity check and reassembly. The decoding process adopts a state machine design to parse the packet header information, time slice data, and topology data in sequence. The decoding result is converted into a data structure that is easy to store and query.

[0072] This embodiment optimizes the database design scheme. The topology database adopts a dual-table structure. The time index table stores slice information, and the topology structure table stores the network structure. The index table is organized in chronological order and supports fast range queries. The structure table adopts a graph database model to efficiently store node relationships and link attributes. The two tables are associated through slice identifiers.

[0073] This embodiment implements an efficient data writing mechanism. The satellite node writes the decoded time slice information into the index table, and each record contains a slice identifier, start and end time, and status mark. When the topology structure data is written into the structure table, a batch insertion strategy is used to improve efficiency. The writing process implements concurrency control to ensure data consistency.

[0074] This embodiment designs a complete data verification process. After the database is written, the system automatically performs a consistency check. Verify the continuity of the time slice, check the integrity of the topology structure, and ensure that the association between the index table and the structure table is correct. For detected abnormal data, request retransmission from the signal gateway.

[0075] This embodiment builds a dual-table association query mechanism. A mapping relationship is established between the two tables through time slice identifiers to support efficient joint queries. The query optimizer can select the optimal query path according to the specific scenario and balance query performance and resource consumption.

[0076] Through the above technical innovations, this embodiment effectively solves the problems of complex topology data management and low query efficiency in traditional satellite networks. In practical applications, this solution can efficiently store and manage network topology information and provide fast data support for routing calculations. Especially in scenarios where the network scale is large and the topology changes frequently, the system response speed is significantly improved through optimized data organization and management mechanisms.

[0077] The innovation of this embodiment is mainly reflected in data structure design, transmission control and storage management. Through a series of optimization designs, efficient transmission and management of satellite network topology data is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the data processing efficiency of satellite communication networks and lays an important foundation for the integrated space-ground network.

[0078] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S401: the satellite node obtains the current UTC according to the onboard clock, converts the UTC into the orbital operation time of the satellite constellation, the satellite node retrieves the time range of the orbital operation time in the time index table, extracts the corresponding time slice identification information, and the satellite node combines and encodes the time slice identification information with the source node identification and the target node identification in the data packet; Step S402: The satellite node queries the topology structure table in the topology database according to the time slice identification information, and reads the network topology structure corresponding to the time slice. The satellite node extracts the spatial location information of the network node, the connection status of the network edge and the link weight from the network topology structure, and generates an adjacency matrix containing node connection relationships and a weight matrix containing link communication costs.

[0079] Optionally, this embodiment designs an accurate time management mechanism. The rubidium atomic clock carried by the satellite node provides a highly stable time reference, which is regularly calibrated through the GPS timing system. The calculation formula for converting the Universal Coordinated Time UTC to the orbital operation time T is: T = (UTC - T0) mod P + ΔT , Where T0 is the initial epoch time of the constellation, P is the orbital period, and ΔT is the time correction term, which includes the influence of orbital perturbations and relativistic effects.

[0080] This embodiment optimizes the time retrieval strategy. The track running time is quickly located in the time index table through a binary search algorithm. The index table is organized in an interval tree structure to support efficient range queries. Each index item contains the start and end time of the time slice, a validity mark, and an access counter, which facilitates cache optimization.

[0081] This embodiment implements an innovative identification coding method. The combined coding C of the time slice identification and the source and target node identification is constructed in the following manner: C = f(Ts, Ns, Nd) , Where Ts is the time slice identifier, Ns is the source node identifier, Nd is the target node identifier, and f is the encoding function. The encoding structure ensures the uniqueness of the retrieval key and supports partial match queries.

[0082] This embodiment constructs an efficient topology query mechanism. The corresponding network structure is retrieved from the topology database according to the combined code. The query process adopts a multi-level cache strategy, and frequently accessed topology data is cached in a fast memory. At the same time, a pre-fetch mechanism is implemented to load the topology information of the next time slice in advance.

[0083] This embodiment optimizes the data extraction process. It extracts information such as node location coordinates, connection status, and link weight from the topology structure. The location information is represented by an inertial coordinate system, the connection status includes link availability and port configuration, and the link weight reflects the communication performance index. The data extraction process implements parallel processing to improve processing efficiency.

[0084] This embodiment innovatively designs a matrix generation method. The adjacency matrix A describes the connection relationship between nodes: A[i,j] = {1, there is a link 0 between nodes i and j, other cases}, The weight matrix W stores the link communication cost: W[i,j] = {w, link weight between nodes i and j∞, other cases}, The matrix uses a sparse storage format to reduce storage overhead.

[0085] This embodiment implements a dynamic matrix update mechanism. When a change in network topology is detected, the system quickly updates the affected matrix elements. The update process uses an incremental method to modify only the changed parts. At the same time, the consistency of the matrix is ​​maintained to ensure that the correspondence between adjacency relationships and weight values ​​is correct.

[0086] This embodiment designs a complete exception handling process. In the time retrieval and data extraction process, anomaly detection and fault tolerance processing are implemented. When timestamp anomalies, data missing, etc. occur, the system automatically triggers the repair mechanism. For unrecoverable anomalies, data retransmission is requested from the ground signal gateway.

[0087] Through the above technical innovations, this embodiment effectively solves the problems of slow topology data retrieval and low processing efficiency in traditional satellite networks. In practical applications, this solution can quickly and accurately obtain the current network status and provide real-time support for routing decisions. Especially in scenarios with large network scale and frequent topology changes, the optimized data processing mechanism significantly improves the system response speed.

[0088] The innovation of this embodiment is mainly reflected in time management, data retrieval and matrix generation. Through a series of algorithm optimization and process improvement, efficient processing of satellite network topology data is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the data processing efficiency of satellite communication networks and lays an important foundation for the integrated space-ground network.

[0089] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S501: the satellite node determines all reachable paths between the source node and the target node according to the adjacency matrix, calculates the sum of the weight matrix elements corresponding to the network edges passed by each path as the path cost, the satellite node determines the path with the minimum path cost as the routing path based on the Dijkstra shortest path algorithm, and the satellite node extracts the next network node directly connected to the current node from the routing path as the next hop node; Step S502: The satellite node encapsulates the target node identifier of the data, the routing path information and the service data according to the inter-satellite communication protocol according to the inter-satellite link port number corresponding to the next hop node in the adjacency matrix, and the satellite node establishes a communication link with the next hop node through the inter-satellite link port, and the satellite node sends the encapsulated data packet to the next hop node through the communication link.

[0090] Optionally, this embodiment innovatively designs a path search algorithm. Based on the network connectivity analysis of the adjacency matrix, an improved depth-first search method is used to explore all reachable paths. A pruning strategy is introduced in the path search process, and the search is terminated when the cost of the searched path exceeds the current optimal solution. The time complexity of the search algorithm is significantly improved through heuristic optimization.

[0091] This embodiment optimizes the path cost calculation method. The total path cost C is calculated by the following formula: C = Σ(Wi,j Ki,j), Where Wi,j is the link weight between adjacent nodes i,j on the path, and Ki,j is the correction coefficient. The correction coefficient takes into account dynamic factors such as link load and delay jitter, making the path selection more in line with actual communication needs.

[0092] This embodiment implements an improved Dijkstra algorithm. A bidirectional search strategy is introduced based on the traditional Dijkstra algorithm, and the search starts from the source node and the target node at the same time. The priority queue is implemented using a Fibonacci heap, which reduces the overhead of the update operation. The algorithm dynamically updates the shortest path estimate of the node in each iteration.

[0093] This embodiment builds an efficient routing selection mechanism. After determining the shortest path, the system analyzes the stability and reliability of the path. The lifetime of the path is evaluated through historical data to avoid selecting links that are about to fail. At the same time, load balancing factors are considered to prevent hot link congestion. When extracting the next hop node from the optimal path, the current state of the node is verified.

[0094] This embodiment designs a complete data encapsulation process. According to the intersatellite communication protocol specification, a layered data packet structure is constructed. The application layer encapsulates the service data, and the network layer adds routing control information, including the target node identifier, routing path sequence, and service quality requirements. The transport layer implements a reliable transmission mechanism, and the link layer handles physical transmission.

[0095] This embodiment optimizes the port management strategy. The link port number corresponding to the next hop node is obtained from the adjacency matrix, and the system maintains a port status table to record the working status, data throughput, and error rate of the port. Port allocation takes load balancing into consideration to avoid overloading a single port. At the same time, a port backup mechanism is implemented to support fault switching.

[0096] This embodiment implements a reliable link establishment process. Before establishing a communication link with the next hop node, a link status detection is first performed. The communication readiness status of both parties is confirmed by exchanging control messages. The link establishment adopts a three-way handshake mechanism to ensure that the parameter configurations of both communicating parties are consistent.

[0097] This embodiment builds an efficient data transmission mechanism. The data packet transmission process adopts a sliding window protocol, and the window size is dynamically adjusted according to the link quality. A selective retransmission mechanism is implemented to retransmit only the lost data packets. The link status is continuously monitored during the transmission process, and the transmission parameters are adjusted in time when the link quality is detected to be reduced.

[0098] Through the above technical innovations, this embodiment effectively solves the problems of unreasonable routing selection and unreliable data transmission in traditional satellite networks. In practical applications, this solution can quickly calculate the optimal routing path and ensure reliable data transmission. Especially in scenarios with heavy network load and changeable link status, the network service quality is significantly improved through optimized routing selection and transmission control.

[0099] The innovation of this embodiment is mainly reflected in path calculation, data encapsulation and transmission control. Through a series of algorithm optimization and mechanism improvement, efficient and reliable transmission of satellite network data is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the data transmission performance of satellite communication networks and lays an important foundation for the construction of integrated space-ground network.

[0100] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S601: After receiving the data packet, the next hop node decapsulates the data packet, extracts the target node identifier and the original routing path information in the data packet, obtains the current world coordinated time and converts it into orbital operation time, queries the corresponding time slice from the topology database according to the orbital operation time, reads the network topology structure corresponding to the time slice and generates a new adjacency matrix and weight matrix; Step S602: The next hop node uses itself as a new source node, and calculates all reachable paths to the target node based on the new adjacency matrix and the new weight matrix. The next hop node compares the degree of overlap between each reachable path and the original routing path, and preferentially selects the path with a higher degree of overlap with the original routing path as the new routing path under the condition that the path costs are similar.

[0101] Optionally, this embodiment innovatively implements a data packet decapsulation mechanism. After receiving the data packet, the next hop node parses it step by step according to the protocol layer structure. First, a link layer check is performed to ensure data integrity. The network layer extracts routing control information, including the target node identifier and the routing path sequence. The application layer obtains service data to prepare for subsequent processing.

[0102] This embodiment designs an accurate time synchronization method. The next-hop node obtains the world coordinated time through the satellite-borne atomic clock, and the time synchronization accuracy is evaluated by the following formula: ΔT = |TUTC - Tref| + δ, Where TUTC is the local time, Tref is the reference time, and δ is the drift correction term. The system regularly calibrates the atomic clock through GPS signals to ensure the accuracy of the time reference.

[0103] This embodiment optimizes the topological data query process. After converting the Universal Coordinated Time to orbital operation time, a cache-accelerated query strategy is adopted. A two-level cache structure is designed, and the topological data of the hotspot time slice is cached in a fast memory. The query process combines the principle of temporal locality to improve the cache hit rate.

[0104] This embodiment implements an efficient matrix generation method. Based on the queried network topology, a new adjacency matrix and a weight matrix are simultaneously constructed. The matrix generation adopts a parallel processing mechanism to make full use of hardware computing resources. At the same time, an incremental update strategy is introduced to recalculate only the matrix elements that have changed.

[0105] This embodiment constructs an innovative path calculation strategy. The current node is set as the new source node, and a bidirectional breadth-first search algorithm is used to explore all reachable paths. During the search process, a path cost table is maintained to record the cumulative cost of the discovered paths. The search space is reduced through a pruning strategy to improve computational efficiency.

[0106] This embodiment designs a path overlap evaluation method. The path overlap R is calculated by the following formula: R = Nc / Nt, Where Nc is the number of nodes that overlap with the original routing path, and Nt is the total number of nodes in the path. The overlap evaluation takes into account the continuity of the node sequence, and continuous overlap segments have higher weights.

[0107] This embodiment optimizes the path selection mechanism. Under the condition that the path costs are similar, the overlap of different paths is compared. A cost difference threshold ε is set. When the difference in path costs is less than ε, the path with high overlap is preferentially selected. This strategy ensures the optimization of the path and reduces routing oscillation.

[0108] This embodiment implements a path verification mechanism. For candidate new routing paths, the system analyzes their reliability and stability. The verification process considers factors such as link status and node load to ensure that the selected path has sufficient transmission capacity. At the same time, the path lifetime is evaluated to avoid selecting a path that is about to expire.

[0109] Through the above technical innovations, this embodiment effectively solves the problems of untimely routing updates and frequent path jitters in traditional satellite networks. In practical applications, this solution can quickly respond to changes in network status and calculate the optimal routing path. Especially in scenarios where satellite nodes move at high speed and topology changes frequently, the optimized path selection strategy significantly improves the stability of routing.

[0110] The innovation of this embodiment is mainly reflected in data processing, path calculation and selection strategy. Through a series of algorithm optimization and mechanism improvement, dynamic optimization of satellite network routing is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the routing performance of satellite communication networks and lays an important foundation for the integrated space-ground network.

[0111] In one embodiment of the routing method based on on-board processing of the present application, the following contents may also be specifically included: Step S701: the next hop node extracts the network node directly connected to the current node from the new routing path as the new next hop node, and the next hop node checks the intersatellite link communication status of the new next hop node. If the intersatellite link communication status is normal, the next hop node updates the routing path information in the data packet, and sends the updated data packet to the new next hop node through the corresponding intersatellite link port; Step S702: After receiving the data packet, the new next-hop node determines whether it is the target node. If it is not the target node, it repeats the process of recalculating the routing path and forwarding data. If it is the target node, it parses the business data in the data packet to complete the data transmission. The target node returns confirmation information of the completion of the data transmission to the source node.

[0112] Optionally, this embodiment innovatively designs a next-hop node selection mechanism. The network node directly connected to the current node is extracted from the new routing path sequence, and the node selection adopts a priority evaluation method. The priority P is calculated by the following formula: P = α Q +β L + γ S, Where Q is the link quality indicator, L is the load level, S is the state stability, and α, β, and γ are weight coefficients. This method comprehensively considers link performance and node status.

[0113] This embodiment implements a comprehensive link status check. The system monitors multiple key parameters of the intersatellite link, including carrier lock status, signal-to-noise ratio, bit error rate, and link margin. The link status evaluation adopts a fuzzy comprehensive decision method to determine the link availability based on the real-time values ​​of each parameter. When link performance degradation is detected, the backup path switching mechanism is triggered.

[0114] This embodiment optimizes the data packet update strategy. Before forwarding a data packet, the system updates the routing control information, including the node sequence that has been passed and the remaining path information. The update process uses an incremental encoding method to modify only the changed fields to reduce processing overhead. At the same time, the path integrity check code is maintained to ensure the correctness of the routing information.

[0115] This embodiment builds a reliable data forwarding mechanism. The system optimizes the transmission parameter configuration according to the characteristics of the intersatellite link. Adopts an adaptive coding and modulation scheme to dynamically adjust the coding efficiency and modulation order according to the link quality. Implements a flow control mechanism to prevent link congestion. It also supports packet fragmentation and reassembly to adapt to different link bandwidth conditions.

[0116] This embodiment designs an intelligent target node judgment process. After receiving the data packet, the new next-hop node first compares its own identifier with the target node identifier. The judgment process considers various forms of node identifiers, including physical addresses and logical addresses. The identity authentication mechanism ensures that the data packet is delivered to the correct target node.

[0117] This embodiment optimizes the service data parsing method. The target node uses a hierarchical parsing strategy to process the received data packets. First, an integrity check is performed to ensure that the data is not damaged. Then, the service data is parsed according to the protocol specification to extract the payload. The parsing process realizes parallel processing and improves processing efficiency.

[0118] This embodiment implements an innovative confirmation mechanism. The target node generates a transmission completion confirmation message, which contains a data packet identifier, a receiving timestamp, and a processing status code. A reliable reverse transmission mechanism is used to ensure that the confirmation information can be delivered to the source node. When the source node does not receive the confirmation within the timeout period, the retransmission mechanism is triggered.

[0119] This embodiment builds a complete exception handling process. During the data transmission process, the system continuously monitors the execution status of each link. When an abnormal situation is detected, the corresponding handling measures are taken according to the type of abnormality. For temporary failures, try to retry the operation; for permanent failures, start the backup plan.

[0120] Through the above technical innovations, this embodiment effectively solves the problems of unreliable data transmission and difficult end-to-end confirmation in traditional satellite networks. In practical applications, this solution can ensure reliable data transmission and provide end-to-end transmission status feedback. Especially in scenarios with changeable link status and complex transmission environment, the network service quality is significantly improved through optimized transmission control and confirmation mechanism.

[0121] The innovation of this embodiment is mainly reflected in the aspects of node selection, data transmission and confirmation mechanism. Through a series of technical optimizations, efficient and reliable transmission of satellite network data is achieved. This solution provides technical support for improving the service capabilities of space information networks and has important practical significance in the construction of satellite Internet. The application of this technology significantly improves the transmission performance and reliability of satellite communication networks, laying an important foundation for the integrated space-ground network.

[0122] The deployment of this embodiment in the satellite communication network effectively improves the success rate of data transmission and service quality, and is particularly suitable for business scenarios with high requirements for transmission reliability. Through end-to-end transmission control and status confirmation, it provides reliable communication guarantee for upper-layer applications and promotes the development and application of satellite Internet technology.

[0123] In order to effectively solve the deficiencies of conventional technologies in terms of routing real-time, topology management and on-board processing, and significantly improve the performance of satellite communication networks, the present application provides an embodiment of an on-board processing-based routing device for implementing all or part of the content of the on-board processing-based routing method, see Figure 2 The routing device based on on-board processing specifically includes the following contents: The network topology module 10 is used for the gateway station to divide the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and to build a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication state. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node, and the satellite node stores the received corresponding relationship data in the topology database; A path determination module 20 is used for, when the satellite node receives data to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; The inter-satellite routing module 30 is used to recalculate the routing path of the data based on the network topology structure stored in the topology database after the next hop node receives the data. The next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0124] From the above description, it can be seen that the routing device based on on-board processing provided in the embodiment of the present application can construct a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules by adopting a time slice division mechanism. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice to determine the next-hop forwarding node. The dynamic routing recalculation mechanism of the relay node is used to ensure that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of satellite communication networks.

[0125] From the hardware level, in order to effectively solve the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improve the performance of satellite communication networks, the present application provides an embodiment of an electronic device for implementing all or part of the content of the routing method based on on-board processing, and the electronic device specifically includes the following content: Processor, memory, communication interface and bus; wherein the processor, memory and communication interface communicate with each other through the bus; the communication interface is used to realize information transmission between the routing device based on on-board processing and the core business system, user terminal and related database and other related devices; the logic controller can be a desktop computer, a tablet computer and a mobile terminal, etc., but the present embodiment is not limited thereto. In the present embodiment, the logic controller can be implemented with reference to the embodiment of the routing method based on on-board processing and the embodiment of the routing device based on on-board processing in the embodiment, and the contents thereof are incorporated herein, and the repeated parts are not repeated.

[0126] It is understandable that the user terminal may include a smart phone, a tablet electronic device, a network set-top box, a portable computer, a desktop computer, a personal digital assistant (PDA), a vehicle-mounted device, a smart wearable device, etc. Among them, the smart wearable device may include smart glasses, a smart watch, a smart bracelet, etc.

[0127] In practical applications, part of the routing method based on on-board processing can be executed on the electronic device side as described above, or all operations can be completed in the client device. The selection can be made based on the processing capability of the client device and the limitations of the user's usage scenario. This application does not limit this. If all operations are completed in the client device, the client device may also include a processor.

[0128] The client device may have a communication module (i.e., a communication unit) that can communicate with a remote server to achieve data transmission with the server. The server may include a server on the task scheduling center side, and other implementation scenarios may also include a server on an intermediate platform, such as a server on a third-party server platform that has a communication link with the task scheduling center server. The server may include a single computer device, or a server cluster consisting of multiple servers, or a server structure of a distributed device.

[0129] Figure 3 FIG. 9 is a schematic block diagram of the system structure of the electronic device 9600 according to an embodiment of the present application. Figure 3 As shown, the electronic device 9600 may include a central processor 9100 and a memory 9140; the memory 9140 is coupled to the central processor 9100. It is worth noting that Figure 3 is exemplary; other types of structures may also be used to supplement or replace this structure to implement telecommunication functions or other functions.

[0130] In one embodiment, the routing method function based on on-board processing may be integrated into the central processor 9100. The central processor 9100 may be configured to perform the following control: Step S101: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database. Step S102: When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; Step S103: After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0131] From the above description, it can be seen that the electronic device provided in the embodiment of the present application adopts a time slicing division mechanism to construct a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice to determine the next hop forwarding node. Through the dynamic routing recalculation mechanism of the relay node, it is ensured that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of satellite communication networks.

[0132] In another embodiment, the routing device based on on-board processing can be configured separately from the central processor 9100. For example, the routing device based on on-board processing can be configured as a chip connected to the central processor 9100, and the function of the routing method based on on-board processing can be implemented through the control of the central processor.

[0133] like Figure 3 As shown, the electronic device 9600 may also include: a communication module 9110, an input unit 9120, an audio processor 9130, a display 9160, and a power supply 9170. It is worth noting that the electronic device 9600 does not necessarily have to include Figure 3 In addition, the electronic device 9600 may also include Figure 3 For components not shown, reference may be made to the prior art.

[0134] like Figure 3 As shown, the central processing unit 9100 is sometimes also referred to as a controller or an operation control, and may include a microprocessor or other processor device and / or logic device. The central processing unit 9100 receives input and controls the operation of various components of the electronic device 9600.

[0135] The memory 9140 may be, for example, one or more of a cache, a flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory or other suitable devices. The above-mentioned information related to the failure may be stored, and a program for executing the relevant information may also be stored. The CPU 9100 may execute the program stored in the memory 9140 to implement information storage or processing, etc.

[0136] The input unit 9120 provides input to the central processing unit 9100. The input unit 9120 is, for example, a key or a touch input device. The power supply 9170 is used to provide power to the electronic device 9600. The display 9160 is used to display display objects such as images and texts. The display may be, for example, an LCD display, but is not limited thereto.

[0137] The memory 9140 may be a solid-state memory, such as a read-only memory (ROM), a random access memory (RAM), a SIM card, etc. It may also be a memory that saves information even when the power is off, can be selectively erased, and is provided with more data, examples of which are sometimes referred to as EPROMs, etc. The memory 9140 may also be some other type of device. The memory 9140 includes a buffer memory 9141 (sometimes referred to as a buffer). The memory 9140 may include an application / function storage unit 9142, which is used to store application programs and function programs or processes for executing the operation of the electronic device 9600 through the central processor 9100.

[0138] The memory 9140 may also include a data storage unit 9143 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the electronic device. The driver storage unit 9144 of the memory 9140 may include various drivers for communication functions of the electronic device and / or for executing other functions of the electronic device (such as messaging applications, address book applications, etc.).

[0139] The communication module 9110 is a transmitter / receiver that sends and receives signals via the antenna 9111. The communication module 9110 (transmitter / receiver) is coupled to the central processor 9100 to provide input signals and receive output signals, which may be the same as the case of a conventional mobile communication terminal.

[0140] Based on different communication technologies, multiple communication modules 9110 may be provided in the same electronic device, such as a cellular network module, a Bluetooth module and / or a wireless LAN module. The communication module 9110 (transmitter / receiver) is also coupled to a speaker 9131 and a microphone 9132 via an audio processor 9130 to provide an audio output via the speaker 9131 and receive an audio input from the microphone 9132, thereby realizing a common telecommunication function. The audio processor 9130 may include any suitable buffer, decoder, amplifier, etc. In addition, the audio processor 9130 is also coupled to the central processor 9100, so that recording can be performed on the local machine through the microphone 9132, and the sound stored on the local machine can be played through the speaker 9131.

[0141] The embodiments of the present application also provide a computer-readable storage medium capable of implementing all steps of the routing method based on on-board processing in the above embodiments, where the execution subject is a server or a client. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, all steps of the routing method based on on-board processing in the above embodiments are implemented. For example, when the processor executes the computer program, the following steps are implemented: Step S101: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database. Step S102: When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; Step S103: After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0142] From the above description, it can be seen that the computer-readable storage medium provided in the embodiment of the present application adopts a time slicing division mechanism to construct a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice to determine the next hop forwarding node. Through the dynamic routing recalculation mechanism of the relay node, it is ensured that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of the satellite communication network.

[0143] The embodiments of the present application also provide a computer program product capable of implementing all steps of the routing method based on on-board processing in the above embodiments, where the execution subject is a server or a client. When the computer program / instruction is executed by a processor, the steps of the routing method based on on-board processing are implemented. For example, the computer program / instruction implements the following steps: Step S101: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database. Step S102: When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; Step S103: After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

[0144] From the above description, it can be seen that the computer program product provided in the embodiment of the present application adopts a time slice division mechanism to construct a dynamic network topology structure according to the satellite constellation operation cycle and link establishment rules. The gateway station pre-announces the correspondence data between the time slice and the network topology to the satellite node storage. After the satellite node receives the data, it uses the shortest path algorithm to implement autonomous routing calculation based on the network topology corresponding to the current time slice to determine the next hop forwarding node. Through the dynamic routing recalculation mechanism of the relay node, it is ensured that the data is transmitted to the target node along the optimal path. This method effectively solves the shortcomings of traditional technologies in routing real-time, topology management and on-board processing, and significantly improves the performance of the satellite communication network.

[0145] It should be understood by those skilled in the art that embodiments of the present invention may be provided as methods, devices, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0146] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (apparatus), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0147] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0148] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0149] The present invention uses specific embodiments to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A routing method based on on-board processing, characterized in that: The method comprises: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication state. The network topology structure includes the connection relationship and link weight between the satellite nodes. The gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node. The satellite node stores the received corresponding relationship data in the topology database; When the satellite node receives data that needs to be forwarded, the satellite node obtains the time slice at the current moment, reads the network topology structure corresponding to the current moment from the topology database, calculates the routing path of the data based on the shortest path algorithm, the routing path includes all relay node sequences from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through the inter-satellite link established with the next hop node; After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, and the next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

2. The routing method based on on-board processing according to claim 1, characterized in that: The gateway station divides the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rule, and constructs a network topology structure corresponding to each time slice based on the real-time position information of the satellite nodes and the link communication status. The network topology structure includes the connection relationship and link weight between the satellite nodes, including: The gateway calculates the distance change rate and the angle change rate between adjacent satellite nodes according to the orbital parameters of the satellite constellation, sets the maximum allowable change rate according to the inter-satellite link establishment rule, divides the time period in which the distance change rate and the angle change rate of adjacent satellite nodes in the orbital period are both less than the maximum allowable change rate into the time slice, and the gateway performs timestamp encoding on the time slice; The gateway calculates the three-dimensional spatial position coordinates of each satellite node in each time slice based on an inertial coordinate system, determines whether an adjacent satellite node can establish an inter-satellite link according to the communication range and antenna pointing of the satellite node, uses the satellite node as a network node, uses the establishable inter-satellite link as a network edge, calculates the communication distance of the inter-satellite link as a link weight based on the position coordinates of the satellite node, and combines the network nodes, the network edges and the link weights to construct the network topology structure.

3. The routing method based on on-board processing according to claim 1, characterized in that: The gateway station packages the correspondence data between the time slice and the network topology structure and uploads it to the satellite node, and the satellite node stores the received correspondence data into the topology database, including: The gateway establishes a mapping relationship between the identification information of each time slice and the corresponding network topology structure, wherein the mapping relationship includes the start and end time of the time slice, the spatial location information of the network node, the connection state of the network edge and the link weight; the gateway encodes the mapping relationship data in packets according to the satellite-to-ground communication protocol, and sends the encoded data packet to the satellite node through the uplink established between the ground gateway and the satellite node; The satellite node decodes the data packet after receiving it, extracts the mapping relationship between the time slice and the network topology structure, creates a time index table and a topology structure table in the topology database, writes the time slice information into the time index table, writes the network topology structure into the topology structure table, and establishes an association relationship between the time index table and the topology structure table.

4. The routing method based on on-board processing according to claim 3, characterized in that: When the satellite node receives data to be forwarded, the satellite node obtains the time slice at the current moment, and reads the network topology structure corresponding to the current moment from the topology database, including: The satellite node obtains the current world coordinated time according to the onboard clock, converts the world coordinated time into the orbital operation time of the satellite constellation, the satellite node retrieves the time range of the orbital operation time in the time index table, extracts the corresponding time slice identification information, and the satellite node combines and encodes the time slice identification information with the source node identification and the target node identification in the data packet; The satellite node queries the topology structure table in the topology database according to the time slice identification information, reads the network topology structure corresponding to the time slice, and the satellite node extracts the spatial location information of the network node, the connection status of the network edge and the link weight from the network topology structure, and generates an adjacency matrix containing node connection relationships and a weight matrix containing link communication costs.

5. The routing method based on on-board processing according to claim 4, characterized in that: The method of calculating the routing path of the data based on the shortest path algorithm, wherein the routing path includes a sequence of all relay nodes from the satellite node to the target node, the satellite node determines a next hop node according to the routing path, and sends the data through an intersatellite link established with the next hop node, comprises: The satellite node determines all reachable paths between the source node and the target node according to the adjacency matrix, calculates the sum of the weight matrix elements corresponding to the network edges passed by each of the paths as the path cost, the satellite node determines the path with the minimum path cost as the routing path based on the Dijkstra shortest path algorithm, and the satellite node extracts the next network node directly connected to the current node from the routing path as the next hop node; The satellite node encapsulates the target node identifier of the data, the routing path information and the service data according to the inter-satellite communication protocol according to the inter-satellite link port number corresponding to the next hop node in the adjacency matrix, the satellite node establishes a communication link with the next hop node through the inter-satellite link port, and the satellite node sends the encapsulated data packet to the next hop node through the communication link.

6. The routing method based on on-board processing according to claim 1, characterized in that: After receiving the data, the next hop node recalculates the routing path of the data based on the network topology structure stored in the topology database, including: After receiving the data packet, the next hop node decapsulates the data packet, extracts the target node identifier and the original routing path information in the data packet, obtains the current world coordinated time and converts it into orbital operation time, queries the corresponding time slice from the topology database according to the orbital operation time, reads the network topology structure corresponding to the time slice and generates a new adjacency matrix and weight matrix; The next hop node uses itself as a new source node, and calculates all reachable paths to the target node based on the new adjacency matrix and the new weight matrix. The next hop node compares the overlap between each reachable path and the original routing path, and preferentially selects a path with a higher overlap with the original routing path as the new routing path under the condition that the path costs are similar.

7. The routing method based on on-board processing according to claim 1, characterized in that: The next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node, including: The next hop node extracts the network node directly connected to the current node from the new routing path as the new next hop node, and the next hop node checks the intersatellite link communication status of the new next hop node. If the intersatellite link communication status is normal, the next hop node updates the routing path information in the data packet, and sends the updated data packet to the new next hop node through the corresponding intersatellite link port; After receiving the data packet, the new next-hop node determines whether it is the target node. If it is not the target node, it repeats the process of recalculating the routing path and forwarding data. If it is the target node, it parses the business data in the data packet to complete the data transmission. The target node returns confirmation information of the completion of the data transmission to the source node.

8. A routing device based on on-board processing, characterized in that: The device comprises: A network topology module, used for the gateway station to divide the orbital period of the satellite constellation into multiple time slices according to the orbital period of the satellite constellation and the inter-satellite link establishment rules, and to build a network topology structure corresponding to each time slice based on the real-time position information of the satellite node and the link communication status, wherein the network topology structure includes the connection relationship and link weight between the satellite nodes, the gateway station packages the corresponding relationship data between the time slice and the network topology structure and uploads it to the satellite node, and the satellite node stores the received corresponding relationship data in the topology database; a path determination module, configured to, when the satellite node receives data to be forwarded, obtain the time slice at the current moment, read the network topology structure corresponding to the current moment from the topology database, calculate the routing path of the data based on the shortest path algorithm, the routing path includes a sequence of all relay nodes from the satellite node to the target node, the satellite node determines the next hop node according to the routing path, and sends the data through an intersatellite link established with the next hop node; The inter-satellite routing module is used to recalculate the routing path of the data based on the network topology structure stored in the topology database after the next hop node receives the data. The next hop node selects a new next hop node to forward the data according to the calculated routing path until the data is transmitted to the target node.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the routing method based on on-board processing according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the routing method based on on-board processing described in any one of claims 1 to 7 are implemented.

Images