Communication method based on satellite network and related equipment
By combining satellite network topology and link event timetables to dynamically plan transmission paths, and using the regional path identifier field to record and verify path legitimacy, the problem of path deviation and insensitivity to topology changes in traditional OSPF protocols in satellite networks is solved, achieving efficient and stable communication task transmission.
Patent Information
- Application Number
- CN202511731898.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2025-10-27
- Filing Date
- 2025-11-24
- Publication Date
- 2026-02-27
AI Technical Summary
The traditional OSPF routing protocol cannot adapt to the grid-like spherical topology of satellite networks, causing paths to deviate from the shortest path, increasing latency and load. Furthermore, it frequently floods link state update messages because it cannot detect the periodic topology changes of satellite networks, affecting network stability.
By combining satellite network topology, pre-acquired link event timetables and target addresses, the transmission path of communication tasks is dynamically planned, and the regional path identifier field is used to record and verify the legality of the path in real time to avoid loop generation.
It significantly reduces communication latency and path deviation, optimizes the efficiency of routing information exchange, improves the stability and scalability of satellite networks, and adapts to dynamic topology changes in satellite networks.
Smart Images

Figure CN121585231A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of satellite network communication technology, and in particular to a satellite network-based communication method and related equipment. Background Technology
[0002] Open Shortest Path First (OSPF) is a link-state-based dynamic routing protocol widely used in terrestrial IP networks. Due to its advantages such as fast convergence, high route calculation accuracy, and support for hierarchical network structures, it has become one of the most widely used interior gateway protocols in modern networks. OSPF adopts a hierarchical structure based on areas, with the backbone area (Area 0) as the core. Routing information exchange between different areas is achieved through Area Boundary Routers (ABRs). All routing information from non-backbone areas must be relayed through the backbone area, thus forming a star logical topology, providing an efficient and stable routing mechanism for terrestrial network architectures.
[0003] However, the traditional OSPF architecture presents a significant contradiction with the topological characteristics of satellite networks. The mesh-like spherical topology of satellite networks does not match the star-shaped logical structure of the backbone area mandated by the OSPF protocol. Cross-area routing paths must transit through the backbone area, causing paths to deviate from the shortest path, increasing latency and load. Furthermore, satellite network topology changes are periodic and predictable, while the OSPF protocol cannot perceive this deterministic dynamic, treating each link state change as an independent event. This results in frequent flooding of link state update messages, consuming onboard resources and impacting network stability. Summary of the Invention
[0004] In view of this, the purpose of this application is to propose a communication method and related equipment based on a satellite communication network.
[0005] To achieve the above objectives, this application provides a satellite network-based communication method, comprising: In response to receiving a communication task, the target address of the communication task is determined; The transmission path of the communication task is determined based on the satellite network topology, the pre-acquired link event timetable, and the target address; During the transmission of the communication task, the transmission path of the communication task is dynamically recorded using the area path identifier field to transmit the communication task.
[0006] In one possible implementation, determining the target address of the communication task in response to receiving the communication task includes: In response to receiving a communication task, it is determined whether the communication task is located in a first area; the first area is the area where the communication task is received. In response to the fact that the communication task is located in the first area, the transmission path of the communication task is determined according to the routing table of the first area; In response to the fact that the communication task is not located in the first region, the target region of the communication task and the boundary node connecting the first region to the target region are determined according to the region division information in the satellite network topology.
[0007] In one possible implementation, determining the transmission path of the communication task based on the satellite network topology, a pre-acquired link event timetable, and the target address includes: Based on the link event timetable, determine the link activity window of the boundary node connecting the first region to the target region; Based on the link activity window and the target address, boundary nodes that meet the transmission requirements of the communication task are filtered to determine the transmission path from the first region to the target region.
[0008] In one possible implementation, the step of dynamically recording the transmission path of the communication task using a regional path identifier field during the transmission of the communication task, in order to transmit the communication task, includes: Based on the transmission path, a link state advertisement containing the target address is generated using the area boundary router of the first area, and the area path identifier field is initialized to the number of the first area; During the transmission of the communication task, in response to the communication task passing through the second area, the area path identifier field is synchronized to indicate that the communication task has passed through the second area, and the communication task is forwarded to the next area until the communication task reaches the target area; the second area is any area other than the first area and the target area.
[0009] In one possible implementation, the method further includes: In response to the communication task passing through each of the second regions, determine whether the region path identifier field contains an identifier for the second region; If the identifier of the second region is present in the region path identifier field, a loop is determined to exist, and the link status announcement is discarded.
[0010] In one possible implementation, the satellite network topology is generated by the following method: Based on the orbital parameters of the satellite constellation, multiple communication areas are divided in the satellite network; the orbital parameters include orbital inclination, number of orbits, number of satellites in each orbit, and phase factor; The satellite network topology is generated based on the boundary node connection relationships of the multiple communication areas; the boundary nodes are used to connect adjacent communication areas, and each communication area is connected to its adjacent areas through at least two boundary links.
[0011] In one possible implementation, the link event timetable is generated by the following method: Based on the orbital parameters of the satellite constellation, calculate the link connection time and link disconnection time between each satellite and its neighboring satellites; The calculated link establishment time and disconnection time are used as link activity windows to generate a corresponding link event timetable; the link event timetable includes the link activity window for each satellite node and is dynamically updated based on a preset satellite operating cycle.
[0012] In one possible implementation, the region path identifier field is represented by a bitmap encoding or by a newly added list of region identifiers.
[0013] Based on the same inventive concept, embodiments of this application also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the satellite network-based communication method as described in any of the above.
[0014] Based on the same inventive concept, embodiments of this application also provide a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute any of the satellite network-based communication methods described above.
[0015] As can be seen from the above, the satellite network-based communication method and related equipment provided in this application, in response to receiving a communication task, determine the target address of the communication task; determine the transmission path of the communication task based on the satellite network topology, a pre-acquired link event timetable, and the target address; and dynamically record the transmission path of the communication task using a regional path identifier field during the transmission of the communication task. This embodiment of the application, by combining the satellite network topology, link event timetable, and target address to determine the transmission path of the communication task, solves the problem of traditional routing protocols in satellite networks being insensitive to dynamic topology changes. It can effectively adapt to the periodic topology changes of satellite networks, reducing communication delays and path deviations. During the transmission of the communication task, the dynamic recording of the transmission path using the regional path identifier field enables real-time verification of path legitimacy, while avoiding the generation of routing loops and improving the efficiency and accuracy of routing information exchange. The entire method fully utilizes the spherical grid topology characteristics of satellite networks and optimizes communication performance within the satellite network through precise perception of link status and dynamic adjustment of the transmission path, improving the stability and scalability of routing and providing technical support for efficient communication in satellite networks. Attached Figure Description
[0016] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0017] Figure 1 This is a schematic diagram of a satellite network-based communication method according to an embodiment of this application; Figure 2 This is a schematic diagram of the region division in an embodiment of this application; Figure 3 This is a schematic diagram of the ABR processing Type 3 LSA flow according to an embodiment of this application; Figure 4 This is a schematic diagram of the electronic device structure according to an embodiment of this application. Detailed Implementation
[0018] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.
[0019] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.
[0020] It is understood that before using the technical solutions of the various embodiments in this disclosure, users will be informed of the type, scope of use, and usage scenarios of the personal information involved in an appropriate manner, and user authorization will be obtained.
[0021] For example, upon receiving a user's active request, a prompt message is sent to the user to explicitly inform them that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose, based on the prompt message, whether to provide personal information to the software or hardware such as electronic devices, applications, servers, or storage media performing the operations of this disclosed technical solution.
[0022] As an optional but not limited implementation, in response to a user's active request, sending a prompt message to the user can be done via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose "agree" or "disagree" to provide personal information to the electronic device.
[0023] It is understood that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of this disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of this disclosure.
[0024] As described in the background section, OSPF is a link-state dynamic routing protocol widely used in terrestrial IP networks due to its fast convergence speed, high route calculation accuracy, and support for hierarchical structures. OSPF uses a backbone area (Area 0) as its core, and uses Area Border Routers (ABRs) to exchange routing information between different areas, forming a star logical topology. However, the mesh-like spherical topology of satellite networks is incompatible with the backbone area architecture of OSPF. Cross-area routing requires transit through the backbone area, causing paths to deviate from the shortest path, increasing latency and load. Furthermore, satellite networks exhibit periodic and predictable dynamic changes, which OSPF cannot perceive. Frequent flooding of link-state update messages consumes onboard resources and affects network stability.
[0025] In light of the above considerations, this application proposes a satellite network-based communication method. In response to receiving a communication task, the method determines the target address of the communication task; it determines the transmission path of the communication task based on the satellite network topology, a pre-acquired link event timetable, and the target address; and during the transmission of the communication task, it dynamically records the transmission path using a regional path identifier field to transmit the communication task. This application, by combining the satellite network topology, link event timetable, and target address of the communication task, accurately plans the transmission path, solving the problem of traditional routing protocols being insensitive to dynamic changes in the satellite network topology. It effectively adapts to the periodic topology changes of the satellite network, significantly reducing communication latency and path deviation. During transmission, the task path is dynamically recorded using the regional path identifier field, enabling path validity verification and loop detection, optimizing the exchange efficiency of routing information, and improving stability and transmission performance. Furthermore, this application generates the satellite network topology and link event timetable using orbital parameters, accurately dividing the communication area and recording the link activity window. This allows for dynamic adjustment of the transmission path, reducing the flooding of link status update messages and guiding the efficient completion of communication tasks. The area path identifier field is implemented using bitmap encoding or an area identifier list, providing flexibility in path recording, adapting to the dynamic characteristics of satellite networks, and further improving communication efficiency and network performance.
[0026] The technical solutions of the embodiments of this application will be described in detail below through specific examples.
[0027] refer to Figure 1 The satellite network-based communication method of this application includes the following steps: Step S101: In response to receiving a communication task, determine the target address of the communication task; Step S102: Determine the transmission path of the communication task based on the satellite network topology, the pre-acquired link event timetable, and the target address; Step S103: During the transmission of the communication task, the transmission path of the communication task is dynamically recorded using the area path identifier field to transmit the communication task.
[0028] In step S101, in response to receiving a communication task, the target address of the communication task is determined.
[0029] In some embodiments, determining the target address of the communication task in response to receiving a communication task includes: determining whether the communication task is located in a first region in response to receiving a communication task; the first region being the region receiving the communication task; determining the transmission path of the communication task based on the routing table of the first region in response to the communication task being located in the first region; and determining the target region of the communication task and the boundary node connecting the first region to the target region based on the region division information in the satellite network topology in response to the communication task not being located in the first region.
[0030] In this embodiment, upon receiving a communication task, the system first determines the region involved by parsing the target address of the task, thus laying the foundation for subsequent routing information transmission and transmission path planning. In some embodiments, the target address parsing process for a communication task includes the following detailed operations: After the communication task arrives at the network device, the system checks the target address of the current task to determine if the address is located in a first region. The first region refers to the region where the current network device is located, serving as the region for receiving the communication task. If the target address is determined to belong to the first region, it indicates that the target node of the communication task is within the current region, eliminating the need for cross-regional transmission. Therefore, the network device directly reads the routing table stored in its local region and calculates the transmission path of the communication task based on the local routing information provided by the routing table. Since the target address of the communication task is located in the local region, the planning of the transmission path does not require routing information from other regions. This effectively simplifies the complexity of path planning, reduces computational overhead, and ensures that the communication task can be transmitted to the target node at the fastest speed, thereby improving the task processing efficiency of the satellite network.
[0031] If the analysis results indicate that the target address of the communication task does not belong to the first region, it means that the communication task needs to be transmitted across regions. In this case, this application further analyzes the target address based on the region division information in the satellite network topology to determine the target region of the communication task. The region division information of the satellite network is defined by the geometric characteristics of the satellite constellation, such as orbital inclination, number of orbits, number of satellites per orbit, and phase factor. Using these parameters, this application can divide the network into multiple rectangular grid-like regions, each region consisting of multiple satellite nodes on adjacent orbits. By querying the satellite network topology, network devices can quickly locate the target region's number and position, ensuring accurate identification of the target region.
[0032] After determining the target area, this application further analyzes the connectivity between the first area and the target area to plan cross-regional transmission paths. Specifically, the network device retrieves relevant information about regional boundary nodes, identifies boundary nodes within the first area and their link connections to the target area. Boundary nodes are key nodes connecting multiple areas, typically located on the periphery of an area, and their link status records the communication capabilities between areas. In cross-regional transmission path planning, the network device selects boundary nodes that meet transmission requirements as transmission hops for communication tasks, while prioritizing indicators such as link latency, bandwidth, and stability to ensure optimal path selection. Through precise positioning of the target area and boundary nodes, this application can effectively adapt to the dynamic topology characteristics of satellite networks, achieving efficient transmission of communication tasks between different areas. This method not only ensures the accuracy of path selection but also quickly adapts to the dynamic changes in satellite networks, optimizes routing information exchange efficiency, and significantly improves the transmission performance of communication tasks, thus providing technical support for the stable operation of satellite networks.
[0033] For step S102, the transmission path of the communication task is determined based on the satellite network topology, the pre-acquired link event timetable, and the target address.
[0034] In some embodiments, determining the transmission path of the communication task based on the satellite network topology, a pre-acquired link event timetable, and the target address includes: determining the link activity window of the boundary node connecting the first region to the target region based on the link event timetable; filtering boundary nodes that meet the transmission requirements of the communication task based on the link activity window and the target address, and determining the transmission path from the first region to the target region.
[0035] In this embodiment, by combining the satellite network topology, a pre-acquired link event timetable, and the target address of the communication task, the transmission path of the communication task is precisely planned to ensure that the task can complete cross-regional transmission in an efficient and stable manner. In some embodiments, the process of determining the transmission path includes the following detailed operations: First, this application uses the link event timetable to analyze the link status of the boundary nodes between the first region and the target region. The link event timetable is generated based on the orbital parameters of the satellite constellation and records the link establishment time and disconnection time between each satellite and its neighboring satellites, forming a link activity window to describe the availability of the link within a specific time period. By querying the link event timetable, the network device can identify the link activity status between the boundary nodes in the first region and the target region, and further determine the link activity windows of these boundary nodes.
[0036] Based on the link activity window, this application filters boundary nodes to ensure that the selected nodes can meet the transmission requirements of the communication task. The filtering process comprehensively considers key indicators such as link latency, bandwidth, and stability, thereby excluding boundary nodes that cannot meet the task's transmission needs. For example, if the activity window of a link indicates that it will be disconnected midway through the communication task, that link will be directly excluded to avoid communication task failure due to link interruption. Furthermore, if the latency or bandwidth of a link is insufficient to support the task's transmission requirements, that link will also be excluded to ensure that the selected transmission path can provide reliable performance support. Through the above filtering steps, the network device can determine the optimal boundary node between the first area and the target area, thus providing a reliable basis for selecting the transmission path for the communication task.
[0037] After selecting boundary nodes that meet the transmission requirements, this application further plans the transmission path from the first region to the target region by combining the satellite network topology and the target address of the communication task. The satellite network topology is constructed based on regional division information and can provide the connection relationship of satellite nodes in each region and the link distribution between regions. By analyzing the satellite network topology, the network device can clearly understand the internal connectivity of the target region and its overall link layout with the first region, thereby optimizing cross-regional path planning. Specifically, the network device will comprehensively consider the target address information and select the optimal path from the boundary node in the first region to the target node in the target region. During the path planning process, the network device will prioritize paths with longer link activity windows, lower latency, and larger bandwidth to ensure that the communication task can complete the transmission with high performance.
[0038] Furthermore, this application fully considers the dynamic characteristics of satellite networks. In satellite networks, due to changes in satellite orbits, the network topology exhibits high dynamism and periodicity. To adapt to this characteristic, this application designs a dynamic path adjustment mechanism that can update the transmission path in real time when the link status changes. When the status of a link changes, such as a link interruption or a significant increase in latency, network devices can recalculate the transmission path of the task based on the link event timetable and the satellite network topology, thereby achieving dynamic path adjustment and avoiding communication task interruption or performance degradation.
[0039] By combining satellite network topology, link event timetables, and target addresses to plan transmission paths, this application fully leverages the grid-like topology of satellite networks and the periodic changes in link states to optimize the selection of cross-regional transmission paths. This scheme not only significantly reduces transmission delays and path deviations in communication tasks but also improves transmission efficiency and overall network stability through a dynamic adjustment mechanism, providing technical support for efficient communication in satellite networks.
[0040] In step S103, during the transmission of the communication task, the transmission path of the communication task is dynamically recorded using the area path identifier field to transmit the communication task.
[0041] In some embodiments, the step of dynamically recording the transmission path of the communication task using a regional path identifier field during the transmission of the communication task, in order to transmit the communication task, includes: generating a link state advertisement containing the target address using a regional boundary router of the first region according to the transmission path, and initializing the regional path identifier field to the number of the first region; during the transmission of the communication task, in response to the communication task passing through a second region, synchronizing the regional path identifier field to indicate that the communication task has passed through the second region, and forwarding the communication task to the next region until the communication task reaches the target region; the second region is any region other than the first region and the target region.
[0042] In this embodiment, during the transmission of a communication task, a link-state advertisement (LSI) is generated by a regional boundary router, and the transmission path of the task is dynamically recorded, thereby achieving real-time tracking and effective management of the path. In some embodiments, the transmission process of the communication task begins in a first region, i.e., the region receiving the communication task. The network device first uses the regional boundary router of the first region to generate an LSI containing the destination address, and adds a regional path identifier field to the LSI. This field is initialized with the number of the first region, indicating that the task and its related routing information have not yet passed through other regions. The initialization of the regional path identifier field provides a basis for the dynamic recording of subsequent paths, while ensuring that the transmission path of the communication task can be traced from the source.
[0043] When a communication task is transmitted to another area, the area path identifier field is dynamically updated based on the areas the task traverses. For example, when a task passes through a second area, the area border router of that second area detects the task's arrival and synchronously updates the area path identifier field, adding the second area's number to the field to mark that the task has passed through that area. Subsequently, the area border router of the second area forwards the communication task to the next area, carrying the updated link-state advertisement and the area path identifier field. Through this dynamic recording mechanism, this application ensures that the transmission path of the communication task remains accurate and continuous during cross-area propagation. Furthermore, the update operation of the area path identifier field is performed hop-by-hop, meaning that whenever the task passes through a new area, the field is updated promptly to reflect the task's latest transmission path.
[0044] During the transmission of communication tasks, the area path identifier field is not only used to track the task's path but also serves as a key basis for verifying path validity. When a communication task is transmitted to a certain area, the network device in that area parses the path identifier field and checks whether the field contains the current area's number. If the field already contains the current area's number, it indicates that a loop exists in the task's transmission path. The network device will discard the link-state advertisement for this communication task to prevent resource waste and task failure caused by path loops. If the field does not contain the current area's number, the network device will update the field and continue forwarding the task to the next area. In this way, this application achieves real-time verification of path validity, effectively avoiding routing loop problems and improving the efficiency and accuracy of routing information exchange.
[0045] The area path identifier field in this application is implemented using either bitmap encoding or a newly added area identifier list to meet the path recording requirements in different scenarios. Bitmap encoding records the areas traversed by the task through a fixed-length bitmap structure, offering high efficiency and low resource consumption, making it suitable for scenarios requiring rapid communication transmission. The area identifier list, on the other hand, records path information by sequentially appending area numbers, providing more detailed path records and suitable for the analysis and verification of complex paths. Both implementation methods can flexibly adapt to the dynamic characteristics of satellite networks, ensuring the accuracy and efficiency of path recording.
[0046] By dynamically recording the transmission path of communication tasks, this application not only achieves real-time tracking of the task path but also provides data support for subsequent loop detection and path analysis, thereby optimizing the exchange and transmission efficiency of routing information. This technical solution fully adapts to the grid-like topology and dynamic characteristics of satellite networks, effectively improving the transmission stability of communication tasks and the overall performance of the network, providing technical assurance for efficient communication in satellite networks.
[0047] In some embodiments, the method further includes: in response to the communication task passing through each of the second regions, determining whether there is an identifier for the second region in the region path identifier field; in response to the presence of an identifier for the second region in the region path identifier field, determining that a loop exists, and discarding the link status announcement.
[0048] refer to Figure 3 This is a schematic diagram of the ABR processing Type 3 LSA flow according to an embodiment of this application.
[0049] Among them, LSA is a type 3 Link-State Advertisement (LSA).
[0050] like Figure 3 As shown, in this embodiment, during the transmission of a communication task, effective detection and processing of path loops are achieved through real-time parsing and judgment of the area path identifier field. In some embodiments, when a communication task passes through a second area, the network device first checks whether the area path identifier field it carries contains the identifier of the second area. The area path identifier field is used to record all area information traversed by the communication task during cross-area transmission. Regardless of whether it uses bitmap encoding or an area identifier list, this field can provide a clear path record. By parsing the path identifier field, the network device can identify whether the task has already passed through the current area.
[0051] If the area path identifier field contains the identifier of the current area, it indicates that a loop has occurred in the transmission path of the communication task. This means that the task's information has unreasonably flowed back to the area it previously traversed. In this case, the network device will immediately discard the link-state advertisement carried by the communication task to avoid resource waste and communication task failure caused by the loop problem. Discarding the link-state advertisement not only prevents the unauthorized propagation of the task but also prevents the flooding of routing information caused by the loop problem, thereby protecting network resources and maintaining network stability.
[0052] If the area path identifier field does not contain the identifier of the current area, it indicates that the communication task path is valid. The network device will update the current area number in the path identifier field and continue to forward the communication task to the next area. This real-time update mechanism ensures that the path identifier field can completely record the transmission path of the task, while providing accurate data support for subsequent path determination.
[0053] This application's loop detection mechanism significantly improves the security and accuracy of routing information transmission in satellite networks through dynamic recording and real-time verification of the regional path identifier field. Compared to traditional routing protocols that rely on backbone areas for information exchange, this application, through a backbone-free scheme and the design of the path identifier field, effectively avoids information backflow problems and reduces computational resource consumption and communication interruptions caused by loops. Furthermore, the logic for loop detection and processing relies entirely on local network equipment, eliminating the need for additional network-wide synchronization or complex calculations, thereby reducing overall network overhead.
[0054] By performing real-time verification of path legitimacy during communication mission transmission, this application achieves accurate transmission and efficient management of cross-regional routing information. The loop detection mechanism not only optimizes the exchange efficiency of routing information but also significantly improves the stability and communication performance of satellite networks, providing efficient and reliable technical support for satellite networks in complex and dynamic environments.
[0055] In some embodiments, the satellite network topology is generated by the following method: dividing the satellite network into multiple communication regions according to the orbital parameters of the satellite constellation; the orbital parameters include orbital inclination, number of orbits, number of satellites in each orbit, and phase factor; generating the satellite network topology according to the boundary node connection relationship of the multiple communication regions; the boundary nodes are used to connect adjacent communication regions, and each communication region is connected to adjacent regions through at least two boundary links.
[0056] refer to Figure 2 This is a schematic diagram of the region division in an embodiment of this application.
[0057] like Figure 2As shown, in this embodiment, a satellite network topology is generated based on the orbital parameters of the satellite constellation to adapt to the dynamic characteristics of the satellite network and optimize the transmission of routing information. In some embodiments, the generation of the satellite network topology includes the following detailed process: First, the satellite network is regionalized according to the orbital parameters of the satellite constellation. The orbital parameters of the satellite constellation include orbital inclination, number of orbits, number of satellites in each orbit, and phase factor. These parameters collectively determine the spatial structure and dynamic characteristics of the satellite constellation. The orbital inclination determines the angle between the satellite orbit and the Earth's equatorial plane; the number of orbits and the number of satellites in each orbit affect the satellite distribution density; the phase factor is used to define the relative position of the satellites in their orbits. The comprehensive application of these orbital parameters can provide a precise geometric reference for the regionalization of the satellite network.
[0058] In the region partitioning process, this application divides the orbital structure of the satellite constellation into multiple rectangular grid-like communication regions. Each region consists of multiple satellite nodes on adjacent orbits; specifically, each region contains (l+1) satellite nodes on (m+1) adjacent orbits, where l and m represent the orbital span and the number of satellites on each orbit, respectively. This rectangular grid partitioning method ensures a uniform distribution of satellite nodes within each region while adapting to the dynamic topology characteristics of the satellite network. Furthermore, to guarantee network connectivity and robustness, this application preferentially selects region partitioning parameters that satisfy l>=2 and m>=2, ensuring that each communication region has at least two boundary links connecting to adjacent regions, thereby reducing the impact of single-link failures on overall communication.
[0059] After completing the regional division, this application further generates a satellite network topology based on the connectivity of satellite nodes within the region and the distribution of boundary nodes between regions. Boundary nodes are a key component of the communication area, located on the periphery of the region, and their main function is to connect adjacent regions and ensure the stability of cross-regional communication. By analyzing the distribution and connectivity of boundary nodes, this application can construct a topology suitable for the dynamic characteristics of the satellite network. Specifically, each boundary node is connected to boundary nodes of adjacent regions through multiple links, forming an inter-regional link network. This design ensures high connectivity of the satellite network; even if some links fail, communication tasks can still be completed through other backup links.
[0060] The satellite network topology generation method of this application can not only adapt to the grid-like spherical structure of satellite networks, but also effectively cope with the dynamic changes of satellite networks. Compared with traditional network topology structures, the region partitioning method of this application is more flexible and not constrained by physical topology. During network operation, the satellite network topology can be dynamically adjusted according to the periodic changes of constellation orbits, thereby adapting to the real-time needs of the network. At the same time, the region partitioning scheme of this application can also be widely applied to different types of satellite constellations, including common Walker-Delta constellations and Walker-Star constellations, making the method highly versatile and applicable.
[0061] By generating satellite network topology based on satellite constellation orbital parameters, this application solves the mismatch problem between traditional network topology and satellite mesh topology, effectively optimizing the efficiency of routing information exchange. Through the design of region partitioning and boundary node connection relationships, this method significantly improves the connectivity and communication performance of the satellite network, providing a technical foundation for efficient and stable routing in satellite networks, while also enhancing protocol flexibility and deployment scalability.
[0062] In some embodiments, the link event timetable is generated by the following method: calculating the link connection time and link disconnection time between each satellite and its neighboring satellites based on the orbital parameters of the satellite constellation; using the calculated link establishment time and disconnection time as a link activity window to generate a corresponding link event timetable; the link event timetable includes the link activity window for each satellite node and is dynamically updated based on a preset satellite operating cycle.
[0063] In this embodiment, a link event timetable is generated based on the orbital parameters of the satellite constellation to adapt to the periodic changes in link status in the satellite network and optimize the management of routing information. In some embodiments, the generation of the link event timetable includes the following detailed steps: First, the link connection time and link disconnection time between each satellite and its neighboring satellites are calculated based on the orbital parameters of the satellite constellation. Orbital parameters include orbital inclination, number of orbits, number of satellites in each orbit, and phase factor. These parameters collectively determine the spatial distribution and trajectory of the satellites. The orbital inclination determines the angle between the satellite orbit and the Earth's equatorial plane; the number of orbits and the number of satellites in each orbit affect the satellite's coverage and connection density; and the phase factor defines the relative position of the satellites in their orbits. Using these orbital parameters, this application can accurately calculate the physical distance and connection status between satellite nodes.
[0064] Based on the above calculations, the link establishment and disconnection times between each satellite and its neighboring satellites can be accurately predicted. These time points reflect the dynamic changes in the links during satellite operation and form the basis for generating the link event timetable. This application defines the link establishment and disconnection times as the link activity window, which describes the availability of a link within a certain time period. By recording the activity window of each link, this application can form a complete link event timetable to describe the time-series changes in the link status throughout the entire satellite network.
[0065] The link event timetable not only records the link activity window of each satellite node but also categorizes and stores this status data to adapt to the dynamic characteristics of the satellite network. Due to the highly periodicity of satellite orbits, changes in link status also exhibit similar periodic characteristics. Therefore, this application dynamically updates the link event timetable based on the satellite's operational cycle to ensure that the timetable reflects the latest changes in link status in real time. For example, when a satellite completes an operational cycle, its link event timetable is automatically updated to the link status information for the next cycle, thereby avoiding routing information delays caused by changes in link status.
[0066] By generating and dynamically updating the link event timetable, this application can significantly optimize path planning and routing management in satellite networks. Network devices can query the link event timetable to detect link status changes in advance, thereby effectively avoiding communication task failures caused by link interruptions. In addition, the timetable can also support dynamic path adjustment. When a link is about to be disconnected, network devices can select an alternative path in advance to achieve a smooth switch of communication tasks and avoid transmission interruptions.
[0067] Compared to traditional routing protocols that require real-time sensing of link state changes and reactive responses, the link event timetable in this application transforms passive processing in the network into proactive adaptation by predicting link state changes in advance. This mechanism significantly reduces unnecessary flooding of link state update messages, lowers the consumption of onboard computing and communication resources, and reduces network instability caused by link state changes. The generation and updating of the link event timetable provides crucial support for the efficient operation of satellite networks, ensuring rapid convergence of routing information and maintaining network stability, thus providing technical assurance for the efficient completion of satellite communication missions.
[0068] In some embodiments, the region path identifier field is represented by bitmap encoding or by a newly added list of region identifiers.
[0069] In this embodiment, a region path identifier field is used to dynamically record and manage path information during cross-regional transmission of communication tasks. In some embodiments, the region path identifier field can be represented using bitmap encoding or by using a newly added list of region identifiers, thus flexibly adapting to the path recording requirements of different scenarios. Bitmap encoding is a fixed-length encoding structure where each bit in the region path identifier field corresponds to a uniquely numbered region. When a communication task passes through a region, the corresponding bit for that region is set to 1, indicating that the region has been visited. Bitmap encoding is characterized by its simple structure, low resource consumption, and high operational efficiency, enabling rapid recording of path information for communication tasks and making it suitable for scenarios requiring rapid task transmission. Furthermore, the fixed-length design of the bitmap structure ensures both the simplicity of recording and the efficiency of computation, significantly reducing the resources occupied by the path identifier field in communication tasks.
[0070] As an alternative to bitmap encoding, the area path identifier field can also be implemented using a newly added area identifier list. The area identifier list is a variable-length structure that dynamically records all area numbers traversed by a communication task during transmission. Whenever a task passes through a new area, that area number is dynamically appended to the end of the list, thus forming a complete path record. The area identifier list provides a more flexible path recording method, reflecting the actual propagation path of the communication task in detail, and is suitable for the analysis and verification of complex paths. By recording area numbers sequentially, the area identifier list can provide comprehensive data support for subsequent path tracing and legitimacy verification. Furthermore, the variable-length design of the list format can adapt to the path requirements of different scales in satellite networks, ensuring that path records are not limited by the increase in the number of areas.
[0071] Regardless of whether bitmap encoding or a region identifier list is used, the region path identifier field in this application can dynamically record and track the communication task path, providing a reliable basis for subsequent path management and loop detection. During path validity verification, the network device can quickly check whether the task has passed through the current region based on the region path identifier field, thereby determining whether a path loop problem exists. If the identifier field already contains the current region number, a loop is determined to exist in the path, and the network device will discard the link status announcement of the communication task to avoid resource waste and task failure caused by path loops. If the identifier field does not contain the current region number, the network device will update the current region number in the identifier field and continue to forward the task to the next region.
[0072] This application, through the design of the area path identifier field, can flexibly adapt to the dynamic characteristics of satellite networks, ensuring the accuracy and efficiency of path recording. Bitmap encoding provides an efficient, low-resource-consumption recording method, suitable for scenarios requiring rapid transmission in communication tasks; while the area identifier list provides a detailed and dynamic recording method, suitable for the analysis and verification of complex paths. These two implementation methods offer different technical options for path recording, satisfying the dynamic needs of satellite networks while optimizing the exchange efficiency of routing information, significantly improving the transmission performance of communication tasks and the overall stability of satellite networks. Through the application of the area path identifier field, this application provides an efficient and reliable path recording and management solution for communication tasks in dynamic satellite networks.
[0073] As can be seen from the above embodiments, the satellite network-based communication method described in this application, in response to receiving a communication task, determines the target address of the communication task; determines the transmission path of the communication task according to the satellite network topology, a pre-acquired link event timetable, and the target address; and dynamically records the transmission path of the communication task using a regional path identifier field during the transmission of the communication task, so as to transmit the communication task.
[0074] By combining satellite network topology, link event timetables, and destination addresses to determine the transmission path of communication tasks, this method solves the problem of traditional routing protocols in satellite networks being insensitive to dynamic topology changes. It effectively adapts to the periodic topology changes of satellite networks, reducing communication latency and path deviation. During the transmission of communication tasks, the regional path identifier field is used to dynamically record the transmission path, enabling real-time verification of path legitimacy while avoiding routing loops and improving the efficiency and accuracy of routing information exchange. The entire method fully utilizes the spherical grid topology of satellite networks and optimizes communication performance within the satellite network through precise perception of link status and dynamic adjustment of transmission paths, improving routing stability and scalability, and providing technical support for efficient communication in satellite networks.
[0075] By parsing the target address of a communication task, the region where the task is located can be effectively distinguished, ensuring the accuracy of routing information and the rationality of the transmission path. When the task is located in the receiving region, this application quickly plans the transmission path based on the routing table of that region, reducing the complexity of path calculation and improving task processing efficiency. When the communication task is not located in the receiving region, this application utilizes the region division information in the satellite network topology to determine the target region of the task and the boundary nodes connecting the target regions, ensuring the accuracy of the cross-regional transmission path. Through precise positioning of the target region and boundary nodes, this application achieves efficient path planning for communication tasks, optimizes the exchange of routing information between regions in the satellite network, and significantly improves the dynamic adaptability and transmission performance of the communication network.
[0076] By combining satellite network topology, link event timetables, and mission target addresses, the transmission path for communication missions can be precisely planned. Using the link event timetable, this application can effectively determine the link activity windows of inter-regional boundary nodes, selecting boundary nodes that meet the mission transmission requirements, thereby optimizing path selection and avoiding the impact of link interruptions on communication transmission. Simultaneously, based on link status and target addresses, this application accurately plans the transmission path from the receiving area to the target area, ensuring the dynamism and adaptability of the path. By utilizing link activity windows, this application significantly improves the stability and communication efficiency of transmission paths in satellite networks, providing technical support for achieving efficient cross-regional communication.
[0077] During the transmission of communication tasks, link-state advertisements are generated and area path identifier fields are initialized through area boundary routers, effectively recording the transmission path of the communication task and thus tracking the cross-area transmission status of the task in real time. When the task passes through a new area, this application can dynamically synchronize the area path identifier field to ensure the continuity and accuracy of path recording, and complete the transmission relay of the task in each area until it reaches the target area. By dynamically recording the path, this application not only realizes real-time path tracking of communication tasks, but also provides data support for subsequent loop detection and path analysis, thereby optimizing the exchange and transmission efficiency of routing information. This technical solution is fully adapted to the grid-like topology and dynamic characteristics of satellite networks, effectively improving the transmission stability of communication tasks and the overall performance of the network.
[0078] By performing real-time assessments of each area traversed by the communication task, the existence of duplicate area identifiers in the path identifier field can be effectively verified, thereby achieving loop detection. When a loop occurs in the communication task's path, this application promptly discards link status announcements to avoid resource waste and communication task transmission failures caused by path loops. By dynamically monitoring the path identifier field, this application can improve the transmission efficiency of routing information, reduce network overhead caused by loop problems, and maintain the stability of the satellite network and the reliability of communication. This scheme provides efficient and stable technical support for routing information exchange in satellite networks, significantly optimizing communication performance in complex dynamic network environments.
[0079] By generating satellite network topology based on satellite constellation orbital parameters, this method effectively adapts to the dynamic characteristics and complex structure of satellite networks. Through comprehensive calculations of orbital inclination, number of orbits, number of satellites in each orbit, and phase factor, this application rationally divides multiple communication zones and constructs the network topology based on the connection relationships of boundary nodes within each zone. This method ensures that each communication zone is connected to adjacent zones through at least two boundary links, thereby enhancing network connectivity and fault tolerance. By generating a topology structure that conforms to the characteristics of satellite networks, this application solves the mismatch problem between traditional network topologies and satellite grid topologies, while optimizing the exchange efficiency of routing information, providing a technical foundation for efficient satellite communication.
[0080] By generating a link event timetable based on the orbital parameters of the satellite constellation, the connection and disconnection times of links between each satellite and its neighboring satellites can be accurately calculated. The link event timetable records the activity window of each link and is dynamically updated according to the satellite's orbital cycle, effectively adapting to the periodic topology changes in the satellite network caused by orbital motion. This method can detect link state changes in advance, reducing unnecessary flooding of link state update messages, thereby reducing the consumption of onboard computing and communication resources. Simultaneously, by accurately recording the link activity window, this application significantly improves the stability of routing information and the transmission efficiency of communication tasks, providing crucial support for the efficient operation of satellite networks.
[0081] By employing either bitmap encoding or a newly added list of region identifiers to record the region path identifier field, the dynamic path tracking requirements of satellite network communication tasks can be flexibly adapted. Bitmap encoding records path information using a simple bitmap structure, offering high efficiency and low resource consumption, making it suitable for scenarios requiring rapid communication transmission. Meanwhile, the region identifier list records path information by sequentially appending region IDs, providing more detailed path records and making it suitable for the analysis and verification of complex paths. These two implementations offer different technical options for path recording, satisfying the dynamic characteristics of satellite networks while enhancing the flexibility and adaptability of the path identifier field, thereby optimizing the efficiency of routing information exchange and the transmission performance of communication tasks.
[0082] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.
[0083] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
[0084] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the satellite network-based communication method described in any of the above embodiments.
[0085] Figure 4 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.
[0086] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.
[0087] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.
[0088] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.
[0089] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).
[0090] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.
[0091] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.
[0092] The electronic devices described above are used to implement the corresponding satellite network-based communication methods in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.
[0093] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium that stores computer instructions for causing the computer to execute the satellite network-based communication method as described in any of the above embodiments.
[0094] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.
[0095] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the satellite network-based communication method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.
[0096] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.
[0097] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.
[0098] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.
[0099] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.
Claims
1. A communication method based on satellite networks, characterized in that, include: In response to receiving a communication task, the target address of the communication task is determined; The transmission path of the communication task is determined based on the satellite network topology, the pre-acquired link event timetable, and the target address; During the transmission of the communication task, the transmission path of the communication task is dynamically recorded using the area path identifier field to transmit the communication task.
2. The method according to claim 1, characterized in that, The step of determining the target address of the communication task in response to receiving the communication task includes: In response to receiving a communication task, it is determined whether the communication task is located in a first area; the first area is the area where the communication task is received. In response to the fact that the communication task is located in the first area, the transmission path of the communication task is determined according to the routing table of the first area; In response to the fact that the communication task is not located in the first region, the target region of the communication task and the boundary node connecting the first region to the target region are determined according to the region division information in the satellite network topology.
3. The method according to claim 2, characterized in that, Determining the transmission path of the communication task based on the satellite network topology, a pre-acquired link event timetable, and the target address includes: Based on the link event timetable, determine the link activity window of the boundary node connecting the first region to the target region; Based on the link activity window and the target address, boundary nodes that meet the transmission requirements of the communication task are filtered to determine the transmission path from the first region to the target region.
4. The method according to claim 3, characterized in that, The method of dynamically recording the transmission path of the communication task using a regional path identifier field during the transmission of the communication task, in order to transmit the communication task, includes: Based on the transmission path, a link state advertisement containing the target address is generated using the area boundary router of the first area, and the area path identifier field is initialized to the number of the first area; During the transmission of the communication task, in response to the communication task passing through the second area, the area path identifier field is synchronized to indicate that the communication task has passed through the second area, and the communication task is forwarded to the next area until the communication task reaches the target area; the second area is any area other than the first area and the target area.
5. The method according to claim 4, characterized in that, The method further includes: In response to the communication task passing through each of the second regions, determine whether the region path identifier field contains an identifier for the second region; If the identifier of the second region is present in the region path identifier field, a loop is determined to exist, and the link status announcement is discarded.
6. The method according to claim 1, characterized in that, The satellite network topology is generated using the following method: Based on the orbital parameters of the satellite constellation, multiple communication areas are divided in the satellite network; the orbital parameters include orbital inclination, number of orbits, number of satellites in each orbit, and phase factor; The satellite network topology is generated based on the boundary node connection relationships of the multiple communication areas; the boundary nodes are used to connect adjacent communication areas, and each communication area is connected to its adjacent areas through at least two boundary links.
7. The method according to claim 1, characterized in that, The link event timetable is generated using the following method: Based on the orbital parameters of the satellite constellation, calculate the link connection time and link disconnection time between each satellite and its neighboring satellites; The calculated link establishment time and disconnection time are used as the link activity window to generate a corresponding link event timetable; the link event timetable includes the link activity window for each satellite node and is dynamically updated based on a preset satellite operating cycle.
8. The method according to claim 1, characterized in that, The region path identifier field is represented in bitmap encoding form or using a newly added list of region identifiers.
9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method as described in any one of claims 1 to 8.
10. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method according to any one of claims 1 to 8.