Information transmission method, node and computer readable storage medium

By determining the target link and downstream nodes in the satellite communication network and transmitting the notification information using the "routine" method, the problem of bandwidth overhead and high routing convergence cost during routing information announcement is solved, and efficient information transmission and fast routing are achieved convergence.

WO2025001744A1PCT designated stage expired Publication Date: 2025-01-02ZTE CORP
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2024/096639
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-06-30
Filing Date
2024-05-31
Publication Date
2025-01-02

AI Technical Summary

Technical Problem

In satellite communication networks, the bandwidth overhead is high when routing information is advertised, and the routing convergence is high, especially when global transmission fails, resulting in invalid transmission and increased delay.

Method used

By determining the target link and downstream nodes in the grid network, the "on-road" method is used to transmit the notification information, reducing invalid transmission, reducing the bandwidth overhead of information notification, and speeding up the routing convergence process. The specific method includes receiving the notification information of the upstream node, determining the target link based on the topological status, determining the target downstream node, and sending corresponding notification information to it, ensuring that the information is efficiently transmitted in the grid network.

Benefits of technology

It realizes efficient transmission of information advertisements in satellite communication networks, reduces bandwidth overhead and routing convergence cost, reduces invalid transmission, and improves the transmission speed and accuracy of announcement information.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024096639_02012025_PF_FP_ABST
    Figure CN2024096639_02012025_PF_FP_ABST
Patent Text Reader

Abstract

The present disclosure provides an information transmission method, executed by any one node in a mesh network, wherein the mesh network comprises a first link connecting nodes that are adjacent in a first direction, and a second link connecting nodes that are adjacent in a second direction. The method comprises: receiving first notification information of an upstream node, wherein the first notification information comprises notification content; determining a target link between a current node and the upstream node on the basis of a topological state of the mesh network, wherein the target link comprises one of the first link and the second link; on the basis of the first notification information and the target link, determining a target downstream node and corresponding second notification information; and transmitting the corresponding second notification information to the target downstream node, wherein the second notification information comprises the notification content. Further provided are a node and a computer readable storage medium.
Need to check novelty before this filing date? Find Prior Art

Description

Information transmission method, node, and computer-readable storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202310800944.6 filed on June 30, 2023, the contents of which are incorporated herein by reference in their entirety. Technical Field

[0003] The present disclosure relates to the field of routing technology, in particular to the field of integrated space-ground network technology, and more particularly to a method, node, and computer-readable storage medium for information transmission. Background Art

[0004] When a link between communication satellites (constellations) in a satellite communication network (constellation network) is unexpectedly interrupted, it is equivalent to a change in the topological state of the satellite communication network. Therefore, the "new" routing information (routing convergence information) must be notified to all communication satellites for subsequent calculation of routes (transmission paths) based on the "new" routing information.

[0005] However, the existing routing information announcement has high bandwidth overhead and high routing convergence cost.

[0006] Public content

[0007] In a first aspect, an embodiment of the present disclosure provides a method for information transmission, performed by any node in a mesh network, the mesh network including a first link connecting nodes adjacent along a first direction, and a second link connecting nodes adjacent along a second direction; the method comprising: receiving first notification information from an upstream node; the first notification information including notification content; determining a target link based on a topological state of the mesh network; the target link being a link between a current node and the upstream node, the target link including one of the first link and the second link; determining a target downstream node and corresponding second notification information based on the first notification information and the target link; and sending the corresponding second notification information to the target downstream node; the second notification information including the notification content.

[0008] In a second aspect, an embodiment of the present disclosure provides a node, comprising a memory and a processor; the memory stores a computer program that can be executed by the processor, and the computer program is executed by the processor, so that the processor implements the information transmission method of the embodiment of the present disclosure.

[0009] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor so that the processor implements the information transmission method of the embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] In the accompanying drawings of the embodiments of the present disclosure:

[0011] FIG1 is a flow chart of an information transmission method provided by an embodiment of the present disclosure;

[0012] FIG2 is a schematic diagram of the structure of a topology unit in a mesh network provided by an embodiment of the present disclosure;

[0013] FIG3 is a schematic diagram of the position distribution of polar-orbiting communication satellites in the Eastern Hemisphere and the Western Hemisphere at a given moment provided by an embodiment of the present disclosure;

[0014] FIG4 is a schematic diagram of the structure of a satellite communication network of a polar-orbiting communication satellite at a given moment according to an embodiment of the present disclosure;

[0015] FIG5 is a schematic diagram of an information transmission process when a first link fails in an information transmission method provided by an embodiment of the present disclosure;

[0016] FIG6 is a schematic diagram of a process of information transmission when a second link fails in an information transmission method provided by an embodiment of the present disclosure;

[0017] FIG7 is a schematic diagram of an information transmission process in an information transmission method provided by an embodiment of the present disclosure;

[0018] FIG8 is a schematic diagram of an information transmission process in an information transmission method provided by an embodiment of the present disclosure;

[0019] FIG9 is a schematic diagram of a process of information transmission when a link is disconnected in an information transmission method provided by an embodiment of the present disclosure;

[0020] FIG10 is a schematic diagram of a process of information transmission when a link is disconnected in an information transmission method provided by an embodiment of the present disclosure;

[0021] FIG11 is a schematic diagram of a process of information transmission when a link is disconnected in an information transmission method provided by an embodiment of the present disclosure;

[0022] FIG12 is a schematic diagram of an information transmission process in an information transmission method provided by an embodiment of the present disclosure;

[0023] FIG13 is a block diagram of a node provided by an embodiment of the present disclosure;

[0024] FIG14 is a block diagram of a computer-readable storage medium according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] To enable those skilled in the art to better understand the technical solutions of the present disclosure, the information transmission method, node, and computer-readable storage medium provided by the embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0026] The present disclosure will be described more fully below with reference to the accompanying drawings, but the embodiments shown may be embodied in different forms, and the present disclosure should not be construed as limited to the embodiments set forth below. These embodiments are provided to make the present disclosure more thorough and complete and to enable those skilled in the art to fully understand the scope of the present disclosure.

[0027] The accompanying drawings of the embodiments of the present disclosure are used to provide a further understanding of the embodiments of the present disclosure and constitute a part of the specification. Together with the detailed embodiments, they are used to explain the present disclosure and do not constitute a limitation of the present disclosure. By describing the detailed embodiments with reference to the accompanying drawings, the above and other features and advantages will become more apparent to those skilled in the art.

[0028] The present disclosure may be described with reference to plan views and / or cross-sectional views by way of ideal schematic views of the present disclosure. Therefore, the exemplary illustrations may be modified according to manufacturing techniques and / or tolerances.

[0029] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0030] The terms used in this disclosure are only used to describe specific embodiments and do not limit this disclosure. As used in this disclosure, the term "and / or" includes any and all combinations of one or more related enumerated items. As used in this disclosure, the singular forms "a" and "the" also include plural forms, unless the context clearly indicates otherwise. As used in this disclosure, the terms "comprising" and "made of" specify the presence of specific features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof.

[0031] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meanings as those commonly understood by those skilled in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless expressly defined in this disclosure.

[0032] The present disclosure is not limited to the embodiments shown in the drawings, but includes modifications of the configurations formed based on the manufacturing process. Therefore, the regions illustrated in the drawings have schematic properties, and the shapes of the regions shown in the drawings illustrate the specific shapes of the regions of the elements, but are not restrictive.

[0033] In addition to communicating with ground base stations, different communication satellites (constellations, such as low-orbit LEO polar-orbit communication satellites) can also be connected to each other to form a satellite communication network (constellation network) with communication satellites as nodes, realizing the integration of space and earth.

[0034] The connection relationship between communication satellites in a satellite communication network is called the "topological state". The corresponding "routing information (routing convergence information)" can be calculated based on the topological state. When the satellite communication network actually transmits information, it can calculate the route (transmission path) of the information based on the routing information and transmit it according to the route.

[0035] Communication satellites operate along predetermined trajectories, so the topology of the satellite communication network changes periodically, and these changes are predictable. Therefore, the topology or routing information of the satellite communication network at each time slice can be stored in advance on each communication satellite. This allows the communication satellite to calculate routes at any time based on the routing information at that time.

[0036] Links between communication satellites may unexpectedly disconnect or recover due to sudden failures and subsequent recovery. Such link failures can cause unpredictable changes in the topology state. When the topology state changes unpredictably, the "new" routing information caused by the link failure (failure or recovery) must be announced to all communication satellites to ensure that subsequent communication satellites can calculate routes that conform to the changed topology state based on the "new" routing information.

[0037] Related technologies use flooding to globally transmit "new" routing information. However, flooding is unconstrained: each satellite in a satellite communication network forwards routing information to all connected satellites. Each satellite also receives routing information multiple times, resulting in a large number of "ineffective" transmissions. This leads to high bandwidth overhead and high routing convergence costs (e.g., latency).

[0038] In a first aspect, an embodiment of the present disclosure provides a method for information transmission, which is executed by any node in a mesh network.

[0039] The mesh network includes first links connecting nodes adjacent in a first direction, and second links connecting nodes adjacent in a second direction.

[0040] 2 , a plurality of nodes having information transmission capabilities may be interconnected (communication connected) to form a “mesh network”.

[0041] In a mesh network, nodes adjacent along a first direction are connected by a first link, and nodes adjacent along a second direction (a direction intersecting the first direction and further perpendicular to the first direction) are connected by a second link. As a result, the topological relationship of the mesh network is similar to that of a "two-dimensional grid". The basic structural unit (topological unit) in the mesh network can be seen in Figure 2.

[0042] It should be understood that the drawings of the embodiments of the present disclosure only schematically illustrate the connection relationship between different nodes, and do not represent the physical position relationship of the nodes and the specific length relationship of the corresponding links.

[0043] In some implementations, the link indicator values ​​of all first links are the same; and the link indicator values ​​of at least some second links are different.

[0044] In some embodiments, the latency of all the above first links may be the same, that is, the time taken to transmit information on all first links is the same; while the latency of at least some of the second links is different, that is, the time taken to transmit information on some second links may be longer or shorter than the time taken to transmit information on other second links.

[0045] In some embodiments, the nodes are polar-orbiting communication satellites or inclined-orbit communication satellites; and the mesh network is a satellite communication network.

[0046] In some embodiments, the above mesh network may be a satellite communication network (constellation network), each node in the mesh network is a communication satellite, and may further be a polar orbit communication satellite or an inclined orbit communication satellite, especially a low earth orbit (LEO) polar orbit communication satellite.

[0047] 3 , a polar-orbiting communication satellite is a communication satellite that runs along an orbit that passes through the South Pole and the North Pole and is perpendicular to the equator, that is, its orbit is along the longitude direction.

[0048] Therefore, at any moment, the distance between any adjacent polar-orbiting communication satellites in the same orbit is the same, and the time delay is also the same. Therefore, adjacent polar-orbiting communication satellites in the same orbit (orbital plane) are connected by a first link (i.e., the first direction is the longitude direction). In adjacent orbits, polar-orbiting communication satellites at the same latitude (between orbits) are connected by a second link (i.e., the second direction is the latitude direction). In addition, the distance between polar-orbiting communication satellites in adjacent orbits at high latitudes is close and the time delay is small, while the distance between polar-orbiting communication satellites in adjacent orbits at low latitudes is far and the time delay is large.

[0049] 3 , since polar-orbiting communication satellites in one orbit move in opposite directions in the Eastern Hemisphere and the Western Hemisphere, there must be a situation where polar-orbiting communication satellites in two adjacent orbits move in opposite directions, and the polar-orbiting communication satellites in these two adjacent orbits may not be connected by the second link, resulting in a "reverse gap".

[0050] 3 , since the relative speeds between polar-orbiting communication satellites in different orbits are very large in the Antarctic and Arctic regions, polar-orbiting communication satellites in different orbits at the two poles may not be connected through the second link.

[0051] Therefore, the satellite communication network formed by polar-orbiting communication satellites may be equivalent to the form shown in FIG. 4 .

[0052] It should be understood that the mesh network and the form of nodes in the mesh network applicable to the embodiments of the present disclosure are not limited to the example of communication satellites, and can also be other types of communication networks as long as their network structure meets the requirements of the embodiments of the present disclosure.

[0053] In some implementations, the notification information may be a notification of routing information, that is, the notification content in the notification information may include routing information.

[0054] When information is transmitted in a mesh network, nodes need to calculate the information route (transmission path) based on pre-stored routing information. Routing information (routing convergence information) is determined according to the topological state of the mesh network (i.e., the connection relationship between nodes). Therefore, when the topological state changes (such as a link failure), the "new" routing information needs to be notified to all nodes.

[0055] The information transmission method provided by the embodiment of the present disclosure can be executed by any node in the mesh network, that is, all nodes in the mesh network can execute the method provided by the embodiment of the present disclosure, thereby realizing the transmission of notification information in the mesh network.

[0056] Each node that is executing the information transmission method provided by the embodiments of the present disclosure is called a "current node".

[0057] It should be understood that the above “current node” is a nickname for the node that “this time” executes the information transmission method provided by the embodiment of the present disclosure, rather than a special node in the mesh network.

[0058] 1 , the information transmission method provided by the embodiment of the present disclosure includes steps S101 to S104 .

[0059] S101: Receive first notification information from an upstream node.

[0060] The first notification information includes notification content.

[0061] S102: Determine a target link according to the topological state of the mesh network.

[0062] The target link is a link between the current node and the upstream node, and the target link includes one of the first link and the second link.

[0063] S103: Determine a target downstream node and corresponding second notification information according to the first notification information and the target link.

[0064] S104: Send corresponding second notification information to the target downstream node.

[0065] The second notification information includes notification content.

[0066] In some cases, some information needs to be notified to all nodes in the mesh network, so the information can be used as "notification content" and notified through the transmission of notification information.

[0067] For example, when the link status of a link in a mesh network changes (such as a link being disconnected or restored), routing information representing the corresponding change will be generated, and this routing information can be added to the notification information and transmitted. When all nodes receive the notification information (routing information), the routing information can be updated (routing convergence).

[0068] For any node (current node) in the mesh network, after receiving the notification information (first notification information), it can determine whether the link (target link) for transmitting the first notification information is the first link or the second link based on the topological state of the mesh network, that is, determine the "source direction" of the first notification information is the first direction or the second direction.

[0069] Furthermore, the current node can calculate in an "on-path" manner which node or nodes (target downstream nodes) the notification information should continue to be sent to based on the type of the target link and the first notification information received, and decide the specific content of the notification information (second notification information) sent to each target downstream node.

[0070] The first notification information and the second notification information mentioned above both include at least notification content, that is, the content actually desired to be notified.

[0071] It should be understood that the first notification information and the second notification information in the embodiment of the present disclosure refer to notification information received and sent by a node (current node) during a working process, rather than specific information.

[0072] For example, when the second notification information sent by a node is received by another node, it becomes the first notification information to the receiving node.

[0073] In the disclosed embodiments, each node (such as a communication satellite) determines the transmission path of notification information (such as routing information) in a "path-by-path" manner according to the network topology, so that the notification information is transmitted under certain constraints. While minimizing "invalid" transmissions, the notification information can be transmitted to each node in the mesh network at a faster speed, thereby reducing the bandwidth overhead of information notification. When used to notify routing information, it can also reduce the routing convergence cost (such as reducing the convergence delay).

[0074] In some implementations, the notification content includes the link failure status and the corresponding boundary line position, where the boundary line passes through the second link at the link failure location and extends along the first direction.

[0075] 5 and 6 , routing information needs to be announced because a link failure occurs. Each time a link failure occurs, in addition to generating routing information, a boundary line corresponding to the link failure needs to be determined. The boundary line passes through a second link at the link failure location and extends along the first direction.

[0076] At this time, the notification content in the notification content should include not only the link failure situation (ie, routing information) but also the information representing the position of the above dividing line.

[0077] It can be seen that the above dividing line is equivalent to dividing the mesh network into the "left part" and the "right part" at the link failure point, which is used to ensure that normal notification information should not be transmitted across the dividing line. That is, it can be considered that notification information is mainly transmitted in the "left part" and the "right part" respectively.

[0078] When the notification information includes routing information, the information transmission method provided by the embodiment of the present disclosure is used to implement the notification of routing information, and thus can also play a role in accelerating routing convergence.

[0079] In some implementations, the information transmission method provided by the embodiment of the present disclosure further includes: steps S100A1 and S100A2.

[0080] S100A1. In response to a change in a fault condition of a connected first link, determine corresponding notification content.

[0081] S100A2. Send corresponding initial notification information to the target downstream node.

[0082] The dividing line passes through the second link connected to the preset side of the current node, and the initial notification information includes the notification content; the target downstream node includes a node connected to the current node through another first link, and its corresponding initial notification information also includes the sum of the link index value of the current node; the target downstream node also includes a node connected to the current node through a second link deviating from the dividing line, and its corresponding initial notification information also includes the sum of the link index value of the current node and the sum of the link index value of the second bypass node; the target downstream node also includes a node connected to the current node through a second link crossing the dividing line.

[0083] When the fault condition of a link in a mesh network changes (such as a link being disconnected or restored), it is obvious that the node connected to the link is the first to "discover" it. Therefore, the node needs to generate "new" routing information and the corresponding boundary line, and "trigger" the process of transmitting routing information (notification information).

[0084] Therefore, when the fault condition of a first link changes, the two nodes connected by the first link respectively trigger the transmission of routing information; each node (the current node) determines the location of the dividing line and generates routing information, then adds the routing information and the location of the dividing line to the announcement content, and sends it to the two nodes connected to it through the second link, as well as the node connected to it through another first link through the initial announcement information.

[0085] The boundary line must pass through the second link, and the fault is located in the first link. Therefore, the current node needs to determine that the boundary line passes through the second link connected to one side of it (the right side in Figure 5) according to the pre-set settings.

[0086] The initial notification information (vertical notification) sent along the first link should include the sum of the link index values ​​of the current node itself.

[0087] Each link has a certain link index value, and the sum of the link index values ​​of all links that information passes through when it is transmitted to a node is the sum of the link index values ​​of the node.

[0088] In some implementations, the link indicator value is link delay.

[0089] In some implementations, the above link indicator value may be a link delay; thus, the sum of the link indicator values ​​of each node is the “accumulated delay” used for information transmission to the node.

[0090] The above nodes are the nodes that "trigger" the transmission of the announcement information. Therefore, the announcement information has not been transmitted at this time. Therefore, the cumulative delay of the current node in all initial announcement information (that is, the sum of the link indicator values, no longer distinguished below) is 0.

[0091] The second link connected to the current node must not cross the dividing line, and its corresponding initial notification information should include not only the accumulated delay of the current node itself, but also the accumulated delay of the upper node or lower node of the current node (the node connected to the current node along the first link, that is, the second bypass node).

[0092] The second bypass node is a node connected to the current node through the first link. Therefore, the accumulated delay of the second bypass node is equal to the accumulated delay of the current node (which is 0 at this time) plus the link delay (W) required for the notification information to be transmitted from the current node to the second bypass node.

[0093] The other second link connected to the current node must cross the dividing line, that is, the announcement information needs to be transmitted to the "other side" of the mesh network and start transmission. At this time, the node that receives the initial announcement information is the node that received the "trigger" information announcement of the "other side". Therefore, the initial announcement information transmitted through the second link across the dividing line only needs to include the announcement content (routing information and dividing line location) (of course, the link indicator value can also be added).

[0094] For example, referring to FIG. 5 , when the first link between node E and node H fails, node E and node H respectively determine that the dividing line is located on the second link on the right side thereof.

[0095] Node E sends initial notification information to nodes B and D respectively. The initial notification information includes the accumulated delay of node E ∑E=0. The initial notification information sent to node D also includes the accumulated delay of node E's second bypass node B (the first link between node E and node H has failed, so node H can no longer be regarded as node E's second bypass node) ∑B=∑E+W BE .

[0096] Symbol W BE Indicates the link delay between node B and node E. The same applies below.

[0097] It should be understood that node H also sends initial notification information to node K and node G in a similar manner, which will not be described in detail here.

[0098] The initial notification information sent to nodes B, D, K, and G does not cross the dividing line, so it is equivalent to nodes E and H "triggering" the transmission of notification information on the "left side" of the dividing line through these initial notification information.

[0099] Node E should also send initial notification information to node F (node ​​H sends initial notification information to node I) so that node F (node ​​I) "trigger" the transmission of notification information on the "right part" of the dividing line.

[0100] It should be understood that after any node receives the initial announcement information through the second link across the dividing line, it should "trigger" the transmission of the announcement information on "the part on that side" of the dividing line in a similar manner.

[0101] For example, referring to Figure 5, when node F and node I receive the initial announcement information transmitted from the second link across the dividing line, node F should further send the initial announcement information to the node on its right and node C, and node I should further send it to the node on the right of the initial announcement information and node L, thereby triggering the transmission of the announcement information on the "right part" of the dividing line.

[0102] The notification information sent by node F and node I to node C and node L is also equivalent to the initial notification information, so the notification information should also include its own cumulative delay ∑F and ∑I, that is, ∑F = ∑E + W EF , and ∑I=∑H+W HI ; The notification information (initial notification information) sent by node F and node I to the node on the right should also include the accumulated delay of their respective second bypass nodes.

[0103] In some implementations, the information transmission method provided by the embodiment of the present disclosure further includes: steps S100B1 and S100B2.

[0104] S100B1. In response to a change in the fault condition of the second connected link, determine corresponding notification content.

[0105] S100B2. Send corresponding initial notification information to the target downstream node.

[0106] The demarcation line passes through the second link where the fault condition changes, and the initial notification information includes the notification content; the target downstream node includes a node connected to the current node through another second link, and its corresponding initial notification information also includes the sum of the link index values ​​of the current node and the sum of the link index values ​​of the second bypass node; the target downstream node also includes a node connected to the current node through the first link, and its corresponding initial notification information also includes the sum of the link index values ​​of the current node.

[0107] If the second link fails, it can be determined that the boundary line is directly located on the second link, so that the two nodes connected to the second link can respectively trigger the transmission of notification information on their respective sides.

[0108] Similarly, the initial notification information sent by the current node also includes its own accumulated delay (value is 0), and the initial notification information sent through the second link (second direction notification) should also include the accumulated delay of the second bypass node.

[0109] For example, referring to Figure 6, when a second link fails, node F connected to the second link sends initial notification information to nodes B, E, and J respectively, triggering the transmission of notification information on the "left side" of the dividing line. All initial notification information includes its own cumulative delay ∑F=0, while the initial notification information sent to node E also includes node B's cumulative delay ∑B=∑F+W BF The cumulative delay of node J is ∑J=∑F+W FJ .

[0110] It should be understood that node G will also send initial notification information to node C, node H, and node K respectively to trigger the transmission of notification information on the "right side" of the dividing line.

[0111] In some embodiments, when the target link is the second link, the first notification information also includes the sum of the link index values ​​of the upstream node and the sum of the link index values ​​of the first bypass node, and the first bypass node is a node connected to the upstream node through the first link; determining the target downstream node and the corresponding second notification information based on the first notification information and the target link (step S103) includes: steps S103A1 and S103A2.

[0112] S103A1. Determine a node connected to the current node through another second link as a target downstream node, and determine that its corresponding second notification information also includes the sum of the link index value of the current node and the sum of the link index values ​​of the second bypass node.

[0113] S103A2: When the speed at which the notification information is transmitted from the current node to the second bypass node is faster than the speed at which the notification information is transmitted from the first bypass node to the second bypass node, determine the second bypass node as the target downstream node.

[0114] When the current node receives notification information (first notification information) through the second link (target link) on one side, if the second link does not cross the dividing line, it indicates that the notification information corresponds to the information transmission process within one side of the dividing line (i.e., information notification in the second direction). Therefore, the current node can directly determine that the node connected to the second link on the other side of the dividing line is the target downstream node, and add the cumulative delay (the sum of the link indicator values) of the current node itself, the upstream node, and the downstream node (the node connected to the current node along the first link, i.e., the second bypass node) to the notification information (second notification information) corresponding to the target downstream node.

[0115] Since the current node receives the first notification information through the second link, the upstream node of the current node must send the second notification information to the second link. Therefore, the notification information sent by the upstream node (the notification information received by the current node) includes the accumulated delay of the upstream node itself, the upstream node, and the downstream node (the node connected to the upstream node along the first link, that is, the first bypass node). Therefore, the accumulated delay of the current node itself and the second bypass node can be calculated based on the accumulated delay of the upstream node itself and the first bypass node plus the corresponding delay of the second link.

[0116] At the same time, the current node also compares the cumulative delay used for the notification information to be transmitted through itself to the upper node and the lower node (the node connected to the current node along the first link, that is, the second bypass node), and the cumulative delay used for the notification information to be transmitted through the upper node and the lower node of the upstream node (the node connected to the upstream node along the first link, that is, the first bypass node) to the second bypass node. If the speed of transmission through itself to a certain second bypass node is "faster", the second bypass node will also be used as the target downstream node, but it is determined that the corresponding second notification information does not need to include the cumulative delay.

[0117] For example, referring to Figure 7, node E (current node) receives the first notification information sent by node F (upstream node) on the right side of node E through the second link that does not cross the dividing line. The first notification information includes the cumulative delays ∑F, ∑C, and ∑I of node F, node C (first bypass node), and node I (first bypass node).

[0118] Therefore, node E determines that node D connected to the second link on the left side of node E is the target downstream node, and calculates the cumulative delays ∑E, ∑B, and ∑H of node E, node B (the second bypass node), and node H (the second bypass node) based on the cumulative delays ∑F, ∑C, and ∑I corresponding to nodes F, C, and I, that is, ∑E = ∑F + W EF ∑B=∑C+W BC ∑H=∑I+W HI ; Therefore, node E sends the announcement content (such as routing information and boundary line location) and ∑E, ∑B, ∑H as the second announcement information to node D.

[0119] At the same time, node E also determines whether to use node B and node H as target downstream nodes.

[0120] (1) For Node B

[0121] Node E calculates the cumulative delay of the notification information from node F to node E and then to node B ∑FB = ∑F + W EF +W BE , and the cumulative delay of the notification information from node C to node B ∑CB=∑C+WBC ; Then, compare the sizes of ∑FB and ∑CB: if ∑FB<∑CB, node B is determined to be the target downstream node, and the second notification information (excluding delay) is sent to node B; if ∑FB≥∑CB, node B is determined not to be the target downstream node, and there is no need to send the second notification information to node B.

[0122] (2) For node H

[0123] Node E calculates the cumulative delay of the notification information from node F to node E and then to node H ∑FH = ∑F + W EF +W EH , and the cumulative delay of the notification information from node I to node H ∑IH=∑I+W HI ; Then, compare the sizes of ∑FH and ∑IH: if ∑FH<∑IH, node H is determined to be the target downstream node, and the second notification information (excluding delay) is sent to node H; if ∑FH≥∑IH, node H is determined not to be the target downstream node, and there is no need to send the second notification information to node H.

[0124] In some embodiments, when the target link is the first link adjacent to the dividing line, the first notification information also includes the sum of the link indicator values ​​of the upstream nodes; determining the target downstream node and the corresponding second notification information based on the first notification information and the target link (step S103) includes steps S103B1 and S103B2.

[0125] S103B1: Determine a node connected to the current node through another first link as a target downstream node, and determine that its corresponding second notification information also includes the sum of the link index values ​​of the current node.

[0126] S103B2. Determine that a node connected to the current node through a second link that does not cross the dividing line is a target downstream node, and determine that its corresponding second notification information also includes the sum of the link index value of the current node and the sum of the link index value of the second bypass node.

[0127] For the node adjacent to the dividing line (current node), when the node receives the first notification information (i.e., information notification in the first direction) through the first link adjacent to the dividing line (target link, which is a fault-related link), it continues to send notification information (second notification information) along the first direction, and adds its own accumulated delay (the sum of the link indicator values) to the second notification information.

[0128] Since the current node receives the first notification information through the first link adjacent to the dividing line, the upstream node of the current node must send the second notification information along the first link adjacent to the dividing line. Therefore, the notification information sent by the upstream node (the notification information received by the current node) includes the accumulated delay of the upstream node itself.

[0129] At the same time, the current node also sends a second notification message through a second link that does not cross the dividing line, and adds its own accumulated delay and the accumulated delay of the upper node and the lower node (the node connected to the current node along the first link, that is, the second bypass node) to the second notification message.

[0130] For example, referring to FIG7 , node F receives the first notification information (including the accumulated delay ∑I of node I) sent by node I through the first link below and adjacent to the dividing line, and then continues to send the second notification information to node C through the first link, and adds the accumulated delay ∑F=∑I+W of node F to the second notification information. FI .

[0131] At the same time, node F also sends a second notification message to node E through the second link connected to it and away from the dividing line, and adds the accumulated delay of node F, node I, and node C ∑F=∑I+W to the second notification message. FI ,∑I,∑C=∑I+W FI +W FI .

[0132] However, since the second link on the right side of node F crosses the dividing line, node F determines not to send the second notification information to the node on the right side.

[0133] In some implementations, when the target link is the first link spaced from the dividing line, determining the target downstream node and the corresponding second notification information according to the first notification information and the target link (step S103 ) includes step S103C1 .

[0134] S103C1. Determine a node connected to the current node through another first link as a target downstream node.

[0135] When a node (current node) receives the first notification information through the first link (target link, which is a non-fault-related link) that is not adjacent to the dividing line, it only needs to continue sending the notification information (second notification information) in the first direction, and there is no need to add the accumulated delay (the sum of the link indicator values) to the second notification information.

[0136] Since the current node receives the first notification information through the first link that is not adjacent to the dividing line, its upstream node must send the second notification information to the first link that is not adjacent to the dividing line. Therefore, the notification information sent by the upstream node (the notification information received by the current node) does not include the accumulated delay.

[0137] For example, referring to FIG7 , node G receives the first notification information through the first link below and adjacent to the dividing line, and then continues to send the second notification information to the first link above, and the second notification information does not need to include the accumulated delay.

[0138] In some implementations, determining the target downstream node and the corresponding second notification information according to the first notification information and the target link (step S103 ) includes step S103D1 .

[0139] S103D1. In response to receiving first notification information having the same notification content at least a second time, stop processing the first notification information.

[0140] In the embodiment of the present disclosure, each node only processes the same notification content (such as routing information representing the same link failure) "once" without having to process it repeatedly; if for some reason, a node receives notification information (first notification information) including the same notification content multiple times, then except for the first first notification information, other first notification information will be "not processed".

[0141] For example, referring to Figure 7, node D may receive the first notification information from node E or the first notification information from node G. Therefore, when node D receives the first notification information for the first time, it can choose to process it according to the above steps S103A1 and S103A2, or S103C1 according to the topology state; and when node D receives the first notification information with the same notification content for the second time, no subsequent processing is performed.

[0142] For another example, referring to Figure 4, all polar-orbiting communication satellites in the same orbit are actually connected in a ring through the first link. Therefore, in one orbit, notification information transmitted upward and downward from one position may "meet" at a certain node, and the node will receive the first notification information with the same content twice.

[0143] For another example, for inclined orbit communication satellites, since there is no reverse seam, nodes in different parts on both sides of the dividing line can actually be connected through links on the other side of the earth. Therefore, a node may receive the same first notification information through the notification information transmission process on the left and right sides of the dividing line.

[0144] In summary, if each node in the mesh network transmits information according to the information transmission method provided in the embodiments of the present disclosure (using routing information notification as an example), then at the location of the fault, the routing information will first be notified along the first direction on each side of the dividing line (S103B2), and when the notification reaches each node, the transmission will "branch" out along the second direction (S103B1). Each node that receives the second-direction notification will, on the one hand, continue to notify in the second direction (S103A1), and on the other hand, will also determine, based on the accumulated delay, whether the notifications it sent to the upstream node and the downstream node (the node connected to the current node along the first link, i.e., the second bypass node) "preceded" the notification received by the node from the second direction. If so, it will also notify the corresponding nodes in the first direction (S103A2). Since different branches in the horizontal direction (second direction) have different notification speeds (different delays of the second link), according to the above method, the "faster" branch in the second direction can "turn" to the first direction for notification after surpassing the adjacent branch in the second direction (S103C1); and the original notification of the branch in the second direction is no longer processed because it arrives "latently" (S103D1).

[0145] For example, referring to Figure 8, routing information (notification information) is transmitted from the first link to node D, node H, and node L, and further transmitted to node C, node G, and node K respectively; node C calculates that the notification to node G is "faster" than the notification from node H to node G, so it notifies node G; thus, node G continues to notify node K based on the notification received "first" in the first direction, and does not process the notification received "later" from node H, so that the subsequent nodes F and node E of the branch in the second direction are also notified by nodes B and node A along the first direction respectively; and node G's notification to node K is "later" than node L's notification to node K, so that the subsequent node J of the branch in the second direction still receives the notification from node K, and processes it according to the order of the notification and the notification from node F.

[0146] Therefore, the information transmission method provided by the embodiment of the present disclosure can notify each node in the mesh network with the shortest possible delay and the least possible invalid transmission, thereby completing the notification information transmission.

[0147] In some embodiments, when the current node is not connected to the second link and the target link is the first link, determining the target downstream node and the corresponding second notification information according to the first notification information and the target link (step S103) includes step S103E1.

[0148] S103E1. Determine that the target downstream node includes a node connected to the current node through another first link.

[0149] In some cases, some nodes may "only" be connected to the first link (such as polar-orbiting communication satellites in the polar regions, as shown in FIG4 ). Therefore, after receiving the first notification information through a connected first link (target link), these nodes can only continue to transmit it in the first direction.

[0150] In some implementations, sending the corresponding second notification information to the target downstream node (step S104 ) includes step S104A1 .

[0151] S104A1 . In response to a link disconnection with a target downstream node, send second notification information in a detour manner.

[0152] The destination node of the second notification information sent in a detour manner is the target downstream node.

[0153] Multiple links in the mesh network may fail simultaneously, so the link between the current node and the selected target downstream node may be disconnected due to "other failures", that is, the second notification information cannot be transmitted to the target downstream node through the link.

[0154] When the above situation occurs, the current node needs to transmit the second notification information to the target downstream node in a "detour" manner.

[0155] For example, the current node can add a forwarding indication in the second notification information and then send it along another link. The forwarding indication is used to specify that the second notification information should "bypass" the path of the disconnected link to be transmitted to the target downstream node, thereby ensuring that the overall transmission process of the notification information is not affected.

[0156] It should be understood that the above second notification information should usually be "detoured" along a path with the shortest total delay (sum of link indicator values) possible, and the specific transmission method is diverse, such as being determined according to the location of the disconnected link, including the following three methods.

[0157] (1) The disconnected link is the second link

[0158] For example, referring to Figure 9, node E determines that node D is the target downstream node, but the second link between node E and node D is disconnected, so node E sends the second notification information that should have been sent directly to node D to node B, and forwards it to node D through the path of node B, node A, and node D, bypassing the disconnected second link.

[0159] The second notification information may also be forwarded via a path through node H, node G, and node D. The specific path to be used may be determined based on the delay, etc. (eg, a path with a shorter delay may be selected).

[0160] To unify the results, the delay in the above detour process can be excluded from the cumulative delay (the sum of the link index values). That is, node E can add the cumulative delays ∑E, ∑B, and ∑H of node E itself and the second bypass node to the second notification information it sends. After node D receives the second notification information that requires a detour, it still processes it as if the notification information comes directly from node E. For example, the cumulative delays of itself and the second bypass node are calculated as ∑D = ∑E + W DE , ∑A=∑B+W AB ,∑G=∑H+W GH .

[0161] If the target downstream node can receive the first notification message "first" via another path, it can skip processing the second notification message of the detour. For example, referring to Figure 9, if node A receives the first notification message from node B before receiving the first notification message of the detour, node A can skip processing the second notification message of the detour targeted at node D after receiving it.

[0162] (2) The disconnected link is the first link adjacent to the demarcation line (fault-related link)

[0163] Referring to Figure 10, node I determines that node F is the target downstream node, so it should send the second notification information to node F through the first link (fault-related link) adjacent to the dividing line, but the first link is disconnected, so node I sends the second notification information to node H through the second link that does not cross the dividing line; thereafter, the second notification information is transmitted along the first link of node H, node E, and node B, and in the first link, each node notifies the node on the left and the node on the right; thus, it is equivalent to the first link "one way away" from the dividing line "replacing" the original fault-related link to play the role of the first direction notification, and at the same time, the first link also "reverses" to notify the original fault-related link.

[0164] (3) The disconnected link is the first link separated from the boundary line (non-fault related link)

[0165] Referring to Figure 11, node B determines that node E is the target downstream node, so the second notification information should be sent to node E through the first link that is not adjacent to the dividing line. However, the first link is disconnected, so the second notification information can be forwarded to node E through the path of node A, node D, and node E.

[0166] Example 1

[0167] Exemplarily, the information transmission method (routing information transmission) provided by the embodiment of the present disclosure is described in detail below through examples.

[0168] 12 , at a certain moment, in a satellite communication network composed of polar-orbiting communication satellites as nodes, a fault occurs in the second link between two nodes A1 and A2, thereby setting a dividing line according to the fault location to divide the satellite communication network into a left part and a left part.

[0169] The following describes the routing information transmission process on the left side, which is triggered by node A2 and includes (1) to (4).

[0170] (1) Notification process from node A2 to node A3

[0171] The notification process from node A2 to node A3 is the notification along the second direction.

[0172] In the first step, node A2 sends the routing information (i.e., the content of the announcement in the announcement information, which may also include the location of the dividing line) to node A3, and adds the cumulative delay (sum of the link index values) of nodes A2, B2, and E2 to the announcement information (initial announcement information), ∑B2, ∑A2, ∑E2, where ∑A2 = 0 and ∑B2 = W. A2B2 , ∑E2=W A2E2 .

[0173] Node A2 regularly maintains the basic topology state based on its own position and orbit parameters, so the link delay W between node A2 and its neighbor nodes (such as W A2B2 、W A2E2 ) can be known.

[0174] For the same reason, the link delay W used by the following nodes is also known.

[0175] After receiving the routing information (first notification information) (through the target link), node A3 determines by default that it should notify node A4 (ie, send out the second notification information), and determines whether to notify node B3 and node E3.

[0176] Since node A4 is advertised by default, the routing information is sent to node A4, and the cumulative delays ∑B3, ∑A3, and ∑E3 of nodes A3, B3, and E3 are calculated and added to the advertisement information, ∑A3 = W A2A3 ,∑B3=∑B2+W B2B3 , ∑E3=∑E2+W E2E3 .

[0177] For node B3, node A3 determines whether it meets ∑A2+W A2A3 +W A3B3 <∑B2+W B2B3 If it meets the requirements, the routing information (excluding the information of the accumulated delay) will be sent to B3; if it does not meet the requirements, it is considered that node B2 will notify node B3 "first", so there is no need to notify.

[0178] For node E3, node A3 determines whether it meets ∑A2+W A2A3 +W A3E3 <∑E2+W E2E3 If it meets the requirements, the routing information (excluding the information of the accumulated delay) will be sent to E3; if it does not meet the requirements, it is considered that node E2 will notify node E3 "first", so there is no need to notify.

[0179] For the subsequent nodes A4, A5...An on the branch in the second direction, the above notification process is repeated until it reaches the node adjacent to the reverse seam, or a node "first" receives the notification from the longitudinal branch (inside the track).

[0180] (2) Notification process from node A2 to node B2

[0181] The notification process from node A2 to node B2 is a notification along the fault-related link.

[0182] In the first step, node A2 notifies node B2 of routing information, and adds the accumulated delay ΣA2=0 of node A2 to the notified information.

[0183] Step 2: After receiving the routing information, node B2 continues to notify node C2 of the routing information, and also notifies node B3 of the routing information, and adds the accumulated delay of node B2 ∑B2=∑A2+W to the notification information. A2B2 .

[0184] For node C2, similar to node B2, it continues to notify nodes D2 and C3 until the notification along the first direction passes through the Arctic region and reaches the other hemisphere, and "meets" the first direction notification along the direction from node A2 to node E2 at a certain node.

[0185] (3) Notification process from node A2 to node E2

[0186] The notification process from node A2 to node E2 is the same as the notification process from node A2 to node B2 and will not be described in detail.

[0187] (4) Overall notification process

[0188] Referring to Figure 12, nodes D1 to Dn in the Arctic region are only connected to the first link, so nodes C1 to Cn connected to them through the first link must respectively notify nodes D1 to Dn, and after receiving the notification information, nodes D1 to Dn also continue to notify along the other first link to which they are connected.

[0189] Referring to Figure 12 , node C4 determines that its notification to node B4 is faster, so it notifies node B4. Based on node C4's notification, node B4 continues to notify node A4 in the second direction, while ignoring the notification from node B3, which it received later. Node A4, having received node A3's notification first, continues to notify node A5 based on node A3's notification, while ignoring the notification from node B4, which it received later.

[0190] Referring to Figure 12 , node C5 similarly determines that its notification to node B5 is faster, so it notifies node B5. Based on node C5's notification, node B5 continues to notify node A5 in the second direction. As before, because node B4 no longer processes node B3's notification, node C5 does not receive node B4's notification. Node A5 processes the notification from node B5 or node A4 that arrives first, and does not process the notification that arrives later.

[0191] It should be understood that the routing information transmission process in the right part of FIG12 is also the same as the above process and will not be described in detail.

[0192] It should be understood that if the fault occurs in the first link (such as the first link between node A2 and node B2), the dividing line can be located on one side of the corresponding node according to the pre-set setting (such as still at the position in Figure 12), so that the two nodes on the left side of the dividing line connected to the faulty first link (node ​​A2 and node B2) together trigger the notification process of the left part, that is, the upper node (node ​​A2) notifies to the left (node ​​A3) and downward (node ​​E2), and the lower node (node ​​B2) notifies to the left (node ​​B3) and upward (node ​​C2). At the same time, the two nodes will also notify the routing information to the two nodes on the right side of the dividing line (node ​​A1 and node B1), and the two nodes on both sides of the dividing line also trigger the notification process of the right part; the subsequent process of the notification process on each side is the same as the above description, so it will not be described in detail.

[0193] In the second aspect, referring to Figure 13, an embodiment of the present disclosure provides a node, including a memory and a processor; the memory stores a computer program that can be executed by the processor, and the computer program is executed by the processor, so that the processor implements the information transmission method of the embodiment of the present disclosure.

[0194] The node provided in the embodiment of the present disclosure is a node that can execute the above method, that is, any node (current node) in the grid network, for example, a communication satellite, and further can be a polar orbit communication satellite or an inclined orbit communication satellite.

[0195] In a third aspect, referring to FIG. 14 , an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon. The computer program is executed by a processor, so that the processor implements the information transmission method of the embodiment of the present disclosure.

[0196] A processor is a device with data processing capabilities, including but not limited to a central processing unit (CPU); a memory is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and flash memory (FLASH); an I / O interface (read-write interface) is connected between the processor and the memory, enabling information exchange between the memory and the processor, including but not limited to a data bus (Bus).

[0197] Those skilled in the art will appreciate that all or some of the steps and functional modules / units in the apparatus disclosed above may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0198] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation.

[0199] Some or all of the physical components may be implemented as software executed by a processor (such as a central processing unit (CPU), a digital signal processor, or a microprocessor), or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or temporary media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH) or other disk storage; compact disc (CD-ROM), digital versatile disc (DVD) or other optical disc storage; magnetic cassettes, tapes, disk storage or other magnetic storage; any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0200] The present disclosure has disclosed example embodiments, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly stated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, it will be understood by those skilled in the art that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A method for information transmission, performed by any node in a mesh network, wherein the mesh network includes a first link connecting nodes adjacent to each other in a first direction, and a second link connecting nodes adjacent to each other in a second direction; the method comprising: Receiving first notification information from an upstream node; The first notification information includes notification content; Determining a target link according to a topological state of the mesh network; The target link is a link between the current node and the upstream node, and the target link includes one of the first link and the second link; Determine a target downstream node and corresponding second notification information according to the first notification information and the target link; Sending corresponding second notification information to the target downstream node; the second notification information includes the notification content.

2. The method according to claim 1, wherein: In the case where the target link is the second link, the first notification information further includes a sum of link index values ​​of the upstream node and a sum of link index values ​​of a first bypass node, where the first bypass node is a node connected to the upstream node through the first link; The determining the target downstream node and the corresponding second notification information according to the first notification information and the target link includes: Determine that a node connected to the current node through another second link is the target downstream node, and determine that the second notification information corresponding to the target downstream node also includes the sum of the link index value of the current node and the sum of the link index value of the second bypass node; the second bypass node is a node connected to the current node through the first link; In a case where a speed at which the notification information is transmitted from the current node to the second bypass node is faster than a speed at which the notification message is transmitted from the first bypass node to the second bypass node, the second bypass node is determined to be a target downstream node.

3. The method according to claim 1, wherein: The notification content includes the link failure status and the corresponding demarcation line position, wherein the demarcation line passes through the second link at the link failure location and extends along the first direction; In the case where the target link is the first link adjacent to the boundary line, the first notification information further includes the sum of link indicator values ​​of the upstream nodes; and determining the target downstream node and the corresponding second notification information according to the first notification information and the target link includes: determining a node connected to the current node through another first link as the target downstream node, Determine that the second notification information corresponding to the target downstream node also includes the sum of the link index values ​​of the current node; Determine that the node connected to the current node through the second link that does not cross the dividing line is the target downstream node, and determine that the second notification information corresponding to the target downstream node also includes the sum of the link index value of the current node and the sum of the link index value of the second bypass node; the second bypass node is the node connected to the current node through the first link.

4. The method according to claim 3, wherein: In a case where the target link is the first link spaced apart from the dividing line; The determining the target downstream node and the corresponding second notification information according to the first notification information and the target link includes: A node connected to the current node through another first link is determined as the target downstream node.

5. The method according to claim 3, further comprising: In response to a change in a fault condition of the first connected link, determining corresponding notification content; Sending corresponding initial notification information to the target downstream node; The demarcation line passes through the second link connected to the preset side of the current node, and the initial notification information includes the notification content; The target downstream node includes a node connected to the current node through another first link, and the initial notification information corresponding to the target downstream node also includes the sum of the link index values ​​of the current node; The target downstream node also includes a node connected to the current node through the second link deviating from the dividing line, and the initial notification information corresponding to the target downstream node also includes the sum of the link index value of the current node and the sum of the link index value of the second bypass node; The target downstream node also includes a node connected to the current node through the second link crossing the dividing line.

6. The method according to claim 3, further comprising: In response to a change in the fault condition of the second connected link, determining corresponding notification content; Sending corresponding initial notification information to the target downstream node; Wherein, the demarcation line passes through the second link whose fault condition changes, and the initial notification information includes the notification content; The target downstream node includes a node connected to the current node through another second link, and the initial notification information corresponding to the target downstream node also includes a link indicator of the current node. The sum of the values ​​and the link index value of the second bypass node; The target downstream node also includes a node connected to the current node through the first link, and the initial notification information corresponding to the target downstream node also includes the sum of the link index values ​​of the current node.

7. The method according to claim 1, wherein: When the current node is not connected to the second link and the target link is the first link, determining the target downstream node and the corresponding second notification information according to the first notification information and the target link includes: The target downstream node is determined to include a node connected to the current node through another first link.

8. The method according to claim 1, wherein: The determining the target downstream node and the corresponding second notification information according to the first notification information and the target link includes: In response to receiving the first notification information having the same notification content at least a second time, stopping processing the first notification information.

9. The method according to claim 1, wherein: The sending the corresponding second notification information to the target downstream node includes: In response to a link disconnection with the target downstream node, the second notification information is sent in a detour manner; the destination node of the second notification information sent in a detour manner is the target downstream node.

10. The method according to claim 1, wherein: The link index values ​​of all the first links are the same; The link indicator values ​​of at least some of the second links are different.

11. The method according to claim 1, wherein: The link indicator value is the link delay.

12. The method according to claim 1, wherein: The node is a polar orbit communication satellite or an inclined orbit communication satellite; The grid network is a satellite communication network.

13. A node, comprising a memory and a processor; the memory stores a computer program executable by the processor, the computer program is executed by the processor, so that the processor implements the information transmission method described in any one of claims 1 to 12.

14. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor so that the processor implements the information transmission method according to any one of claims 1 to 12.

Citation Information

Patent Citations

  • Topological information synchronization method of low earth orbit satellite network and related equipment

    CN113472652A

  • Space satellite network route updating method, satellite and electronic equipment

    CN116132351A

  • Systems, methods, and devices for reducing overhead messaging in networks

    US20150223112A1

  • Link state steering

    US20220272022A1

  • Control routing method, apparatus, and system in satellite network

    WO2023065855A1