Data transmission method, device, equipment, medium, product and chip system

Abstract

The invention provides a data transmission method and device, equipment, a medium, a product and a chip system. According to the method, when track layers of a first node and a destination node are the same, same-layer transmission processing is iteratively executed, and when track types of the first node and the destination node are the same and the destination node exists in neighbor nodes of the first node, the same-layer transmission processing is executed according to an inter-satellite link between the destination node and the first node. And transmitting the target data to the destination node. Or, when the target node does not exist in the neighbor nodes, the target neighbor node with the minimum two-dimensional space distance with the target node is used as the first node for the next same-layer transmission processing until the target data is transmitted to the target node, so that the data transmission path is shortened, the transmission delay is reduced, and the transmission efficiency is improved through a hop-by-hop iterative optimization mechanism. The problem of path redundancy caused by frequent relative movement change of satellites is avoided, and the inter-satellite data transmission efficiency is improved.

Description

Technical Field

[0001] This disclosure primarily relates to the field of satellite communication technology, and in particular to a data transmission method, apparatus, device, medium, program product, and chip system. Background Technology

[0002] As Low Earth Orbit Satellites (LEO) develop towards large-scale, multi-level orbital planes, satellites at different levels often transmit data through inter-level orbital links. Inter-level orbital links can reduce the number of hops in the transmission path and improve data transmission efficiency.

[0003] However, due to the frequent changes in the relative motion of satellites in orbit, inter-orbit links across different orbits are affected by orbital relative motion and the space environment, resulting in more frequent connection and disconnection. This significantly reduces the reliability of data transmission between satellites and causes severe end-to-end transmission delays. Current technologies for determining inter-satellite transmission paths suffer from insufficient utilization of inter-orbit links, high complexity in end-to-end routing calculations, and the generation of large amounts of routing table storage information, increasing unnecessary load and maintenance costs, consuming significant computing resources, and failing to efficiently adapt to large-scale, dynamically changing satellite network environments, thus greatly reducing the efficiency of data transmission between satellites. Summary of the Invention

[0004] Providing a mechanism to alleviate, reduce or eliminate at least one of the above problems would be beneficial.

[0005] In a first aspect, this disclosure provides a data transmission method applied to a first node in a space-based network, the method comprising:

[0006] When the orbital layers of the first node and the destination node are the same, the same-layer transmission process is iteratively executed until the target data is transmitted to the destination node; wherein, each same-layer transmission process includes:

[0007] When the first node and the destination node have the same orbit type, and the destination node exists among the neighboring nodes of the first node, the target data is transmitted to the destination node based on the inter-satellite link between the destination node and the first node; or,

[0008] If the destination node is not present among the neighboring nodes, the target neighboring node is used as the first node for the next same-layer transmission process. The target neighboring node is the neighboring node with the smallest two-dimensional spatial distance to the destination node.

[0009] In a second aspect, this disclosure provides a data transmission apparatus, the apparatus comprising:

[0010] The first processing unit is configured to iteratively execute same-layer transmission processing when the first node and the destination node are at the same orbital layer, until the target data is transmitted to the destination node;

[0011] The first processing unit includes a transmission subunit, wherein:

[0012] A transmission subunit is configured to transmit the target data to the destination node based on the inter-satellite link between the destination node and the first node when the orbit types of the first node and the destination node are the same, and the destination node exists among the neighboring nodes of the first node; or,

[0013] If the destination node is not present among the neighboring nodes, the target neighboring node is used as the first node for the next same-layer transmission process. The target neighboring node is the neighboring node with the smallest two-dimensional spatial distance to the destination node.

[0014] In a third aspect, this disclosure provides a computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement any of the data transmission methods described in the first aspect above.

[0015] In a fourth aspect, this disclosure provides a computer storage medium storing computer program instructions, which are executed by a processor using any of the data transmission methods described in the first aspect above.

[0016] In a fifth aspect, an embodiment of this disclosure provides a computer program product including computer program instructions, which, when executed by a processor, implement any one of the data transmission methods described in the first aspect above.

[0017] In a sixth aspect, an embodiment of the present disclosure provides a chip system for a computing device, including at least one processor, the at least one processor being configured to execute, individually or jointly, a computer program stored in the memory of the computer device described in the third aspect above, such that the computer device performs any of the data transmission methods described in the first aspect above.

[0018] It should be understood that the summary section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0019] The accompanying drawings are included to provide a further understanding of this disclosure; they are incorporated into and constitute a part of this disclosure. The drawings illustrate embodiments of this disclosure and, together with this specification, serve to explain the principles of this disclosure. In the drawings:

[0020] Figure 1 This is a schematic diagram of an application scenario provided by an embodiment of this disclosure;

[0021] Figure 2 This is a schematic flowchart of a data transmission method provided in an embodiment of this disclosure;

[0022] Figure 3 This is a schematic flowchart of a data transmission method provided in an embodiment of this disclosure;

[0023] Figure 4 This is a schematic flowchart of a data transmission method provided in an embodiment of this disclosure;

[0024] Figure 5 A schematic diagram illustrating the data transmission process of a three-layer satellite network provided in this application embodiment;

[0025] Figure 6 This is a schematic diagram of the structure of a data transmission device provided in an embodiment of this application;

[0026] Figure 7 This is a schematic diagram of the composition structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0027] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are merely some examples or embodiments of this disclosure. For those skilled in the art, these drawings can be applied to other similar scenarios without creative effort. Unless obvious from the context or otherwise specified, the same reference numerals in the drawings represent the same structures or operations.

[0028] In the following description and claims, unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains.

[0029] References to "an embodiment," "embodiment," "exemplary embodiment," etc., in this disclosure indicate that the described embodiments may include specific features, structures, or characteristics, but not every embodiment needs to include specific features, structures, or characteristics. Furthermore, such phrases do not necessarily refer to the same embodiment. Moreover, when a specific feature, structure, or characteristic is described in connection with an exemplary embodiment, whether explicitly described or not, those skilled in the art will recognize that such a feature, structure, or characteristic affects its connection to other embodiments.

[0030] As indicated in this disclosure, unless the context clearly indicates otherwise, the words "a," "an," "an," and / or "the" are not specifically singular and may include plural forms, unless the context clearly indicates otherwise. The term "a group of elements" or "a collection of elements" as used herein is intended to include one or more elements. It should also be understood that the terms "comprising," "including," "having," "possessing," "comprise," and / or "including," when used herein, specify the presence of the stated features, elements, and / or components, only indicating the inclusion of explicitly identified steps and elements, which do not constitute an exclusive list. A method or apparatus may also include other steps or elements, and therefore the presence or addition of one or more other features, elements, components, and / or combinations thereof is not excluded.

[0031] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps set forth in these embodiments do not limit the scope of this disclosure. It should also be understood that, for ease of description, the dimensions of the various parts shown in the drawings are not drawn to actual scale. Techniques, methods, and devices known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and devices should be considered part of the specification. In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values. It should be noted that similar reference numerals and letters in the following drawings denote similar items; therefore, once an item is defined in one drawing, it need not be further discussed in subsequent drawings.

[0032] In the description of this disclosure, it should be understood that the orientation or positional relationship indicated by directional terms such as "front, back, up, down, left, right", "horizontal, vertical, horizontal" and "top, bottom" is generally based on the orientation or positional relationship shown in the accompanying drawings and is only for the convenience of describing this disclosure and simplifying the description. Unless otherwise stated, these directional terms do not indicate or imply that the device or element referred to must have a specific orientation or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation on the scope of protection of this disclosure; the directional terms "inner" and "outer" refer to the inner and outer contours relative to the outline of each component itself.

[0033] For ease of description, spatial relative terms such as "above," "on top of," "on the upper surface of," "above," etc., are used herein to describe the spatial positional relationship of a device or feature as shown in the figures to other devices or features. It should be understood that spatial relative terms are intended to encompass different orientations in use or operation beyond the orientation of the device as described in the figures. For example, if the device in the figures were inverted, a device described as "above" or "on top of" other devices or structures would subsequently be positioned as "below" or "under" other devices or structures. Thus, the exemplary term "above" can include both "above" and "below." The device may also be positioned in other different ways (rotated 90 degrees or in other orientations), and the spatial relative descriptions used herein will be interpreted accordingly.

[0034] Furthermore, it should be noted that the use of terms such as "first" and "second" to define components is merely for the purpose of distinguishing the corresponding components. Unless otherwise stated, these terms have no special meaning and therefore should not be construed as limiting the scope of protection of this disclosure. Therefore, although the terms "first" and "second," etc., can be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, without departing from the scope of exemplary embodiments, a first element may be referred to as a second element, and similarly, a second element may be referred to as a first element. The term "and / or" as used herein includes any and all combinations of one or more of the listed terms. Furthermore, although the terms used in this disclosure are selected from commonly known and used terms, some terms mentioned in this disclosure may have been selected by the applicant at his or her judgment, and their detailed meanings are explained in the relevant sections of the description herein. Moreover, this disclosure should be understood not only by the actual terms used, but also by the meaning implied by each term.

[0035] As used herein, the term "satellite network equipment" refers to a node located on a satellite in a communications network. Terminal devices access the network and receive services through this node. Depending on the terminology and technology applied, satellite network equipment can refer to a base station (BS) or access point (AP) that serves as a satellite payload, such as a Node B (NodeB or NB), an evolved Node B (eNodeB or eNB), an NR NB (also known as a gNB), a Remote Radio Unit (RRU), a Radio Header (RH), a Remote Radio Header (RRH), or a relay node. An example of a relay node can be an Integrated Access and Backhaul (IAB) node. The Distributed Unit (DU) portion of an IAB node can perform the functions of a "satellite network equipment" and therefore can operate as a network equipment. In the following description, the terms "satellite network equipment," "BS," and "node" are used interchangeably.

[0036] The term "terminal device" refers to any terminal device capable of wireless communication. As an example and not a limitation, a terminal device may also be referred to as a communication device, user equipment (UE), subscriber station (SS), portable subscriber station, mobile station (MS), or access terminal (AT). This terminal device may include, but is not limited to, mobile phones, cellular phones, smartphones, Voice over IP (VoIP) phones, wireless local loop phones, tablets, wearable terminal devices, personal digital assistants (PDAs), portable computers, desktop computers, image capture terminal devices such as digital cameras, gaming terminal devices, music storage and playback devices, in-vehicle wireless terminal devices, wireless endpoints, mobile stations, laptop embedded devices (LEEs), laptop installed devices (LMEs), USB dongles, smart devices, wireless subscriber equipment (CPEs), Internet of Things (IoT) devices, watches or other wearable devices, head-mounted displays (HMDs), vehicles, drones, medical devices and applications (e.g., remote surgery), industrial devices and applications (e.g., robots and / or other wireless devices operating in the context of industrial and / or automated processing chains), consumer electronics devices, relay nodes, devices operating on commercial and / or industrial wireless networks, etc. The mobile terminal (MT) portion of an IAB node can perform the functions of a "terminal device" and therefore can operate as a terminal device. In the following description, the terms "terminal device," "communication device," "terminal," "user equipment," and "UE" are used interchangeably.

[0037] To facilitate understanding of the technical solutions provided in the embodiments of this disclosure, some key terms used in the embodiments of this disclosure will be explained below:

[0038] Space-based networks are network systems that provide communication, navigation, and monitoring services through space infrastructure such as satellites. This infrastructure consists of a series of satellites in geostationary, low Earth, or medium Earth orbits. Space-based networks can cover a wide area of ​​the Earth, especially remote or ocean areas inaccessible to traditional communication networks, and can be applied to various fields such as communication, weather monitoring, disaster early warning, military reconnaissance, and global positioning. Next-generation space-based networks, such as Starlink, aim to provide low-latency and high-bandwidth internet services, improving user experience.

[0039] LEO: Low Earth Orbit satellites, typically operating at an altitude of 200 to 2000 kilometers above the Earth's surface. Due to their relatively close proximity to the ground, they offer advantages such as low latency and high data transmission rates, and are widely used in fields such as communications and navigation.

[0040] Multi-layered mega-satellites: These are complex network structures comprising multiple orbital layers and a large number of satellites. While offering rich orbital layers and a vast number of satellites, they also introduce greater network complexity. In contrast, multi-layered mega-satellites in low Earth orbit (LEO) networks utilize satellites in different orbital planes to achieve global coverage, and employ inter-satellite links and cross-layer inter-orbit links to enhance connectivity between satellites.

[0041] Inter-Satellite Link (ISL): A communication link between satellites that allows them to communicate directly with each other without relying on ground stations. In large low-Earth orbit constellation networks, ISLs connect different satellites through multiple relay nodes, forming continuous paths.

[0042] Inter-layer links: also known as cross-level orbital links. In a multi-layer satellite network, these are communication links established between satellites at different orbital levels. Multi-layer satellite networks typically include multiple orbital planes, and cross-level inter-orbital links can connect satellites located at different orbital planes, providing higher network transmission efficiency and optimizing communication latency. In a multi-layer satellite network, the satellite nodes used to establish cross-level links are called cross-level link-establishing nodes. These nodes connect satellites at different orbital levels, providing cross-level communication capabilities.

[0043] Ascending satellite: refers to a satellite in the ascending phase of its orbit, where the altitude of the satellite's orbit is continuously increased. The purpose is to place the satellite in a predetermined high orbit position to perform specific tasks, such as communication, remote sensing, or scientific observation.

[0044] De-orbiting satellite: This refers to a satellite whose orbit is in the descent phase, meaning the altitude of the satellite's orbit is gradually decreasing. De-orbiting can be due to orbital decay, fuel consumption, or re-entry into the atmosphere.

[0045] Hop count: The number of intermediate nodes data passes through during its transmission from the source to the destination. In satellite networks, fewer hops generally result in lower latency.

[0046] The International Celestial Reference Frame (ICRF) is a fixed inertial reference frame centered on the Earth's center of mass, used to describe the position and motion of satellites in space. In the ICRF, the three-dimensional coordinates (X, Y, Z) of each satellite at any given time can be calculated using a precise orbital propagation model based on orbital elements (such as orbital inclination and right ascension of the ascending node) and time information.

[0047] Routing: The process of selecting the best path from the source node to the destination node of a data packet in a network. In satellite networks, the complexity of routing increases with the number of satellites and the dynamic changes in links. Shortest path algorithms are commonly used in related technologies to calculate the shortest path for a route.

[0048] Shortest path algorithm: An algorithm for calculating the shortest path between nodes in a network. The most widely used algorithm is Dijkstra's algorithm, a classic algorithm for solving the single-source shortest path problem in weighted graphs. This algorithm finds the shortest path from the source node to the target node by selecting the path with the minimum cost.

[0049] Snapshot technology based on virtual topology discretizes the dynamic changes of the satellite network into multiple time slices, each corresponding to a fixed virtual topology. The snapshot mechanism maintains a routing table within each time slice and switches to the routing information of the next time slice as needed. Within each time slice, the system calculates the routing information based on the current satellite position and link status. This mechanism is similar to transforming a dynamic network problem into multiple static scenarios and solving them one by one. However, due to the highly dynamic nature of the LEO satellite network and the frequent changes in link connections, snapshot technology struggles to cope with the rapidly changing link environment.

[0050] The design concept of the embodiments of this disclosure is briefly introduced below:

[0051] As LEO evolves towards a large-scale, multi-level orbital plane, satellites at different levels often transmit data through inter-level inter-orbit links. Inter-level inter-orbit links can reduce the number of hops in the transmission path and improve data transmission efficiency.

[0052] However, due to the frequent changes in the relative motion of satellites in different orbits, inter-orbit links across different layers are affected by orbital relative motion and the space environment, resulting in more frequent connection and disconnection. This significantly reduces the reliability of data transmission between satellites and causes severe end-to-end transmission delays. Related technologies typically use snapshot technology based on virtual topology and traditional shortest path algorithms to determine inter-satellite transmission paths. This not only underutilizes inter-layer links and results in high complexity of end-to-end routing calculations, but also generates a large amount of routing table storage information, increasing unnecessary load and maintenance costs, consuming significant computing resources, and failing to efficiently adapt to large-scale, dynamically changing satellite network environments, thus greatly reducing the efficiency of data transmission between satellites.

[0053] In view of the above problems, this disclosure provides a data transmission method applied to a first node in a space-based network to improve data transmission efficiency between satellites. When the first node and the destination node have the same orbital layer, this method iteratively executes same-layer transmission processing to transmit the target data to the destination node, avoiding unnecessary intermediate node forwarding, greatly shortening the transmission path, reducing transmission latency between satellites, and improving data transmission efficiency and immediacy. In each same-layer transmission process, when the first node and the destination node have the same orbital type and the destination node exists among the first node's neighboring nodes, this disclosure transmits the target data to the destination node based on the inter-satellite link between the destination node and the first node. Alternatively, if the destination node is not found among the neighboring nodes, the target neighbor node with the smallest two-dimensional spatial distance to the destination node is selected as the first node for the next same-layer transmission process. This process continues iteratively, ensuring that the first node for each transmission is determined based on the optimality of the distance between neighboring nodes. This shortens the data transmission path and reduces data transmission latency by optimizing the distance, effectively avoiding the path redundancy problem caused by random node selection. This iterative optimization mechanism ensures the global optimality of the transmission path, avoids path redundancy caused by frequent changes in the relative motion of satellites, and makes data transmission more efficient and stable.

[0054] The following will refer to Figure 1 This disclosure describes in detail the principles and implementation of the invention. The solutions provided in the embodiments of this disclosure are applicable to any satellite network with a space-based network or similar architecture, especially in scenarios involving data transmission between satellites, including but not limited to mega-low-Earth orbit satellite networks such as the Walker constellation. Figure 1 As shown, it is a schematic diagram of an application scenario provided by an embodiment of this disclosure. Figure 1 An exemplary satellite communication network 100 in which embodiments of the present disclosure may be implemented is shown, including any one of a plurality of satellite network devices 110, a terminal device 120A served by satellite network device 110A, and a terminal device 120B served by satellite network device 110B.

[0055] Satellite network device 110, also known as a satellite node in this embodiment, refers to an artificial satellite placed in a satellite orbit, acting as a relay station in the air. It amplifies electromagnetic waves transmitted from a ground station and sends them back to another ground station to provide services such as communication, remote sensing, and navigation. This includes the first node, destination node, neighboring nodes, same-layer nodes, boundary nodes, and peer nodes in this embodiment. Satellite network device 110 is equipped with communication equipment and can communicate with ground stations, other satellite nodes in the constellation, and terminal devices.

[0056] Satellite network device 110 can transmit data and control information to terminal devices 120A and 120B, and terminal devices 120A and 120B can also transmit data and control information to satellite network device 110. In satellite communication network 100, a satellite that covers a user and provides network access service to that user is called the user's access satellite, for example... Figure 1 In this context, satellite network device 110A is the access satellite corresponding to terminal device 120A, and satellite network device 110B is the access satellite corresponding to terminal device 120B. When the access satellites of the two users are different, that is, the source node and destination node of the data transmission process between the two users are different, a multi-hop forwarding path is needed between the satellites to realize the communication connection. The data transmission method provided in this embodiment can realize the inter-satellite data transmission between the terminal devices of two users through the satellite network.

[0057] Terminal devices 120A and 120B can also be collectively referred to as terminal device 120. Satellite communication network 100 can provide service cell 130 to serve terminal devices 120A and 120B. Figure 1 In the example, the satellite communication network 100 also includes a ground station 140, a gNB 150, a next-generation core network (NGC) 160, and a data network 170. The satellite communication network may include satellite orbits such as geostationary earth orbit (GEO), medium earth orbit (MEO), or LEO.

[0058] Ground station 140 acts as a gateway, connecting non-terrestrial networks and public data networks. gNB 150 acts as an access network, connecting ground station 140 to the core network NGC 160. NGC 160 can also connect to data network 170 to provide services such as internet content. It will be understood that satellite communication network 100 is not required to include... Figure 1 All elements shown in the table.

[0059] Communication in communication network 100 can conform to any suitable standard, but is not limited to Long Term Evolution (LTE), LTE Evolution, LTE-Advanced (LTE-A), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access (CDMA), and Global System for Mobile Communications (GSM). Furthermore, communication can be performed according to any generation of communication protocols currently known or developed in the future. Examples of communication protocols include, but are not limited to, first-generation (1G), second-generation (2G), 2.5G, 2.75G, third-generation (3G), fourth-generation (4G), 4.5G, fifth-generation (5G), and sixth-generation (6G) communication protocols.

[0060] It should be noted that, in this embodiment of the disclosure, the number of satellite network device 110, terminal devices 120A and 120B, and serving cell 130 can be one or more. Figure 1 The illustrations shown are for illustrative purposes only and are not intended to impose any limitations. The actual number and communication methods are not limited and are not specifically limited in the embodiments disclosed herein. The communication network 100 may include any suitable number of satellite network devices, terminal devices, and serving cells suitable for implementing embodiments of this disclosure. It should be noted that the terms "cell" and "serving cell" are used interchangeably herein.

[0061] Of course, the methods provided in the embodiments of the present invention are not limited to those described above. Figure 1 The application scenarios shown can also be used in other possible scenarios, and the embodiments of the present invention do not impose limitations. Regarding the above... Figure 1 The functionalities that each device in the application scenario shown can achieve will be described in subsequent method embodiments, and will not be elaborated on here.

[0062] The data transmission method provided by the exemplary embodiments of this disclosure will be described below with reference to the accompanying drawings and the application scenarios described above. It should be noted that the application scenarios described above are only shown to facilitate understanding of the spirit and principles of this disclosure, and the embodiments of this disclosure are not limited in any way.

[0063] Figure 2 A flowchart of a data transmission processing method 200 according to an embodiment of the present disclosure is shown. This embodiment is mainly used for a first node in a space-based network. The first node can be any satellite node in the space-based network. For example, iterative same-layer transmission processing is performed starting from the source node as the first node, transmitting data from each first node to the destination node node by node.

[0064] Method 200, when the orbital layers of the first node and the destination node are the same, iteratively performs same-layer transfer processing starting from the first node until the target data is transmitted to the destination node. It should be understood that method 200 may include additional steps not shown and / or some shown steps may be omitted, and the scope of this disclosure is not limited thereto. In this embodiment, since the same-layer transfer processing is similar for each iteration, a single iteration is used as an example for description. The specific implementation flow of this method is as follows:

[0065] Step 201: When the first node and the destination node have the same orbit type, and the destination node exists among the neighboring nodes of the first node, the target data is transmitted to the destination node based on the inter-satellite link between the destination node and the first node.

[0066] In this embodiment, each satellite node has multiple neighboring nodes, and an inter-satellite link for data transmission is established between them. Therefore, in each intra-layer transmission process, when the orbit types of the first node and the destination node are the same, and the destination node exists among the neighboring nodes of the first node, it is determined that an inter-satellite link has been obtained between the first node and the destination node. Thus, the target data is transmitted to the destination node through the inter-satellite link, completing the intra-layer transmission process.

[0067] In some embodiments, based on the multiple neighboring nodes corresponding to the first node, it can be determined whether each neighboring node is the same as the destination node. If there is a first neighboring node that is the same as the destination node, it is determined that the destination node exists among the neighboring nodes of the first node, and it is determined that the inter-satellite forwarding path from the first node to the destination node has been established.

[0068] In some embodiments, this disclosure may determine multiple neighboring nodes corresponding to the first node based on the orbit information of the first node. The neighboring nodes include two satellite nodes in the same orbit and adjacent in position to the first node (i.e., co-orbital neighboring nodes), and two satellite nodes in adjacent orbits and at the same position to the first node. Then, inter-satellite links are established between the first node and each neighboring satellite to transmit data via these inter-satellite links.

[0069] In some embodiments, taking the Walker constellation as an example, the Walker constellation has clearly defined satellite orbital parameters such as the number of orbital planes (Np), the number of satellites per orbit (Mp), the orbital inclination (α), and the phase factor (F). According to the above satellite orbital parameters, for each satellite node within the same orbital layer, its two adjacent satellite nodes in the same orbit (i.e., co-orbital neighbor nodes) and two satellite nodes at the same position above and below adjacent orbits are considered its neighbor nodes. Four inter-satellite links are then established between each satellite node and its four neighbor nodes. Taking the first node as S... a*b The destination node is S c*dFor example, 'a' represents the 'a'th orbit in the constellation, and 'b' represents the 'b'th satellite in the 'a'th orbit; the destination node follows the same logic. According to the rules for establishing inter-satellite links, the first node connects with its four neighboring nodes S... a*(b-1) S a*(b+1) S (a-1)*b S (a+1)*b There are four inter-satellite links. It is determined whether the four neighboring nodes and the destination node are the same node. If they are the same node, the inter-satellite forwarding path has been determined, and the target data can be directly transmitted from the first node to the destination node through the inter-satellite links.

[0070] Step 202: If the destination node is not found among the neighboring nodes, the target neighboring node shall be used as the first node for the next same-layer transmission process.

[0071] In this embodiment of the disclosure, the target neighbor node is the neighbor node with the smallest two-dimensional spatial distance to the destination node. This ensures that each transmission selects the path closest to the destination node, avoiding transmission delays caused by detours or lengthy paths, shortening the transmission path length between the source node and the destination node, minimizing the possibility of invalid jumps, and improving the efficiency of data transmission.

[0072] In some embodiments, when the destination node is not present among the neighboring nodes of the first node, the neighboring node with the smallest two-dimensional spatial distance from the destination node can be determined from among the neighboring nodes by the relative size relationship between the two-dimensional spatial distances between each neighboring node and the destination node, i.e., the target neighboring node, and it can be used as the first node for the next same-layer transmission process until the target data is transmitted to the destination node.

[0073] In some embodiments, this disclosure can obtain the two-dimensional spatial distance between each neighbor node and the destination node based on their respective spatial locations. Then, based on the relative magnitudes of these two-dimensional spatial distances, the neighbor node with the smallest two-dimensional spatial distance is selected as the target neighbor node. Thus, by calculating the spatial distance between nodes in real time, this adapts to the dynamically changing topology of the satellite network, ensuring the dynamism and flexibility of path selection. This ensures that each transmission selects the path closest to the destination node, avoiding transmission delays caused by detours or lengthy paths, shortening the transmission path length between the source and destination nodes, minimizing the possibility of invalid hops, and improving data transmission efficiency.

[0074] In some embodiments, this disclosure utilizes satellite orbital elements (TLE) and orbital mechanics models to calculate the three-dimensional spatial coordinates of each satellite node in the ICRF coordinate system at any given time. Using these three-dimensional spatial coordinates, the two-dimensional spatial distance between two satellite nodes is calculated, transforming the complex three-dimensional spatial distance into a two-dimensional spatial distance. This reduces computational resource consumption and improves computational and data transmission efficiency. Assuming that in a geocentric inertial frame, the spatial coordinates of a neighboring node are (x1, y1, z1) and the spatial coordinates of the destination node are (x2, y2, z2), the first distance d between them can be calculated using the following formula:

[0075]

[0076] Thus, the neighboring node S is calculated separately. a*(b-1) S a*(b+1) S (a-1)*b S (a+1)*b With the destination node S c*d The first distance is selected from the target node S. c*d The target neighbor node with the smallest two-dimensional spatial distance is taken as the next hop node, that is, the first node of the next same-layer transmission process. Its four corresponding neighbor nodes and four inter-satellite links are determined, and the above same-layer transmission process is repeated until the target data is transmitted to the destination node.

[0077] In some embodiments, satellite nodes within the same constellation layer can be categorized into two orbit types based on their flight direction: ascending satellites and descending satellites. Ascending satellites increase their nadir latitude during flight, while descending satellites decrease their nadir latitude. Each orbit has an equal number of ascending and descending segments, and the satellite's ascending or descending status changes with its motion. Therefore, when a user terminal is simultaneously covered by multiple satellites, its inter-satellite relay path and corresponding path hop count will significantly differ depending on the orbit type of the accessing satellites. For example, when user 1 accesses an ascending satellite and user 2 also accesses an ascending satellite, the inter-satellite relay path required to connect the two users can be directly achieved through same-orbit and different-orbit connections. When User 2's access satellite switches to a de-orbiting satellite, due to the intense relative motion between satellites flying in different directions, it is generally impossible to establish an inter-satellite link between the ascending and de-orbiting satellites. Inter-satellite links between different types of satellites will only be established at the junctions of different types of satellites in the same orbital plane. Therefore, the inter-satellite relay path between satellites of different orbital types needs to detour from high-latitude regions, resulting in additional relay hops.

[0078] Therefore, as Figure 3As shown, to improve the data transmission efficiency between a first node and a destination node of different track types at the same level, this disclosure also provides another data transmission method 300. When the first node and the destination node are at the same track level, during the iterative execution of same-level transmission processing starting from the first node, this disclosure further determines whether the track types of the first node and the destination node are the same. If the track types of the first node and the destination node are different, different same-level transmission processes are iteratively executed. Since the same-level transmission processing process is similar in each iteration, a single iteration is used as an example for description. The specific implementation flow of this method is as follows:

[0079] Step 301: When the track types of the first node and the destination node are different, determine the target's neighboring nodes on the same track.

[0080] In this embodiment of the disclosure, the target parallel neighbor node is the neighbor node with the smallest two-dimensional spatial distance to the destination node and located on the same track as the first node. In some embodiments, when the track types of the first node and the destination node are different, parallel neighbor nodes on the same track as the first node can be determined from multiple neighbor nodes of the first node, and the target parallel neighbor node closest to the destination node can be selected as the next hop node by calculating the two-dimensional spatial distance between each parallel neighbor node and the destination node.

[0081] In some embodiments, this disclosure obtains the two-dimensional spatial distance between each co-orbiting neighbor node and the target node based on their respective spatial positions. According to the relative magnitudes of the two-dimensional spatial distances, the co-orbiting neighbor node corresponding to the smallest two-dimensional spatial distance is selected as the target co-orbiting neighbor node. For example, two satellite nodes in the same orbit preceding and following the first node are considered as its co-orbiting neighbors. The three-dimensional spatial coordinates of each co-orbiting neighbor node and the target node are calculated using TLE and orbital mechanics models, and the two-dimensional spatial distance between each co-orbiting neighbor node and the target node is calculated using these three-dimensional spatial coordinates.

[0082] Step 302: Transmit the target data to the forwarding node according to the track direction of the target's neighboring nodes on the same track.

[0083] In this embodiment, the forwarding node is a satellite node that exceeds the orbital boundary and has available inter-satellite links in adjacent orbits. After selecting a neighboring node in the same orbit as the target as the next-hop node, this embodiment continues to forward the target data hop-by-hop among satellites of the same orbital type. During this time, the path is always transmitted between satellites of the same orbital type until the critical point of the orbital boundary is reached. When the forwarding path crosses the orbital boundary, the inter-satellite links between satellites of the same orbital type end, and the cross-orbital type inter-satellite link conversion phase begins. At this point, a satellite node in an adjacent orbit with available inter-satellite links needs to be selected as the forwarding node. The orbital type of this forwarding node will be the same as the target node, thus completing the cross-orbital type inter-satellite forwarding path.

[0084] In some embodiments, the spatial position of each satellite at any given time is calculated based on the satellite orbital elements, and the first node S is calculated based on the spatial position. a*b Two satellite nodes S in the same orbit a*(b-1) S a*(b+1) (i.e., neighboring nodes on the same track), and the destination node S c*d The two-dimensional spatial distance between them is determined, and the node with the smallest two-dimensional spatial distance, i.e., the node with the smallest distance to the destination node S, is selected. c*d The nearest neighbor node in the same orbit as the target satellite is used as the next hop node. Data is forwarded along the orbital direction of this neighbor node until the boundary of the orbit with the highest latitude is crossed. Each satellite node periodically collects its own orbital parameters and position data, including longitude, latitude, and altitude. When a satellite is moving along its orbit, if its latitude changes from an upward trend to a downward trend at a certain moment, it means that the satellite has reached the point of highest latitude in that orbit, i.e., the boundary of the orbit with the highest latitude. After crossing the boundary of the highest latitude, the satellite node with available inter-satellite links in adjacent orbits is designated as S. e*f Taking a relay node as an example, the relay node has the same orbit type as the destination node, either a descending or ascending orbit, to ensure that the satellite can continue data transmission efficiently and seamlessly when the orbit changes, avoiding link interruption or delay problems caused by different orbit types, and improving the efficiency of inter-satellite data transmission.

[0085] Step 303: Designate the forwarding node as the first node for this same-layer transmission process.

[0086] In this embodiment of the disclosure, when transmitting data from the first node to the forwarding node, since the forwarding node and the destination node have the same track type, the data transmission from the forwarding node to the destination node can be implemented by treating the forwarding node as the first node of the same-layer transmission process and continuing to execute the same-layer transmission process under the same track type in the aforementioned steps 201 to 202.

[0087] It is worth mentioning that the specific implementation process of steps 201 to 202 has been explained in the previous specific examples, and will not be repeated here.

[0088] In some embodiments, when the first node and the destination node are not in the same orbital layer, the inter-satellite transmission path between them is divided into: from the first node to the boundary node of the same orbital layer, from the boundary node to the peer node of the adjacent orbital layer, from the peer node to the boundary node of the same orbital layer, and so on recursively until the target data is transmitted from the first node to the destination node, thereby increasing the diversity of end-to-end paths, improving the reliability of data transmission, and reducing end-to-end latency.

[0089] like Figure 4 The diagram illustrates another data transmission method 400 provided in this embodiment. When the orbital layers of the first node and the destination node are different, this method 400 iteratively performs cross-layer transmission processing starting from the first node until the target data is transmitted to the destination node. It should be understood that method 400 may include additional steps not shown and / or some shown steps may be omitted, and the scope of this disclosure is not limited thereto. In this embodiment, since the cross-layer transmission processing is similar for each iteration, a single iteration is used as an example for description. The specific implementation flow of this method is as follows:

[0090] Step 401: Select at least one boundary node and the corresponding peer node from multiple nodes at the same level of the first node.

[0091] In this embodiment, each satellite node has multiple nodes in its orbital layer. One or more satellite nodes can be selected from these nodes as boundary nodes. The more boundary nodes selected, the more accurate the inter-satellite relay path calculation. Next, satellites in adjacent orbital layers corresponding to each boundary node can be considered its peer nodes. There is an inter-layer link between each boundary node and its corresponding peer node that allows direct data transmission.

[0092] In some embodiments, for each boundary node, the satellite node adjacent to its orbital layer and with the longest link duration can be selected as the peer node to establish an inter-layer link. This ensures the stability of the communication link between satellites, especially in scenarios requiring stable long-term transmission. A long-term available link can reduce frequent link switching and signal interruptions, improving the reliability of data transmission. Alternatively, the satellite node adjacent to the boundary node's orbital layer and with the shortest link duration can be selected as the peer node to establish an inter-layer link. Data transmission can begin immediately after the link is established, improving the utilization rate of available link resources in a short period. This is particularly effective in scenarios requiring rapid transmission of large amounts of data in a short time, reducing latency in path planning and shortening end-to-end transmission delay. Alternatively, a satellite node adjacent to its orbital layer and with the same orbital type can be selected as the peer node to establish an inter-layer link. Satellite nodes with the same orbital type have similar orbits and physical parameters, resulting in less signal attenuation during transmission, improving communication stability and reliability, and is particularly suitable for high-quality, low-error-rate transmission scenarios. It is worth mentioning that the embodiments of this disclosure can select one or more combinations of the above schemes, and other satellite nodes can be selected as peer nodes according to the actual needs of the scenario. The embodiments of this disclosure do not impose specific limitations in this regard.

[0093] Step 402: When the orbital layers of the peer node and the destination node are the same, the target data is transmitted to the destination node according to the same-layer transmission processing and inter-layer link.

[0094] In this embodiment of the disclosure, to further reduce the number of data transmission hops and improve data transmission efficiency, different transmission processing procedures can be executed based on whether the orbital layers of the peer node and the destination node are the same. When it is determined that the peer node with the boundary node link is on the same orbital layer as the destination node, the boundary node corresponding to the current orbital layer of the first node and the adjacent orbital layer is directly connected to the destination node. At this time, the inter-satellite forwarding path between the first node and the destination node can be divided into: a forwarding path within the same layer from the first node to the boundary node, and a cross-layer forwarding path from the boundary node to the destination node. Therefore, by combining same-layer transmission processing and inter-layer links for cross-layer transmission, this embodiment of the disclosure can transmit the target data to the destination node.

[0095] In some embodiments, when the peer node and the destination node are on the same orbital layer, this disclosure iteratively executes same-layer transmission processing starting from the first node until the target data is transmitted to the boundary node. Then, based on the inter-layer link between the boundary node and the peer node, the target data is transmitted to the destination node. Specifically, for the first node and the boundary node, since this path is within the same orbital layer, there is no need to cross inter-layer links; the same-layer transmission processing described in the previous embodiments can be used directly to transmit the target data from the first node to the boundary node. For the boundary node and the destination node, since the peer node and the destination node are on the same orbital layer, the boundary node can directly transmit data to the peer node via the inter-layer link, and the peer node transmits the target data to the destination node via same-layer transmission processing. Thus, this disclosure determines the optimal path between the first node and the boundary node, and between the peer node and the destination node, using the same-layer shortest path calculation method. The target data is then forwarded from the boundary node to the peer node via the established inter-layer link, so that the peer node can transmit the target data to the destination node at the same layer, completing the data transmission. The method of determining the above transmission path minimizes the use of cross-layer links, optimizes data transmission latency, and improves the transmission efficiency between satellites.

[0096] Step 403: When the orbital layers of the peer node and the destination node are different, obtain the first spatial vector between each peer node and the first node, and the second spatial vector between the first node and the destination node.

[0097] In this embodiment, when it is determined that the peer node of each boundary node is not in the same orbital layer as the destination node, it means that the boundary node of the current orbital layer of the first node and the adjacent orbital layer cannot be directly connected to the destination node. The target data needs to be transmitted to the next-hop node closest to the destination node to obtain the inter-satellite forwarding path with the highest transmission efficiency. Therefore, this embodiment can use a spatial vector calculation method to ensure that the path selected for each transmission is the shortest and most direct, reducing unnecessary path detours. The peer node of the boundary node is located in the adjacent layer, and the satellite node directly connected to the boundary node through the inter-layer link represents the boundary node of the current orbital layer connected to the entrance satellite of the adjacent layer through the inter-layer link. The accuracy of the transmission direction is crucial during path forwarding. By calculating the spatial vector from the first node to the peer node, the transmission direction of each candidate path in three-dimensional space can be obtained more clearly, thus more intuitively determining the shortest or closest ideal transmission path, significantly reducing the computational complexity of cross-layer paths and improving data transmission efficiency.

[0098] In some embodiments, when the peer node and the destination node are different for each boundary node, the second spatial vector I between the first node and the destination node will be calculated respectively. sdAnd the first set of spatial vectors {I} between the first node and the peer node connected to the boundary node of this layer. se1 , ...I seM Spatial vectors represent the relative positional relationship between two nodes, that is, the distance and direction between them in three-dimensional space, which provides the basis for the next step of calculating the vector angle. Taking the geocentric inertial frame as an example, the coordinates of the first node are (X... S ,Y S Z S The coordinates of the target node are (X... D ,Y D Z D The coordinates of each boundary node are {(X D1 ,Y D1 Z D1 )…(X DM ,Y DM Z DM For each boundary node, its opposite node coordinates are: {(X)} E1 ,Y E1 Z E1 )…(X EM ,Y EM Z EM )}.

[0099] For each peer node, compute the first spatial vector I from the first node to that peer node. seM :

[0100] IseM=(XS-XEM, YS-YEM, ZS-ZEM)

[0101] Similarly, calculate the second spatial vector I from the first node to the destination node. sd :

[0102] Isd = (XS-XD, YS-YD, ZS-ZD)

[0103] Step 404: Set the target boundary node as the first node for the next cross-layer transmission process.

[0104] In this embodiment, the vector angle between the first spatial vector and the second spatial vector corresponding to the target boundary node is the smallest. Therefore, by comparing the vector angles between each first spatial vector and the second spatial vector, this disclosure can determine which boundary node's transmission path is closer to the shortest transmission path or ideal transmission direction between the first node and the destination node. This allows the selection of the corresponding target boundary node as the next-hop node, i.e., the first node for the next cross-layer transmission process. In this way, the spatial position and direction corresponding to different candidate paths are accurately calculated, ensuring that the path selected for each transmission is the shortest and most direct, reducing unnecessary path detours and invalid path jumps, improving the efficiency of cross-layer transmission, and thus shortening the overall transmission path and improving data transmission efficiency.

[0105] In some embodiments, the formula for calculating the included angle θ between vectors can be as follows:

[0106]

[0107] Where θ represents the angle between the first spatial vector and the second spatial vector. A smaller vector angle means that the transmission path is closer to the ideal transmission direction between the first node and the destination node, which is more in line with the requirements of fast transmission.

[0108] I seM I represents the first spatial vector from the first node to the opposite node. sd The second spatial vector represents the distance from the first node to the destination node.

[0109] In some embodiments, when the target boundary node is used as the first node for the next cross-layer transmission process, the present disclosure repeats the aforementioned steps to obtain the boundary node corresponding to the first node. This process is iterated until a peer node corresponding to a boundary node is located in the same orbit layer as the destination node. Then, in the orbit layer of the first node, a boundary node with the same orbit type as the destination node is selected as the cross-layer node for same-layer transmission processing and inter-layer linking, transmitting the target data to the destination node.

[0110] Please refer to Figure 5 As shown, taking a data transmission path example in a three-layer low-Earth orbit satellite network, the data is transmitted from the source node in the first orbital layer as the first node in the initial transmission process. After multiple intra-layer and cross-layer transmission processes, the target data is transmitted to the destination node in the third orbital layer. The source node is located in the first orbital layer, which is different from the orbital layer of the destination node, requiring cross-layer transmission processing. First, the source node selects multiple boundary nodes from among the multiple intra-layer nodes, for example, the... Figure 5As shown in Figure x, D1, D2, and D3. For each boundary node's corresponding peer nodes E1, E2, and E3, the first spatial vector between each peer node and the source node is obtained. Based on the second spatial vector between the source and destination nodes, the vector angles between the first and second spatial vectors are obtained, as shown in Figure x above: a1, b1, and c1. The direction pointing to the smallest spatial vector angle a1 is selected from these angles to determine the optimal peer node E1 and the corresponding boundary node D1. Thus, the transmission path of the target data from the first orbital layer to the second orbital layer is obtained, i.e., from the source node to the boundary node D1 in the same orbital layer to the peer node E1 in the second orbital layer. There is an inter-layer link between boundary node D1 and its peer node E1, through which the target data can be directly transmitted across layers. The routing selection between the source node and the boundary node D1 can be achieved through intra-layer transmission processing. This involves determining whether the source node's multiple neighboring nodes are identical to the boundary node D1. If they are all different, the neighboring node with the smallest first distance from the boundary node D1 is selected as the first node for the next intra-layer transmission process. This process is iterated until the neighboring nodes of the current first node are identical to the boundary node. Then, the target data is transmitted to the boundary node D1 via the inter-satellite link between the first node and its neighboring nodes. Similarly, in the cross-layer transmission process of target data from the second orbital layer E1 to the destination node in the third orbital layer, E1 is used as the first node for this cross-layer transmission process. Multiple boundary nodes are selected from its corresponding intra-layer nodes, for example... Figure 5 As shown, d1, d2, and d3 correspond to e1, e2, and e3 as their respective peer nodes. Obtain the first spatial vector between each peer node and the first node, and based on the second spatial vector between the first node and the destination node, obtain the vector angle between each first spatial vector and the second spatial vector, as shown above. Figure 5 The spatial vectors shown have angles a2, b2, and c2. The direction pointing to the smallest spatial vector angle a2 is selected from these to determine the optimal peer node e3 and the corresponding boundary node d1. This yields the transmission path of the target data from the second orbital layer to the third orbital layer, i.e., from E1 to the boundary node d3 in the same orbital layer, and then to the peer node e3 in the third orbital layer. When the target data is transmitted to node e3 in the third orbital layer, since the destination node and e3 belong to the same orbital layer, same-layer transmission processing is performed to transmit the target data from e3 to the destination node, completing the final data transmission.

[0111] It is worth mentioning that flowcharts are used in this disclosure to illustrate the operations performed by the system according to embodiments of this disclosure. It should be understood that the preceding or following operations are not necessarily performed in exact order. Instead, various steps can be processed in reverse order or simultaneously. Furthermore, other operations may be added to these processes, or one or more steps may be removed from these processes.

[0112] The basic concepts have been described above. It is clear that the above disclosure is merely illustrative and does not constitute a limitation of this disclosure. Although not explicitly stated herein, various modifications, improvements, and corrections may be made to this disclosure by those skilled in the art. Such modifications, improvements, and corrections are suggested in this disclosure and therefore remain within the spirit and scope of the exemplary embodiments of this disclosure.

[0113] Furthermore, this disclosure uses specific terms to describe embodiments of the present disclosure. For example, "an embodiment," "one embodiment," and / or "some embodiments" refer to a particular feature, structure, or characteristic associated with at least one embodiment of the present disclosure. Therefore, it should be emphasized and noted that references to "an embodiment," "one embodiment," or "an alternative embodiment" in different locations throughout this specification do not necessarily refer to the same embodiment. Moreover, certain features, structures, or characteristics in one or more embodiments of the present disclosure can be appropriately combined.

[0114] Please see Figure 6 Based on the same inventive concept, embodiments of this application also provide a data transmission device 60, which includes:

[0115] The same-layer transmission unit 601 is used to iteratively execute same-layer transmission processing when the first node and the destination node are on the same track layer, until the target data is transmitted to the destination node;

[0116] The same-layer transmission unit 601 includes a first processing subunit 6011, wherein:

[0117] The first processing subunit 6011 is configured to, when the first node and the destination node have the same orbit type and the destination node exists among the neighboring nodes of the first node, transmit the target data to the destination node based on the inter-satellite link between the destination node and the first node; or,

[0118] If the destination node is not found among the neighboring nodes, the target neighboring node is used as the first node for the next same-layer transmission process. The target neighboring node is the neighboring node with the smallest two-dimensional spatial distance to the destination node.

[0119] In some embodiments, the same-layer transmission unit 601 further includes a second processing subunit 6012, configured to:

[0120] When the track types of the first node and the destination node are different, determine the target's neighboring nodes on the same track; the target's neighboring nodes on the same track are the neighboring nodes with the smallest two-dimensional spatial distance from the destination node and located on the same track as the first node.

[0121] Based on the orbital direction of the target's neighboring nodes in the same orbit, the target data is transmitted to the forwarding node, and the forwarding node is used as the first node for this same-layer transmission processing; the forwarding node is a satellite node that exceeds the orbital boundary and has available inter-satellite links in adjacent orbits.

[0122] In some embodiments, the data transmission device 60 further includes a cross-layer transmission unit 602, configured to:

[0123] When the orbital layers of the first node and the destination node are different, the cross-layer transfer process is iteratively executed until the target data is transmitted to the destination node; each cross-layer transfer process includes:

[0124] From multiple nodes at the same level of the first node, select at least one boundary node and the corresponding peer node of each boundary node; there is an inter-layer link between the peer node and the corresponding boundary node, and the peer node is in an adjacent orbit layer with the corresponding boundary node;

[0125] When the peer node and the destination node are at the same orbital layer, the target data is transmitted to the destination node based on same-layer transmission processing and inter-layer links.

[0126] In some embodiments, the cross-layer transmission unit 602 is specifically used for:

[0127] For the first node, iteratively perform same-layer transmission processing until the target data is transmitted to the boundary node;

[0128] Based on the inter-layer link between the boundary node and the peer node, the target data is transmitted to the destination node.

[0129] In some embodiments, the cross-layer transmission unit 602 is further configured to:

[0130] When the orbital layers of the peer node and the destination node are different, the first spatial vector between each peer node and the first node, and the second spatial vector between the first node and the destination node are obtained respectively.

[0131] The target boundary node is used as the first node for the next cross-layer transmission process, and the vector angle between the first spatial vector and the second spatial vector corresponding to the target boundary node is minimized.

[0132] In some embodiments, the data transmission apparatus 60 further includes a link establishment unit 603, configured to:

[0133] Based on the orbit information of the first node, multiple neighboring nodes of the first node are determined; the multiple neighboring nodes include: two satellite nodes that are in the same orbit and adjacent to the first node, and two satellite nodes that are in adjacent orbits and at the same location as the first node;

[0134] Establish inter-satellite links between each neighboring satellite and the first node to transmit data via these links.

[0135] For ease of description, the above sections are divided into functional units (or modules) and described separately. Of course, in implementing this application, the functions of each unit (or module) can be implemented in one or more software or hardware components. This device can be used to execute the methods shown in the embodiments of this application; therefore, the functions that each functional module of the device can achieve can be referred to the descriptions of the foregoing embodiments, and will not be repeated here.

[0136] Please see Figure 7 As shown, based on the same technical concept, this application embodiment also provides a computer device 70, which can be used for... Figure 1 The satellite network equipment shown may include a memory 701 and a processor 702.

[0137] The memory 701 is used to store computer programs executed by the processor 702. The memory 701 mainly includes a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function, etc.; the data storage area may store data created based on the use of the computer device, etc. The processor 702 may be a central processing unit (CPU), or a digital processing unit, etc. This application embodiment does not limit the specific connection medium between the memory 701 and the processor 702. This application embodiment... Figure 7 The memory 701 and the processor 702 are connected via a bus 703, and the bus 703 is in Figure 7 The connections between other components are indicated by thick lines and are for illustrative purposes only, not as limiting information. The 703 bus can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 7 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0138] Memory 701 may be volatile memory, such as random-access memory (RAM); memory 701 may also be non-volatile memory, such as read-only memory, flash memory, hard disk drive (HDD), or solid-state drive (SSD); or memory 701 may be any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but is not limited thereto. Memory 701 may be a combination of the above-described memories.

[0139] The processor 702 is used to execute the data transmission method performed by the device in various embodiments of this application when calling a computer program stored in the so-called memory 701.

[0140] In some embodiments, various aspects of the data transmission method provided in this application can also be implemented as a program product, which includes program code. When the program product is run on a computer device, the program code is used to cause the computer device to perform the steps in the data transmission method according to various exemplary embodiments of this application described above. For example, the computer device can perform the steps of each embodiment.

[0141] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0142] The program product of the embodiments of this application may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may run on a computing device. However, the program product of this application is not limited thereto. In this application, the readable storage medium may be any tangible medium that contains or stores a program that may be used by or in conjunction with a command execution system, apparatus, or device.

[0143] A readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying readable program code. This propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of sending, propagating, or transmitting a program for use by or in conjunction with a command execution system, apparatus, or device.

[0144] The program code contained on the readable medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0145] Program code for performing the operations of this application can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0146] It should be noted that although several units or sub-units of the device have been mentioned in the detailed description above, this division is merely exemplary and not mandatory. In fact, according to embodiments of this application, the features and functions of two or more units described above can be embodied in one unit. Conversely, the features and functions of one unit described above can be further divided and embodied by multiple units.

[0147] Furthermore, although the operations of the method of this application are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be broken down into multiple steps.

[0148] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied 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.

[0149] Although preferred embodiments of this application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of this application.

[0150] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

[0151] Some aspects of this disclosure can be executed entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. The aforementioned hardware or software may be referred to as a "data block," "module," "engine," "unit," "component," or "system." The processor may be one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DAPDs), programmable logic devices (PLDs), field-programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, or combinations thereof. Furthermore, aspects of this disclosure may be embodied as computer products residing in one or more computer-readable media, including computer-readable program code. For example, computer-readable media may include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, magnetic tapes, etc.), optical discs (e.g., compressed CDs, digital multifunction DVDs, etc.), smart cards, and flash memory devices (e.g., cards, sticks, key drives, etc.).

[0152] A computer-readable medium may contain a propagated data signal containing computer program code, for example, on baseband or as part of a carrier wave. This propagated signal may take various forms, including electromagnetic, optical, and so on, or suitable combinations thereof. A computer-readable medium can be any computer-readable medium other than a computer-readable storage medium, which can be connected to an instruction execution system, apparatus, or device to enable communication, propagation, or transmission of a program for use. The program code located on the computer-readable medium can be propagated through any suitable medium, including radio, cable, fiber optic cable, radio frequency signals, or similar media, or any combination of the above media.

[0153] Similarly, it should be noted that, in order to simplify the description of this disclosure and thus aid in the understanding of one or more embodiments of the invention, multiple features may sometimes be grouped into a single embodiment, drawing, or description thereof in the foregoing description of the embodiments of this disclosure. However, this method of disclosure does not imply that the subject matter of this disclosure requires more features than those mentioned. In fact, the embodiments contain fewer features than all the features of the single embodiments disclosed above.

[0154] In some embodiments, numbers describing the quantity of components and attributes are used. It should be understood that such numbers used in the description of embodiments are modified in some examples by the terms "approximately," "approximately," or "generally." Unless otherwise stated, "approximately," "approximately," or "generally" indicates that the numbers are allowed to vary by ±20%. Accordingly, in some embodiments, the numerical parameters used in this disclosure are approximate values, which may be changed according to the characteristics required by individual embodiments. In some embodiments, numerical parameters should take into account specified significant digits and employ a general method of digit preservation. Although the numerical ranges and parameters used in some embodiments of this disclosure to confirm their breadth of range are approximate values, in specific embodiments, such numerical values ​​are set as precisely as feasible.

[0155] Although this disclosure has been described with reference to specific embodiments, those skilled in the art should recognize that the above embodiments are merely illustrative of this disclosure, and various equivalent changes or substitutions can be made without departing from the spirit of this disclosure. Therefore, any changes or modifications to the above embodiments within the scope of the essential spirit of this disclosure will fall within the scope of this disclosure.

Claims

1. A data transmission method, characterized in that, The method, applied to the first node in a space-based network, includes: When the orbital layers of the first node and the destination node are the same, the same-layer transmission process is iteratively executed until the target data is transmitted to the destination node; wherein, each same-layer transmission process includes: When the first node and the destination node have the same orbit type, and the destination node exists among the neighboring nodes of the first node, the target data is transmitted to the destination node based on the inter-satellite link between the destination node and the first node; or, If the destination node is not present among the neighboring nodes, the target neighboring node is used as the first node for the next same-layer transmission process. The target neighboring node is the neighboring node with the smallest two-dimensional spatial distance to the destination node.

2. The method as described in claim 1, characterized in that, Each same-layer transmission process also includes: When the first node and the destination node have different track types, determine the target's same-track neighbor node; the target's same-track neighbor node is the neighbor node with the smallest two-dimensional spatial distance to the destination node and located on the same track as the first node; Based on the orbital direction of the target's neighboring nodes, the target data is transmitted to the forwarding node, and the forwarding node is used as the first node for this same-layer transmission process; the forwarding node is a satellite node that exceeds the orbital boundary and has available inter-satellite links for adjacent orbits.

3. The method as described in claim 1, characterized in that, The method further includes: When the orbital layers of the first node and the destination node are different, cross-layer transmission processing is performed iteratively until the target data is transmitted to the destination node; wherein each cross-layer transmission process includes: From the multiple nodes at the same level of the first node, select at least one boundary node and the corresponding peer node of each boundary node; there is an inter-layer link between the peer node and the corresponding boundary node, and the peer node is in an adjacent orbit layer with the corresponding boundary node; When the peer node and the destination node are at the same orbital layer, the target data is transmitted to the destination node based on the same-layer transmission processing and the inter-layer link.

4. The method as described in claim 3, characterized in that, The step of transmitting the target data to the destination node based on the same-layer transmission processing and the inter-layer link includes: For the first node, the same-layer transmission process is executed iteratively until the target data is transmitted to the boundary node; Based on the inter-layer link between the boundary node and the peer node, the target data is transmitted to the destination node.

5. The method as described in claim 3, characterized in that, The cross-layer transmission processing also includes: When the orbital layers of the peer node and the destination node are different, the first spatial vector between each peer node and the first node, and the second spatial vector between the first node and the destination node are obtained respectively. The target boundary node is used as the first node in the next cross-layer transmission process, and the vector angle between the first spatial vector and the second spatial vector corresponding to the target boundary node is the smallest.

6. The method as described in claim 1, characterized in that, The method further includes: Based on the orbit information of the first node, multiple neighboring nodes of the first node are determined; the multiple neighboring nodes include: two satellite nodes that are in the same orbit and adjacent to the first node, and two satellite nodes that are in adjacent orbits and at the same position as the first node. Establish inter-satellite links between each neighboring satellite and the first node to transmit data through the inter-satellite links.

7. A data transmission device, characterized in that, The device includes: The same-layer transmission unit is used to iteratively execute same-layer transmission processing when the first node and the destination node are on the same track layer, until the target data is transmitted to the destination node; The same-layer transmission unit includes a first processing subunit, wherein: The first processing subunit is configured to, when the orbit types of the first node and the destination node are the same, and the destination node exists among the neighboring nodes of the first node, transmit the target data to the destination node based on the inter-satellite link between the destination node and the first node; or, If the destination node is not present among the neighboring nodes, the target neighboring node is used as the first node for the next same-layer transmission process. The target neighboring node is the neighboring node with the smallest two-dimensional spatial distance to the destination node.

8. A computer device, characterized in that, include: At least one processor; as well as At least one memory storing instructions that, when executed individually or jointly by the at least one processor, cause the computing device to perform the method according to any one of claims 1 to 6.

9. A computer storage medium storing instructions thereon, characterized in that, When the instructions are executed individually or jointly by at least one processor of the computing device, the computing device performs the method according to any one of claims 1 to 6.

10. A computer program product, comprising instructions, characterized in that, When the instructions are executed individually or jointly by at least one processor of the computing device, the computing device performs the method according to any one of claims 1 to 6.

11. A chip system for a computing device, characterized in that, The chip system includes at least one processor configured to execute, individually or collectively, at least one memory-stored instruction of the computing device to cause the computing device to perform the method according to any one of claims 1 to 6.

Images