Network perception data transmission method and device, computer device and storage medium

Abstract

The application relates to the field of satellite communication and discloses a network-aware data transmission method and device, computer equipment and a storage medium, the method comprising the following steps: acquiring the running state and network service time of all satellite nodes in a low-orbit satellite network; constructing a time-varying graph model based on all satellite nodes, the links between the satellite nodes and the network service time; calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, performing maximum link transmission capacity routing for each time slot, and obtaining a data transmission scheme of the low-orbit satellite network. By implementing the application, the time-varying graph model is constructed considering that the satellite nodes in the low-orbit satellite network move at a high speed along an orbit over time, the link transmission capacity is calculated through the time-varying graph model to obtain the network topology of each time slot, and routing is performed. The method determines the data transmission link based on the time-varying graph model in consideration of the transmission capacity, improves the network load balancing capability, and enhances the transmission robustness.

Description

Technical Field

[0001] This invention relates to the field of satellite communications, and more specifically to methods, apparatus, computer equipment, and storage media for transmitting network-sensing data. Background Technology

[0002] With the continuous development of globally deployed communication network infrastructure, users can now access the internet anytime, anywhere in cities via smart terminals. However, the coverage of terrestrial networks is greatly affected by geographical conditions. In remote areas, due to high infrastructure construction costs and low network utilization, the number of base stations is limited, resulting in insufficient network coverage. In deserts and high-altitude areas, due to difficulties in infrastructure construction, there is often no network coverage, and data transmission needs are frequently unmet. Facing the growing network demands of users in these areas and the development requirements of 5G communication systems for ubiquitous global connectivity, the emerging Low Earth Orbit (LEO) satellite constellations can solve these problems. LEO satellite constellations use a dense network of LEO satellites, each orbiting the Earth at high speed, making the LEO satellite network a dynamic network. LEO satellites can connect with several surrounding LEO satellites via Inter-Satellite Links (ISL) to build a transmission network, ignoring terrain factors and achieving seamless global network coverage. This allows areas difficult to reach by terrestrial networks to obtain network services through STIN (Satellite-Terrestrial Integrated Networks). Therefore, in STIN, the construction of LSN (LEO Satellite Networks) is crucial for the future vision of ubiquitous global connectivity.

[0003] Traditional communication satellites do not have inter-satellite links. Data transmission and traffic management are controlled by ground stations. Data needs to go through multiple hops between the ground and satellites to travel from the sender to the receiver. The sender first sends the information to the satellite, the relay satellite needs to send it to the ground station for forwarding, and the ground station then forwards the information to the next satellite. This increases the number of transmissions from the ground to the satellite, and the excessive transmission time delay makes traditional satellite communication inefficient.

[0004] With the enhanced onboard data processing capabilities of low Earth orbit (LEO) satellites, current LEO satellites are capable of establishing inter-satellite links. Two LEO satellites within the visible range can dynamically establish inter-satellite links through processes such as positioning, tracking, and calibration, thereby forming a satellite transmission network, which can significantly improve the efficiency of global data transmission. However, due to the limited onboard transmission resources of LEO satellites and the rapid mobility of nodes, existing terrestrial data transmission schemes are not suitable. Therefore, it is necessary to study LEO transmission link deployment and network traffic scheduling schemes to improve communication quality and efficiency. Summary of the Invention

[0005] In view of this, the present invention provides a method, apparatus, computer equipment and storage medium for transmitting network-aware data, in order to solve the problem that existing terrestrial data transmission schemes are not suitable for LSN data transmission.

[0006] In a first aspect, the present invention provides a method for transmitting network-aware data, the method comprising: acquiring the operating status and network service time of all satellite nodes in a low-Earth orbit satellite network, wherein the network service time includes multiple time slots; constructing a time-varying graph model based on all satellite nodes, links between satellite nodes, and network service time, wherein the links are data transmission links between two adjacent satellite nodes; calculating the link transmission capacity of each transmission link based on the time-varying graph model and the operating status, performing maximum link transmission capacity routing for each time slot, and obtaining a data transmission scheme for the low-Earth orbit satellite network, wherein the transmission links are data transmission links from the source node to the destination node.

[0007] The network-aware data transmission method provided by this invention acquires the operational status and network service time of all satellite nodes in a low-Earth orbit (LEO) satellite network. Simultaneously, considering the high-speed orbital movement of satellite nodes over time, a time-varying graph model is constructed based on the network service time. During data transmission, the network topology of each time slot is obtained through the time-varying graph model to calculate the link transmission capacity, and pathfinding is performed to maximize the link transmission capacity. Therefore, this method, by considering on-board transmission resources (i.e., transmission capacity) and combining a time-varying graph model determined by node mobility to determine data transmission links, improves network load balancing capabilities and enhances transmission robustness.

[0008] In one optional implementation, a time-varying graph model is constructed based on all satellite nodes, the links between satellite nodes, and the network service time. This includes: constructing a time-varying graph model with all satellite nodes as vertices and the links between satellite nodes as edges of the vertices, where both vertices and edges are functions of the network service time.

[0009] The network-aware data transmission method provided by this invention constructs a time-varying graph model by using all satellite nodes as vertices of a graph model and the transmission links between satellite nodes as edges of the vertices. At the same time, both vertices and edges are functions of network service time. Thus, the constructed time-varying graph model realizes the tracking of network topology at different time periods.

[0010] In one optional implementation, the link transmission capacity of each transmission link is calculated based on a time-varying graph model and the operating status, and the maximum link transmission capacity path is found for each time slot to obtain a data transmission scheme for the low-Earth orbit satellite network. This includes: obtaining the low-Earth orbit satellite network topology for the current time slot based on the time-varying graph model and the operating status; calculating the link transmission capacity based on the current time slot's low-Earth orbit satellite network topology and finding the maximum link transmission capacity path for the current time slot; calculating the duration of the current time slot based on satellite ephemeris data and determining the start time of the next time slot; obtaining the low-Earth orbit satellite network topology for the next time slot based on the start time of the next time slot and the time-varying graph model; calculating the link transmission capacity based on the next time slot's low-Earth orbit satellite network topology and finding the maximum link transmission capacity path for the next time slot; and using the transmission links corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme for the corresponding time slot of the low-Earth orbit satellite network.

[0011] The network sensing data transmission method provided by this invention divides the network into different time slots, determines the start time of each time slot based on satellite ephemeris data, and determines the network topology of each time slot by combining a time-varying graph model. It then performs maximum link transmission capacity routing in different time slots, realizing continuous transmission measurement for dynamic network topology calculation and improving transmission robustness.

[0012] In one optional implementation, the link transmission capacity is calculated based on the LEO satellite network topology of the current time slot, and the path finding of the maximum link transmission capacity of the current time slot is performed, including: obtaining the source node and destination node corresponding to the transmission link for data transmission in the current time slot; based on the source node and destination node, calculating the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the LEO satellite network topology of the current time slot; determining the link transmission capacity of each transmission link according to the link transmission capacity of the two adjacent satellites, and taking the transmission link with the largest link transmission capacity as the data transmission path.

[0013] The network-aware data transmission method provided by this invention determines the source node and destination node of data transmission in each time slot when performing maximum link transmission capacity routing in each time slot, and performs maximum link transmission capacity routing between the source node and destination node of each transmission link in combination with the link transmission capacity, thereby realizing the deployment of transmission links and network traffic scheduling.

[0014] In one optional implementation, the link transmission capacity of each transmission link is determined based on the link transmission capacity of two adjacent satellites, and the transmission link with the largest link transmission capacity is selected as the data transmission path. This includes: starting from the source node, traversing every node that may establish a link using the MST algorithm; calculating the link transmission capacity from the source node to the current node based on the link transmission capacity of two adjacent satellites; calculating the first distance between the current node and the destination node, and the second distance between any next-hop node and the destination node; selecting the next-hop node based on the relationship between the first distance and the second distance; using the selected next-hop node as the current node, repeating the steps of calculating the link transmission capacity, calculating the first distance and the second distance, and comparing the first distance and the second distance until the destination node is reached, thus obtaining the transmission path from the source node to the destination node.

[0015] The network-aware data transmission method provided by this invention, when performing maximum link transmission capacity routing, not only considers the link's transmission capacity, but also ensures that the transmission process always proceeds along the direction from the source node to the destination node by judging the relationship between the first distance between the current node and the destination node and the second distance between any next-hop node and the destination node. This also reduces data transmission latency.

[0016] In one optional implementation, the operating status includes the transmission capacity of each satellite node; calculating the link transmission capacity between two adjacent satellites in the current time slot based on the LEO satellite network topology of the current time slot includes: determining the transmission capacity already occupied by each satellite node in the current time slot based on the LEO satellite network topology of the current time slot; determining the available transmission capacity of each satellite node based on the difference between the transmission capacity of each satellite node and the occupied transmission capacity; and taking the smaller value of the available transmission capacity of each satellite node in two adjacent satellites as the link transmission capacity between the two adjacent satellites.

[0017] The network-aware data transmission method provided by this invention calculates the difference between the transmission capacity and the occupied transmission capacity of each satellite node, and selects the smaller value of the corresponding difference between two adjacent satellites as the link transmission capacity between the two satellites. This calculation of the link transmission capacity lays the foundation for the selection of the maximum capacity.

[0018] In one optional implementation, obtaining the operational status of all satellite nodes in the low-Earth orbit satellite network includes: using high-Earth orbit satellites to obtain the operational status of all satellite nodes in the low-Earth orbit satellite network.

[0019] The network sensing data transmission method provided by this invention is based on the global network coverage of low-Earth orbit (LEO) satellites by high-Earth orbit (HEO) satellites, and collects the operational status of satellite nodes in the LEO satellite network through high-Earth orbit (HEO) satellites. This achieves global sensing of the operational status of the LEO satellite network.

[0020] Secondly, the present invention provides a network-aware data transmission device, comprising: a data acquisition module for acquiring the operating status and network service time of all satellite nodes in a low-Earth orbit satellite network, wherein the network service time includes multiple time slots; a model building module for constructing a time-varying graph model based on all satellite nodes, links between satellite nodes, and network service time, wherein the links are data transmission links between two adjacent satellite nodes; and a routing module for calculating the link transmission capacity of each transmission link based on the time-varying graph model and the operating status, performing maximum link transmission capacity routing for each time slot, and obtaining a data transmission scheme for the low-Earth orbit satellite network, wherein the transmission links are data transmission links from the source node to the destination node.

[0021] In one alternative implementation, the model building module is specifically used to: construct a time-varying graph model with all satellite nodes as vertices of the graph model and the links between satellite nodes as edges of the vertices, where both vertices and edges are functions of network service time.

[0022] In one optional implementation, the routing module includes: a current topology determination unit, used to obtain the LEO satellite network topology of the current time slot based on a time-varying graph model and operating status; a current routing unit, used to calculate the link transmission capacity based on the LEO satellite network topology of the current time slot and perform routing for the maximum link transmission capacity of the current time slot; a time slot calculation unit, used to calculate the duration of the current time slot based on satellite ephemeris data and determine the start time of the next time slot; a next topology determination unit, used to obtain the LEO satellite network topology of the next time slot based on the start time of the next time slot and a time-varying graph model; and a next routing unit, used to calculate the link transmission capacity based on the LEO satellite network topology of the next time slot, perform routing for the maximum link transmission capacity of the next time slot, and use the transmission links corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme for the corresponding time slot of the LEO satellite network.

[0023] In one optional implementation, the current routing unit includes: a node acquisition unit, used to acquire the source node and destination node corresponding to the transmission link of data transmission in the current time slot; an adjacent capacity calculation unit, used to calculate the link transmission capacity of two adjacent satellites in the current time slot transmission link based on the source node and destination node and according to the low-Earth orbit satellite network topology of the current time slot; and a routing subunit, used to determine the link transmission capacity of each transmission link based on the link transmission capacity of two adjacent satellites, and take the transmission link with the largest link transmission capacity as the data transmission path.

[0024] In one optional implementation, the pathfinding subunit is specifically used to: traverse every node that may establish a link starting from the source node using the MST algorithm; calculate the link transmission capacity from the source node to the current node based on the link transmission capacity of two adjacent satellites; calculate the first distance between the current node and the destination node and the second distance between any next-hop node and the destination node; select the next-hop node based on the relationship between the first distance and the second distance; and use the selected next-hop node as the current node, repeating the steps of calculating the link transmission capacity, calculating the first distance and the second distance, and comparing the first distance and the second distance until the destination node is reached, thereby obtaining the transmission path from the source node to the destination node.

[0025] In one optional implementation, the operating status includes the transmission capacity of each satellite node; the adjacent capacity calculation unit is specifically used to: determine the transmission capacity already occupied by each satellite node in the current time slot based on the low-Earth orbit satellite network topology of the current time slot; determine the available transmission capacity of each satellite node based on the difference between the transmission capacity of each satellite node and the occupied transmission capacity; and take the smaller value of the available transmission capacity of each satellite node in two adjacent satellites as the link transmission capacity of the two adjacent satellites.

[0026] In one alternative implementation, the data acquisition module is specifically used to: acquire the operational status of all satellite nodes in the low-orbit satellite network using high-orbit satellites.

[0027] Thirdly, the present invention provides a computer device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform the network-aware data transmission method described in the first aspect or any corresponding embodiment thereof.

[0028] Fourthly, the present invention provides a computer-readable storage medium storing computer instructions for causing a computer to execute the network-aware data transmission method described in the first aspect or any corresponding embodiment thereof. Attached Figure Description

[0029] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0030] Figure 1 This is a flowchart illustrating a method for transmitting network-aware data according to an embodiment of the present invention.

[0031] Figure 2 This is a flowchart illustrating another method for transmitting network-aware data according to an embodiment of the present invention;

[0032] Figure 3 This is a schematic diagram of a transmission scenario in a network-aware data transmission method according to an embodiment of the present invention;

[0033] Figure 4 This is a flowchart illustrating another method for transmitting network-aware data according to an embodiment of the present invention;

[0034] Figure 5 This is a structural block diagram of a network-aware data transmission device according to an embodiment of the present invention;

[0035] Figure 6 This is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. Detailed Implementation

[0036] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0037] The application scenarios on which the network-sensing data transmission method depends are described here.

[0038] As mentioned in the background, due to the limited on-board transmission resources of LSNs and the rapid mobility of nodes, existing terrestrial data transmission schemes are unsuitable. Therefore, it is necessary to study LSN transmission link deployment and network traffic scheduling schemes to improve communication quality and efficiency. However, many problems still need to be solved in LSN data transmission. First, with the rapid development of terrestrial communication services, communication demands are increasing, which will lead to increased transmission demands on LSNs. It is necessary to make good use of limited on-board transmission resources and improve LSN traffic management efficiency and network load balancing capabilities. Second, node mobility leads to time-varying transmission links, requiring the design of continuous transmission strategies to address dynamic network topologies and improve transmission robustness.

[0039] In view of this, embodiments of the present invention provide a method for transmitting network-aware data. This method acquires the operational status and network service time of all satellite nodes in a low-Earth orbit (LEO) satellite network. Considering the high-speed orbital movement of satellite nodes over time, a time-varying graph model is constructed based on the network service time. During data transmission, the network topology of each time slot is obtained using the time-varying graph model to calculate the link transmission capacity, performing pathfinding based on the maximum transmission capacity, and then utilizing the link corresponding to the maximum transmission capacity for data transmission. Therefore, this method, by considering on-board transmission resources (i.e., transmission capacity) and combining a time-varying graph model determined by node mobility to determine data transmission links, improves network load balancing capabilities and enhances transmission robustness.

[0040] According to an embodiment of the present invention, a method for transmitting network-aware data is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0041] This embodiment provides a method for transmitting network-aware data, which can be used in an SDN controller. Figure 1 This is a flowchart of a network-aware data transmission method according to an embodiment of the present invention, such as... Figure 1 As shown, the process includes the following steps:

[0042] Step S101: Obtain the operational status and network service time of all satellite nodes in the low-Earth orbit (LEO) satellite network. The network service time includes multiple time slots. Specifically, the global network coverage of geostationary satellites (GEO) can be utilized to collect the operational status of all satellite nodes (LEO satellites) in the LEO satellite network. This operational status includes the current flight position, transmission requirements, and transmission capabilities of all satellite nodes, thereby achieving global awareness of the LEO satellite network's operational status. When determining a specific flight position, a Cartesian coordinate system can be established with the Earth's center as the origin. The three-dimensional spatial coordinates of each satellite node in this coordinate system represent its flight position. Transmission requirements specifically refer to the transmission requests from users in the LEO satellite network's coverage area to the transmission resources of the satellite nodes in the LEO satellite network. Transmission capacity refers to the total transmission capacity that each satellite node can transmit. Network service time specifically refers to the operating time of the LEO satellite network.

[0043] Furthermore, the method for transmitting network-aware data can be implemented in the SDN controller, that is, by using the SDN controller to obtain a global view of the low-Earth orbit satellite network, a logically centralized network control can be achieved.

[0044] Step S102 involves constructing a time-varying graph model based on all satellite nodes, the links between satellite nodes, and network service time. A link is a data transmission link between two adjacent satellite nodes. Specifically, the time-varying graph model can be understood as a graph model that changes over time. Since satellite nodes in a low-Earth orbit (LEO) satellite network move at high speeds along their orbits over time, the network topology also changes accordingly, thus requiring the construction of a time-varying graph model. This graph model is the model structure corresponding to the topology of the LEO satellite network.

[0045] Step S103: Based on the time-varying graph model and operating status, calculate the link transmission capacity of each transmission link, and perform maximum link transmission capacity routing for each time slot to obtain the data transmission scheme of the low-Earth orbit satellite network. The transmission link is the data transmission link from the source node to the destination node. Specifically, when determining the data transmission path, the path with the maximum capacity is selected based on the calculated link transmission capacity to improve the network's load balancing performance. At the same time, due to the mobility of satellite nodes, the network service time is divided into multiple time slots. In each time slot, the network topology of the current time slot is determined based on the time-varying graph model, thereby realizing maximum link transmission capacity routing for each time slot.

[0046] The network-aware data transmission method provided in this invention acquires the operating status and network service time of all satellite nodes in a low-Earth orbit (LEO) satellite network. Considering the high-speed orbital movement of satellite nodes over time, a time-varying graph model is constructed based on the network service time. During data transmission, the network topology of each time slot is obtained using the time-varying graph model to calculate the link transmission capacity and perform pathfinding for the maximum link transmission capacity. Therefore, this method, by considering on-board transmission resources (i.e., transmission capacity) and combining a time-varying graph model determined by node mobility to determine data transmission links, improves network load balancing capabilities and enhances transmission robustness.

[0047] In one embodiment, a time-varying graph model is constructed based on all satellite nodes, the links between satellite nodes, and the network service time. This includes: constructing a time-varying graph model with all satellite nodes as vertices and the links between satellite nodes as edges, where both vertices and edges are functions of the network service time. Specifically, if all satellite nodes in the low-Earth orbit satellite network constitute a set S = {s...} i The inter-satellite transmission link between the two satellites is l. ij Let the link set be L = {l ij Let the network service time be T. If {s} i} can be viewed as the vertices of a graph model, {l ij If we consider {l} as edges connecting vertices, then the low-Earth orbit satellite network can be described by a time-varying graphical model G, and {l} ij} is a function of T, varying with T. The time-varying graphical model G is expressed as:

[0048] G = (S, L, T)

[0049] Here, T can be viewed as a combination of a series of time slots, i.e., T = {T1, T2, ... T}. k}. In each T k In this context, assume that the topological structure of G remains unchanged. Then both S and L can be considered as functions of T, changing with T. k It changes with the change, and can be represented as S(T) k ), L(T k This further decomposes the continuous path planning problem into formulating a transmission strategy for the current topology based on each time slot.

[0050] The network-aware data transmission method provided by this invention constructs a time-varying graph model by using all satellite nodes as vertices of a graph model and the transmission links between satellite nodes as edges of the vertices. At the same time, both vertices and edges are functions of network service time. Thus, the constructed time-varying graph model realizes the tracking of network topology at different time periods.

[0051] This embodiment provides a method for transmitting network-aware data, which can be used in an SDN controller. Figure 2 This is a flowchart of a network-aware data transmission method according to an embodiment of the present invention, such as... Figure 2 As shown, the process includes the following steps:

[0052] Step S201: Obtain the operational status and network service time of all satellite nodes in the low-Earth orbit satellite network. The network service time includes multiple time slots. For details, please refer to [link to relevant documentation]. Figure 1 Step S101 of the illustrated embodiment will not be described again here.

[0053] Step S202: Construct a time-varying graph model based on all satellite nodes, the links between satellite nodes, and network service times. A link is a data transmission link between two adjacent satellite nodes. For details, please refer to [link to details]. Figure 1 Step S102 of the illustrated embodiment will not be described again here.

[0054] Step S203: Calculate the link transmission capacity of each transmission link based on the time-varying graph model and the operating status, perform maximum link transmission capacity routing for each time slot, and obtain the data transmission scheme of the low-orbit satellite network. The transmission link is the data transmission link from the source node to the destination node.

[0055] Specifically, step S203 includes:

[0056] Step S2031: Obtain the LEO satellite network topology for the current time slot based on the time-varying graph model and the operating status. Specifically, since satellite nodes in the LEO satellite network move at high speeds along their orbits, the positions of each satellite node in the orbit differ at different time points, causing the network topology to change over time. Therefore, the maximum capacity path selection problem is dynamic in the time dimension. Because the network topology is represented using a time-varying graph model, the maximum capacity path selection problem can be transformed into a pathfinding problem within the time-varying graph model. By dividing the network service time into time slots, the maximum capacity path selection problem is decomposed in the time dimension into sequential calculations based on each time slot, obtaining a continuous solution to the maximum capacity path selection problem in time, i.e., the data transmission scheme of the LEO satellite network.

[0057] In dividing time slots, it is necessary to determine the maximum link transmission capacity for routing within each time slot. For the current time slot, the network topology can be determined based on the originally acquired operational status and the constructed time-varying graph model. Specifically, since the time-varying graph model describes changes in network topology, the start time of the current time slot is determined by using the originally acquired operational status, such as the location of satellite nodes, and the time difference between the acquired operational status and the current time slot. Combined with the time-varying graph model, the changes in network topology within this time difference are determined, thus obtaining the corresponding network topology for the current time slot. The network topology remains unchanged within the current time slot.

[0058] Step S2032: Calculate the link transmission capacity based on the low-Earth orbit satellite network topology of the current time slot, and perform pathfinding for the maximum link transmission capacity in the current time slot. Specifically, within the current time slot, calculate the transmission capacity of each data transmission link, select the link with the largest capacity for data transmission, thereby achieving maximum capacity path transmission, avoiding link congestion caused by multiple tasks being assigned to the same transmission path, and improving the network's load balancing performance.

[0059] Step S2033: Calculate the duration of the current time slot based on satellite ephemeris data to determine the start time of the next time slot. Ephemeris data, also known as an ephemeris table, refers to a table of celestial orbital parameters, describing the predetermined positions of a celestial body or an artificial satellite at regular intervals. Therefore, the permissible duration of the network topology within the current time slot can be obtained by combining satellite ephemeris data. Since the ground station can receive data transmitted by satellites within a certain range, the satellite's movement within this range can be considered as having an unchanged topology. The time the satellite spends within this range can be taken as the permissible duration of the current time slot, which can be obtained from the satellite ephemeris data. This time is also the duration of the current time slot, and the start time of the current time slot, which is also the start time of the next time slot, can be determined using this duration.

[0060] Step S2034: Obtain the low-Earth orbit satellite network topology for the next time slot based on the start time of the next time slot and the time-varying graph model.

[0061] Step S2035: Calculate the link transmission capacity based on the LEO satellite network topology of the next time slot, perform pathfinding for the maximum link transmission capacity of the next time slot, and use the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme for the corresponding time slot of the LEO satellite network.

[0062] Specifically, the routing process for finding the maximum link transmission capacity of the next time slot is similar to that of the current time slot, and will not be described in detail here. After completing the routing for the next time slot, the same method can be used to find the next time slot after that, until all time slots are found, thus obtaining the data transmission scheme for the low-Earth orbit satellite network.

[0063] The network sensing data transmission method provided by this invention divides the network into different time slots, determines the start time of each time slot based on satellite ephemeris data, and determines the network topology of each time slot by combining a time-varying graph model. It then performs maximum link transmission capacity routing in different time slots, realizing continuous transmission measurement for dynamic network topology calculation and improving transmission robustness.

[0064] In some optional implementations, step S2022 above includes:

[0065] Step a1: Obtain the source and destination nodes corresponding to the transmission links for data transmission in the current time slot. Specifically, when performing maximum link transmission capacity routing in the current time slot, the data transmission may include data transmission from multiple tasks. Different tasks may have different source and destination nodes, so path planning is required for the source and destination nodes corresponding to each task.

[0066] Step a2: Based on the source node and destination node, calculate the link transmission capacity of two adjacent satellites in the current time slot according to the low-Earth orbit satellite network topology. Specifically, when planning the path for the source node and destination node corresponding to each task, first select the first pair of source nodes and destination nodes to find the path with the maximum link transmission capacity. After completing the path finding for the first pair, update the link transmission capacity, and then perform the path finding for the next pair with the maximum link transmission capacity.

[0067] Specifically, when performing maximum link transmission capacity routing for the first pair of source and destination nodes, the link transmission capacity of two adjacent satellites in the current time slot is first calculated. This calculation process includes: determining the transmission capacity already occupied by each satellite node in the current time slot based on the low-Earth orbit satellite network topology; determining the available transmission capacity of each satellite node based on the difference between its transmission capacity and its occupied transmission capacity; and taking the smaller of the available transmission capacity of each satellite node in two adjacent satellites as the link transmission capacity of the two adjacent satellites.

[0068] Specifically, the occupied transmission capacity includes the capacity used by a satellite node when transmitting resources to a user according to the user's transmission request, and the capacity used by the satellite node when transmitting data to other satellite nodes. The transmission capacity of each satellite node is its total available transmission capacity, assuming that the total available transmission capacity of each satellite node is the same. For two adjacent satellite nodes s... i and s j Their available transmission capacities are C i and C j If s i With s j A transmission link can be established between them. ij Its link transmission capacity C ij It can be represented as:

[0069] C ij =min(C i C j )

[0070] It should be noted that not all satellite nodes in a low-Earth orbit satellite network can establish transmission links. Typically, two satellites within the visible range can dynamically establish inter-satellite links. Therefore, when calculating the link transmission capacity between two adjacent satellites, it is necessary to first determine whether a transmission link can be established between the two satellites. If it can be established, then the link transmission capacity can be calculated.

[0071] Step a3: Determine the link transmission capacity of each transmission link based on the link transmission capacity of two adjacent satellites, and select the transmission link with the largest link transmission capacity as the data transmission path. The maximum link transmission capacity path selection is equivalent to the selection of the maximum capacity path. Therefore, considering the link transmission capacity of two adjacent satellites, the maximum capacity path C is selected. LSN It can be represented as:

[0072]

[0073]

[0074] Where C sd From source satellites s sto the target satellite s d Maximum transmission capacity To the source satellite s s to the target satellite s d All transmission links on the path.

[0075] Specifically, when performing maximum link transmission capacity routing, in addition to considering the link transmission capacity, the distance between nodes must also be considered. The greater the distance between nodes, the greater the latency. Therefore, it is necessary to select a path with a large link transmission capacity and a small node distance for transmission. Thus, the maximum link transmission capacity routing specifically includes the following process: starting from the source node, the MST algorithm is used to traverse every node that can establish a link; the link transmission capacity from the source node to the current node is calculated based on the link transmission capacity of two adjacent satellites; the first distance between the current node and the destination node and the second distance between any next-hop node and the destination node are calculated; the next-hop node is selected based on the relationship between the first distance and the second distance; the selected next-hop node is used as the current node, and the steps of calculating the link transmission capacity, calculating the first distance and the second distance, and comparing the first distance and the second distance are repeated until the destination node is reached, thus obtaining the transmission path from the source node to the destination node.

[0076] The MST (Minimum Spanning Tree) algorithm is described as follows: Divide all vertices in the graph into two sets, Known and Unknown. Initially, arbitrarily select one vertex and place it in Known, while the remaining vertices are in Unknown. The goal of the algorithm is to move all vertices from Unknown to Known. Select an edge that connects two vertices, one in Known and the other in Unknown, and the weight of this edge is the smallest among all edges that satisfy the condition. Add this edge to the minimum spanning tree and move the vertex in the Unknown set that it connects to to Known. Repeat the above two steps until the Unknown set is empty.

[0077] Therefore, the source node is the vertex initially selected by the MST algorithm. Then, the time-varying graph model or the current network topology is traversed to determine the nodes that can establish a link with the source node, resulting in multiple candidate nodes. The link transmission capacity between the source node and the candidate nodes is determined based on the link transmission capacity of two adjacent satellites calculated in step a2. The link transmission capacities are sorted from largest to smallest, and the candidate node corresponding to the largest link transmission capacity is selected. Then, it is determined whether the distance between the candidate node and the destination node is less than the distance between the source node and the destination node. If it is less, the next hop node is selected. If it is greater, the candidate node corresponding to the second largest link transmission capacity is selected based on the sorting of link transmission capacities. The distance between the candidate node and the destination node is then determined again. If it is still greater, a new candidate node is selected, where the distance between the candidate node and the destination node is less than the distance between the source node and the destination node.

[0078] Once a candidate node is identified whose distance to the destination node is less than the distance between the source and destination nodes, this candidate node becomes the current node, and the next-hop node selection continues. Similarly, the time-varying graph model or the current network topology is traversed to determine nodes that can establish a link with the current node, resulting in multiple next-hop nodes. The link transmission capacity between the current node and the next-hop nodes is then determined and sorted. Based on the sorting result, the second distance between the selected next-hop node and the destination node, and the first distance between the current node and the destination node, are calculated. If the second distance is less than the first distance, the currently selected next-hop node is determined. This next-hop node is then used as the current node, and the selection of next-hop nodes continues until the destination node is reached.

[0079] The distance between nodes is calculated using the following formula:

[0080]

[0081] In the formula, x i y i z i and x j y j z j These are the position coordinates of the two nodes. By comparing the first and second distances, it can be ensured that the transmission process always proceeds in the direction from the source node to the destination node. It should be noted that the above maximum link transmission capacity routing is performed using the first pair of source and destination nodes as an example. When performing maximum link transmission capacity routing for the next pair of source and destination nodes, it is necessary to recalculate the link transmission capacity of the two adjacent satellites. Then, based on the available transmission capacity of each link determined by the link transmission capacity of the two adjacent satellites, the MST algorithm is used for maximum link transmission capacity routing.

[0082] In addition, the source node and the destination node are respectively Figure 3 In this process, the source satellite and the destination satellite are involved. The ground satellite station uploads data to the source satellite, which then transmits the data to the destination satellite via a link obtained through the maximum link capacity routing process. The destination satellite then sends the data back to the ground satellite station. Steps a1 to a3 involve maximum link capacity routing for the current time slot. When routing for the next time slot, due to satellite movement, the source and destination satellites communicating with the ground satellite station change (i.e., the source and destination nodes change). Therefore, in the next time slot, maximum link capacity routing is performed using the same method as the current time slot, based on the new source and destination nodes. After obtaining the routing result for the next time slot, the time slot after that is determined based on ephemeris data, and maximum link capacity routing is performed using the same method as the next time slot. This process continues until the prediction of all time slots is completed.

[0083] The network-aware data transmission method provided by this invention determines the source node and destination node of data transmission in each time slot when performing maximum link transmission capacity routing in each time slot. It combines the MST algorithm and link transmission capacity to perform maximum link transmission capacity routing between each source node and destination node, thereby realizing the deployment of transmission links and network traffic scheduling.

[0084] As one or more specific application embodiments of the present invention, such as Figure 4 As shown, the method for transmitting network-sensing data is implemented using the following process:

[0085] Step 1: Global Status Awareness of LEO Satellite Transmission Network;

[0086] By leveraging the global network coverage of geostationary satellites (GEO), the operational status of all satellite nodes in LSN (LEO satellite networks) is collected, including flight position, transmission requirements, and transmission capacity, and statistical analysis is performed to achieve global awareness of LSN operational status. A software-defined networking (SDN) controller is used to obtain a global view of the network, and STIN achieves global control of LSN data transmission through control-forward separation logic.

[0087] Step 2: Calculate the available inter-satellite transmission link capacity;

[0088] If a transmission link can be established between two adjacent satellites, the currently available transmission capacity of the link is determined based on the current transmission capabilities of the two adjacent satellites and the link capacity already occupied by tasks performing transmission. During its flight, the satellite collects transmission requests from users in its coverage area and allocates transmission resources to users. Assume that the total available transmission resources for each satellite are the same and constant, denoted as C. For any satellite s... i After allocating transmission resources to the covered users, the currently available transmission resources are denoted as C. i For any satellite s j After allocating transmission resources to the covered users, the currently available transmission resources are denoted as C. j If s i With s j A transmission link can be established between them. ij Its available transmission link capacity C ij This can be deduced as:

[0089] C ij =min(C i C j )

[0090] Step 3: Establishing the maximum capacity path selection problem;

[0091] Considering that dense LEO satellite nodes in an LSN can easily lead to low transmission capacity utilization and network load imbalance, for each LSN transmission task, a maximum capacity path selection problem is established based on global state awareness and transmission link capacity calculation to improve LSN transmission resource utilization and load balancing performance. The available transmission link capacity C for each link is calculated. ij Then, the LSN transmission control problem is transformed into a maximum capacity path selection problem C. LSN , can be represented as:

[0092]

[0093]

[0094] Where C sd From source satellites s s to the target satellite s d Maximum transmission capacity To the source satellite s s to the target satellite s d All transmission links along the path. The above problem is designed to find the transmission path with the maximum capacity for each task, thereby avoiding link congestion caused by multiple tasks being assigned to the same transmission path and improving the network's load balancing performance.

[0095] Step 4: Establish a time-varying graphical model to decompose the problem;

[0096] Because satellite nodes in an LSN move rapidly along their orbits over time, the network topology is constantly changing. Therefore, the maximum capacity path selection problem is dynamic in the time dimension. Let all satellite nodes in the LSN be {s}. i}, any s i With s j The inter-satellite transmission link between them is set to l ij The link set is set as {l ij Let the network service time be T. If {s} i} can be viewed as the vertices of a graph model, {l ij If we consider {l} as edges connecting vertices, then the LSN can be described by a time-varying graph model G, and {l} ij} is a function of T, varying with T. By establishing a time-varying graphical model G, the maximum capacity path selection problem is transformed into a pathfinding problem in G. Furthermore, T is divided into time slots to decompose the maximum capacity path selection problem in the time dimension into sequential calculations along the time slots, thus obtaining a continuous solution to the maximum capacity path selection problem in time. Let S = {s} be the total number of satellite nodes in the LSN. i}, any s i With s j The inter-satellite transmission link between them is set to l ij Let the link set be L = {l ij Let the network service time be T. If {s} i} can be viewed as the vertices of a graph model, {l ij If we consider the edges connecting vertices as edges, then the LSN can be described by a time-varying graph model G, represented as:

[0097] G = (S, L, T)

[0098] Here, T can be viewed as a combination of a series of time slots, i.e., T = {T1, T2, ... T}. k}. In each T k In this context, assume that the topological structure of G remains unchanged. Then both S and L can be considered as functions of T, changing with T. k It changes with the change, and can be represented as S(T) k ), L(T k ). This leads to question C. LSN It can be represented as C LSN (T k This involves decomposing the continuous path planning problem into a transmission strategy for each time slot.

[0099] Step 5: Determine the transmission path based on the current topology;

[0100] Given the current LSN network state information and time-varying graph model G, step two is used to calculate the available transmission capacity of each transmission link in the current topology. Then, the maximum link transmission capacity pathfinding is performed based on the MST algorithm to guide the deployment of current transmission links and network traffic scheduling. In the current topology G(T)... k In ), from the source node s s Initially, the MST algorithm is executed. Because the MST algorithm can traverse every node that could potentially establish a link, starting from the source node... i Therefore, each s can be calculated. i With s s The transmission link capacity C between them si This yields a sorting of available transmission links by capacity, from largest to smallest. Then, each link is evaluated according to this sorting. If a link is selected for transmission, the next hop node and the target node s are determined. d If the distance between the nodes is smaller than the distance between the current node and the target node, then this link is selected as the next-hop transmission link; otherwise, for the nodes on the next link and the target node, the link is selected as the next-hop transmission link. d The distances between nodes are calculated and compared until a node is selected. This determination aims to ensure that the transmission process always proceeds in the direction from the source node to the destination node. The distance calculation between nodes can be expressed as:

[0101]

[0102] After calculating the first pair of source nodes s s With the target node s d After determining the transmission path, step two is used to update the current topology G(T). k The total available transmission link capacity C in ) ij The value of , and for the next pair of source nodes s s With the target node s d Perform path planning until all transmission paths for all transmission tasks have been calculated.

[0103] Step Six: LSN Topology Update and Subsequent Transmission Path Calculation;

[0104] The duration of the current network topology is determined based on satellite ephemeris data, yielding the end time of the current time slot, which is also the start time of the next time slot. Then, the network topology for the next time slot is determined based on the start time and time-varying graph model. Maximum capacity path prediction for the next time slot continues based on the start time and network topology. This process continues until data transmission is complete. Specifically, the current topology G(T) is determined based on satellite ephemeris data. k Duration of the transmission link in ) It further calculates the duration of the current topology, which is the current time slot T. k The end time can be expressed as:

[0105]

[0106] Simultaneously, the preceding time slot T k The end time is also the next time slot T. k+1 The start time of the next time slot is determined. After obtaining the determined start time based on the next time slot, the maximum capacity path prediction for the next time slot can continue based on step five. This process continues until data transmission is complete.

[0107] Step 7: Develop a routing scheme for maximizing LSN link transmission capacity;

[0108] Based on the selection of transmission links and the calculation of the maximum capacity path for each network topology in each time slot, a continuous LSN transmission link deployment and network traffic scheduling scheme is obtained.

[0109] This embodiment also provides a network-aware data transmission device for implementing the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0110] This embodiment provides a network-aware data transmission device, such as... Figure 5 As shown, it includes:

[0111] The data acquisition module 501 is used to acquire the operating status and network service time of all satellite nodes in the low-Earth orbit satellite network. The network service time includes multiple time slots.

[0112] Model building module 502 is used to build a time-varying graph model based on all satellite nodes, links between satellite nodes, and network service time. The link is the data transmission link between two adjacent satellite nodes.

[0113] The routing module 503 is used to calculate the link transmission capacity of each transmission link based on the time-varying graph model and the operating status, perform maximum link transmission capacity routing for each time slot, and obtain the data transmission scheme of the low-orbit satellite network. The transmission link is the data transmission link from the source node to the destination node.

[0114] In one alternative implementation, the model building module is specifically used to: construct a time-varying graph model with all satellite nodes as vertices of the graph model and the links between satellite nodes as edges of the vertices, where both vertices and edges are functions of network service time.

[0115] In one optional implementation, the routing module includes: a current topology determination unit, used to obtain the LEO satellite network topology of the current time slot based on a time-varying graph model and operating status; a current routing unit, used to calculate the link transmission capacity based on the LEO satellite network topology of the current time slot and perform routing for the maximum link transmission capacity of the current time slot; a time slot calculation unit, used to calculate the duration of the current time slot based on satellite ephemeris data and determine the start time of the next time slot; a next topology determination unit, used to obtain the LEO satellite network topology of the next time slot based on the start time of the next time slot and a time-varying graph model; and a next routing unit, used to calculate the link transmission capacity based on the LEO satellite network topology of the next time slot, perform routing for the maximum link transmission capacity of the next time slot, and use the transmission links corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme for the corresponding time slot of the LEO satellite network.

[0116] In one optional implementation, the current routing unit includes: a node acquisition unit, used to acquire the source node and destination node corresponding to the transmission link of data transmission in the current time slot; an adjacent capacity calculation unit, used to calculate the link transmission capacity of two adjacent satellites in the current time slot transmission link based on the source node and destination node and according to the low-Earth orbit satellite network topology of the current time slot; and a routing subunit, used to determine the link transmission capacity of each transmission link based on the link transmission capacity of two adjacent satellites, and take the transmission link with the largest link transmission capacity as the data transmission path.

[0117] In one optional implementation, the pathfinding subunit is specifically used to: traverse every node that may establish a link starting from the source node using the MST algorithm; calculate the link transmission capacity from the source node to the current node based on the link transmission capacity of two adjacent satellites; calculate the first distance between the current node and the destination node and the second distance between any next-hop node and the destination node; select the next-hop node based on the relationship between the first distance and the second distance; and use the selected next-hop node as the current node, repeating the steps of calculating the link transmission capacity, calculating the first distance and the second distance, and comparing the first distance and the second distance until the destination node is reached, thereby obtaining the transmission path from the source node to the destination node.

[0118] In one optional implementation, the operating status includes the transmission capacity of each satellite node; the adjacent capacity calculation unit is specifically used to: determine the transmission capacity already occupied by each satellite node in the current time slot based on the low-Earth orbit satellite network topology of the current time slot; determine the available transmission capacity of each satellite node based on the difference between the transmission capacity of each satellite node and the occupied transmission capacity; and take the smaller value of the available transmission capacity of each satellite node in two adjacent satellites as the link transmission capacity of the two adjacent satellites.

[0119] In one alternative implementation, the data acquisition module is specifically used to: acquire the operational status of all satellite nodes in the low-orbit satellite network using high-orbit satellites.

[0120] In this embodiment, the network-aware data transmission device is presented in the form of a functional unit. Here, a unit refers to an ASIC circuit, a processor and memory that execute one or more software or fixed programs, and / or other devices that can provide the above functions.

[0121] Further functional descriptions of the above modules and units are the same as those in the corresponding embodiments described above, and will not be repeated here.

[0122] This invention also provides a computer device having the above-described features. Figure 5 The device shown is for transmitting network-sensing data.

[0123] Please see Figure 6 , Figure 6 This is a schematic diagram of the structure of a computer device provided in an optional embodiment of the present invention, such as... Figure 6 As shown, the computer device includes one or more processors 10, memory 20, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The components communicate with each other via different buses and can be mounted on a common motherboard or otherwise installed as needed. The processors can process instructions executed within the computer device, including instructions stored in or on memory to display graphical information of a GUI on external input / output devices (such as display devices coupled to the interfaces). In some alternative implementations, multiple processors and / or multiple buses can be used with multiple memories and multiple memory modules, if desired. Similarly, multiple computer devices can be connected, each providing some of the necessary operations (e.g., as a server array, a group of blade servers, or a multiprocessor system). Figure 6 Take a processor 10 as an example.

[0124] Processor 10 may be a central processing unit, a network processor, or a combination thereof. Processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The programmable logic device may be a complex programmable logic device (CAMP), a field-programmable gate array (FPGA), a general-purpose array logic (GPA), or any combination thereof.

[0125] The memory 20 stores instructions executable by at least one processor 10 to cause at least one processor 10 to perform the method shown in the above embodiments.

[0126] The memory 20 may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the computer device as shown by a landing page for an app. Furthermore, the memory 20 may include high-speed random access memory and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some alternative embodiments, the memory 20 may optionally include memory remotely located relative to the processor 10, which can be connected to the computer device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0127] The memory 20 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as flash memory, hard disk or solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0128] The computer device also includes a communication interface 30 for communicating with other devices or communication networks.

[0129] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as computer code that can be recorded on a storage medium, or implemented as computer code downloaded via a network and originally stored on a remote storage medium or a non-transitory machine-readable storage medium and then stored on a local storage medium. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code, which, when accessed and executed by the computer, processor, or hardware, implements the methods shown in the above embodiments.

[0130] Although embodiments of the invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A method of transmitting network-aware data, characterized by, The method includes: The operational status and network service time of all satellite nodes in the low-Earth orbit satellite network are obtained, and the network service time includes multiple time slots; A time-varying graph model is constructed based on all satellite nodes, the links between satellite nodes, and the network service time, wherein the link is the data transmission link between two adjacent satellite nodes. Based on the time-varying graph model and the operating state, the link transmission capacity of each transmission link is calculated, and the maximum link transmission capacity path is found for each time slot to obtain the data transmission scheme of the low-orbit satellite network. The transmission link is the data transmission link from the source node to the destination node. The process of calculating the link transmission capacity of each transmission link based on the time-varying graph model and the operating state, and performing maximum link transmission capacity routing for each time slot to obtain the data transmission scheme of the low-Earth orbit satellite network includes: The low-Earth orbit satellite network topology for the current time slot is obtained based on the time-varying graph model and the operating status. Calculate the link transmission capacity based on the low-Earth orbit satellite network topology of the current time slot, and perform pathfinding for the maximum link transmission capacity of the current time slot; The duration of the current time slot is calculated based on satellite ephemeris data, and the start time of the next time slot is determined. The low-Earth orbit satellite network topology for the next time slot is obtained based on the start time of the next time slot and the time-varying graph model; The link transmission capacity is calculated based on the LEO satellite network topology of the next time slot, the maximum link transmission capacity is used to find the path for the next time slot, and the transmission link corresponding to the maximum link transmission capacity of each time slot is used as the data transmission scheme for the corresponding time slot of the LEO satellite network. Calculate the link transmission capacity based on the low-Earth orbit satellite network topology of the current time slot, and perform pathfinding for the maximum link transmission capacity of the current time slot, including: Based on the low-Earth orbit satellite topology network of the current time slot, obtain the source node and destination node corresponding to the transmission link of data transmission in the current time slot; Based on the source node and destination node, calculate the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the low-Earth orbit satellite network topology of the current time slot; The link transmission capacity of each transmission link is determined based on the link transmission capacity of two adjacent satellites, and the transmission link with the largest link transmission capacity is used as the data transmission path. The operational status includes the transmission capacity of each satellite node; Calculate the link transmission capacity between two adjacent satellites in the current time slot based on the low-Earth orbit satellite network topology of the current time slot, including: The transmission capacity already occupied by each satellite node in the current time slot is determined based on the low-Earth orbit satellite network topology of the current time slot; The available transmission capacity of each satellite node is determined based on the difference between its transmission capacity and the occupied transmission capacity. The smaller of the available transmission capacity of each satellite node in two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.

2. The method of claim 1, wherein, A time-varying graph model is constructed based on all satellite nodes, the links between satellite nodes, and the network service time, including: A time-varying graph model is constructed by using all satellite nodes as vertices and the links between satellite nodes as edges, where both the vertices and edges are functions of the network service time.

3. The method of claim 1, wherein, The link transmission capacity of each link is determined based on the link transmission capacity of two adjacent satellites. The transmission link with the largest transmission capacity is selected as the data transmission path, including: Starting from the source node, the MST algorithm is used to traverse every node that may establish a link; Calculate the link transmission capacity from the source node to the current node based on the link transmission capacity of the two adjacent satellites; Calculate the first distance between the current node and the destination node, and the second distance between any next-hop node and the destination node; Select the next hop node based on the relationship between the first distance and the second distance; The selected next-hop node is used as the current node. The steps of calculating the link transmission capacity, calculating the first distance and the second distance, and comparing the first distance and the second distance are repeated until the destination node is reached, thus obtaining the transmission path from the source node to the destination node.

4. The method of claim 1, wherein, Obtain the operational status of all satellite nodes in the low-Earth orbit satellite network, including: obtaining the operational status of all satellite nodes in the low-Earth orbit satellite network using high-Earth orbit satellites.

5. A network aware data transmission apparatus, characterized by The device includes: The data acquisition module is used to acquire the operating status and network service time of all satellite nodes in the low-Earth orbit satellite network, wherein the network service time includes multiple time slots; The model building module is used to build a time-varying graph model based on all satellite nodes, the links between satellite nodes, and the network service time, wherein the links are data transmission links between two adjacent satellite nodes. The routing module is used to calculate the link transmission capacity of each transmission link based on the time-varying graph model and the operating state, perform maximum link transmission capacity routing for each time slot, and obtain the data transmission scheme of the low-Earth orbit satellite network. The transmission link is a data transmission link from the source node to the destination node. The process of calculating the link transmission capacity of each transmission link based on the time-varying graph model and the operating state, and performing maximum link transmission capacity routing for each time slot to obtain the data transmission scheme of the low-Earth orbit satellite network includes: The low-Earth orbit satellite network topology for the current time slot is obtained based on the time-varying graph model and the operating status. Calculate the link transmission capacity based on the low-Earth orbit satellite network topology of the current time slot, and perform pathfinding for the maximum link transmission capacity of the current time slot; The duration of the current time slot is calculated based on satellite ephemeris data, and the start time of the next time slot is determined. The low-Earth orbit satellite network topology for the next time slot is obtained based on the start time of the next time slot and the time-varying graph model; The link transmission capacity is calculated based on the LEO satellite network topology of the next time slot, the maximum link transmission capacity is used to find the path for the next time slot, and the transmission link corresponding to the maximum link transmission capacity of each time slot is used as the data transmission scheme for the corresponding time slot of the LEO satellite network. Calculate the link transmission capacity based on the low-Earth orbit satellite network topology of the current time slot, and perform pathfinding for the maximum link transmission capacity of the current time slot, including: Based on the low-Earth orbit satellite topology network of the current time slot, obtain the source node and destination node corresponding to the transmission link of data transmission in the current time slot; Based on the source node and destination node, calculate the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the low-Earth orbit satellite network topology of the current time slot; The link transmission capacity of each transmission link is determined based on the link transmission capacity of two adjacent satellites, and the transmission link with the largest link transmission capacity is used as the data transmission path. The operational status includes the transmission capacity of each satellite node; Calculate the link transmission capacity between two adjacent satellites in the current time slot based on the low-Earth orbit satellite network topology of the current time slot, including: The transmission capacity already occupied by each satellite node in the current time slot is determined based on the low-Earth orbit satellite network topology of the current time slot; The available transmission capacity of each satellite node is determined based on the difference between its transmission capacity and the occupied transmission capacity. The smaller of the available transmission capacity of each satellite node in two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.

6. A computer device, comprising: include: A memory and a processor are communicatively connected, the memory stores computer instructions, and the processor executes the computer instructions to perform the network-aware data transmission method according to any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing the computer to perform the network-aware data transmission method according to any one of claims 1 to 4.

Images