Information transmission method, node and computer readable medium

Abstract

The invention provides an information transmission method, which is executed by any node in a mesh network, and the mesh network comprises a first link for connecting adjacent nodes along a first direction and a second link for connecting adjacent nodes along a second direction. The method comprises the following steps: receiving first notification information of an upstream node; the first notification information comprises notification content; determining a target link between the current node and the upstream node according to the topological state of the mesh network, wherein the target link comprises one of a first link and a second link; sending corresponding second notification information to the target downstream node; the second notification information comprises the notification content. The invention further provides a node and a computer readable medium.

Description

Technical Field

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

[0002] When the 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.

[0003] However, the bandwidth overhead of existing routing information announcement is large and the cost of routing convergence is high. Summary of the invention

[0004] The present disclosure provides an information transmission method, a node, and a computer-readable medium.

[0005] In a first aspect, an embodiment of the present disclosure provides a method for information transmission, which is 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 includes:

[0006] Receiving first notification information from an upstream node; the first notification information includes notification content;

[0007] Determine a target link according to the topological state of the mesh network; the target link is a link between the current node and the upstream node, including one of the first link and the second link;

[0008] Determine a target downstream node and corresponding second notification information according to the first notification information and the target link;

[0009] Sending corresponding second notification information to the target downstream node; the second notification information includes the notification content.

[0010] In a second aspect, an embodiment of the present disclosure provides a node, which includes a memory and a processor; the memory stores a computer program that can be executed by the processor, and when the computer program is executed by the processor, it implements any one of the information transmission methods of the embodiments of the present disclosure.

[0011] In a third aspect, an embodiment of the present disclosure provides a computer-readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements any one of the information transmission methods of the embodiments of the present disclosure.

[0012] In the disclosed embodiments, each node (such as a communication satellite) determines the transmission path of the announcement information (such as routing information) in a "path-by-path" manner according to the network topology, so that the announcement information transmission is performed under certain constraints. The announcement information can be transmitted to each node of the mesh network at a faster speed while minimizing "invalid" transmission, thereby reducing the bandwidth overhead of information announcements. For example, when used to announce routing information, the routing convergence cost can also be reduced (such as reducing the convergence delay). BRIEF DESCRIPTION OF THE DRAWINGS

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

[0014] Figure 1 A flowchart of a method for information transmission provided by an embodiment of the present disclosure;

[0015] Figure 2 A schematic diagram of the structure of a topology unit in a mesh network according to an embodiment of the present disclosure;

[0016] Figure 3 A schematic diagram showing the position distribution of polar orbit communication satellites in the eastern and western hemispheres at a certain moment;

[0017] Figure 4 The schematic diagram of the structure of a satellite communication network of a polar orbit communication satellite at a given moment;

[0018] Figure 5 A schematic diagram of a process of information transmission when a first link fails in an information transmission method provided by an embodiment of the present disclosure;

[0019] Figure 6 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;

[0020] Figure 7 A schematic diagram of the information transmission process in a method for information transmission provided by an embodiment of the present disclosure;

[0021] Figure 8 A schematic diagram of the information transmission process in another information transmission method provided by an embodiment of the present disclosure;

[0022] Fig. 9 A schematic diagram of a process of information transmission when a link is disconnected in a method for information transmission provided by an embodiment of the present disclosure;

[0023] Fig.10 A schematic diagram of a process of information transmission when a link is disconnected in another information transmission method provided by an embodiment of the present disclosure;

[0024] Fig.11 A schematic diagram of a process of information transmission when a link is disconnected in another information transmission method provided by an embodiment of the present disclosure;

[0025] Fig.12 A schematic diagram of the information transmission process in another information transmission method provided by an embodiment of the present disclosure;

[0026] Fig.13 A block diagram of a node provided in an embodiment of the present disclosure;

[0027] Fig.14 A block diagram of a computer-readable medium provided for an embodiment of the present disclosure. DETAILED DESCRIPTION

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

[0029] 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 being limited to the embodiments set forth below. On the contrary, the purpose of providing these embodiments is to make the present disclosure thorough and complete, and will enable those skilled in the art to fully understand the scope of the present disclosure.

[0030] 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, and are used together with the detailed embodiments 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.

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

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

[0033] The terms used in the present disclosure are only used to describe specific embodiments and are not intended to limit the present disclosure. The term "and / or" as used in the present disclosure includes any and all combinations of one or more related enumerated items. The singular forms "one" and "the" as used in the present disclosure are also intended to include plural forms, unless the context clearly indicates otherwise. The terms "including", "made of..." as used in the present disclosure specify the presence of the 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.

[0034] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meaning as commonly understood by those of ordinary skill 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 explicitly defined in this disclosure.

[0035] 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 intended to be limiting.

[0036] 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, thus realizing the integration of space and earth.

[0037] The connection relationship between communication satellites in a satellite communication network is called its "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.

[0038] Among them, the communication satellite will run according to the predetermined trajectory, so the topological state of the satellite communication network will change periodically, and this change is "predictable". Therefore, the topological state or routing information of the satellite communication network at each time slice can be stored in advance in each communication satellite, so the communication satellite can calculate the route according to the routing information "at that time" at any time.

[0039] Due to sudden failures and subsequent recovery, the links between communication satellites may be disconnected or restored unexpectedly, and such link failures may cause "unpredictable" changes in the topology state. When the topology state changes "unpredictably", the "new" routing information changed due to the link failure (failure or recovery) should be notified to all communication satellites to ensure that subsequent communication satellites can calculate the route that conforms to the changed topology state based on the "new" routing information.

[0040] In the related art, global transmission of "new" routing information is performed by flooding. However, flooding transmission is unconstrained, in which each communication satellite will forward the routing information to all other communication satellites connected to it, and each communication satellite will also receive the routing information "multiple times", thus generating a large number of "invalid" transmissions, resulting in large bandwidth overhead and high routing convergence cost (such as delay).

[0041] 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.

[0042] 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.

[0043] Reference Figure 2 , multiple nodes with information transmission functions can be interconnected (communication connection) to form a "grid network".

[0044] In a mesh network, nodes adjacent to each other along a first direction are connected by a first link, and nodes adjacent to each other along a second direction (a direction intersecting the first direction and further perpendicular to the first direction) are connected by a second link. Thus, the topological relationship of the mesh network is similar to that of a "two-dimensional mesh". The basic structural unit (topological unit) can be referred to as Figure 2 .

[0045] It should be understood that the various 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.

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

[0047] As one mode of an embodiment of the present disclosure, the delays of all the above first links may be the same, that is, the time taken to transmit information on all the first links is the same; and the delays of at least some of the second links are 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.

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

[0049] As one embodiment of the present disclosure, the above grid network may be a satellite communication network (constellation network), in which each node is a communication satellite, and may further be a polar-orbiting communication satellite or an inclined-orbiting communication satellite, especially a low-orbit (LEO) polar-orbiting communication satellite.

[0050] Reference Figure 3 A polar-orbiting communications satellite is a communications satellite that orbits along an orbit that passes through the North and South Poles and is perpendicular to the equator, that is, its orbit is along the longitude direction.

[0051] Therefore, at any time, the distance between any adjacent polar-orbiting communication satellites in the same orbit is the same, and the delay is also the same, so that the 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), and the distance between polar-orbiting communication satellites in adjacent orbits at high latitudes is short, and the delay is small, while the distance between polar-orbiting communication satellites in adjacent orbits at low latitudes is far, and the delay is up.

[0052] Among them, refer to Figure 3 Since the polar-orbiting communication satellites in one orbit move in opposite directions in the eastern and western hemispheres, there must be a situation where the 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, so there is a "reverse gap".

[0053] Among them, refer to Figure 3 Since the relative speed between polar-orbiting communication satellites in different orbits is 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.

[0054] Therefore, the satellite communication network formed by polar orbit communication satellites can be equivalent to the reference Figure 4 form.

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

[0056] In some embodiments, the notification information in the embodiments of the present disclosure may be a notification of routing information, that is, the notification content in the notification information may include routing information.

[0057] Among them, when information is to be transmitted in a mesh network, nodes need to calculate the route (transmission path) of the information based on pre-stored routing information, and the 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 link failure), the changed "new" routing information needs to be notified to all nodes.

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

[0059] Each node that is executing the method of the embodiment of the present disclosure is referred to as a “current node”.

[0060] It should be understood that the above “current node” is a synonym for the node that “this time” executes the method described in the embodiment of the present disclosure, rather than a special node in the mesh network.

[0061] Reference Figure 1 , the information transmission method of the embodiment of the present disclosure includes:

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

[0063] The first notification information includes notification content.

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

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

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

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

[0068] The second notification information includes notification content.

[0069] 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.

[0070] For example, when the link failure condition 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 the routing information can be added to the notification information for transmission as notification content, so that when all nodes receive the notification information (routing information), the routing information can be updated (routing convergence) .

[0071] For any node (current node), after receiving the notification information (first notification information), it can determine the link (target link) for transmitting the first notification as the first link or the second link according to the topological state of the mesh network, that is, determine the "source direction" of the first notification as the first direction or the second direction.

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

[0073] 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.

[0074] 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.

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

[0076] In the disclosed embodiments, each node (such as a communication satellite) determines the transmission path of the announcement information (such as routing information) in a "path-by-path" manner according to the network topology, so that the announcement information transmission is performed under certain constraints. The announcement information can be transmitted to each node of the mesh network at a faster speed while minimizing "invalid" transmission, thereby reducing the bandwidth overhead of information announcements. For example, when used to announce routing information, the routing convergence cost can also be reduced (such as reducing the convergence delay).

[0077] In some embodiments, the notification content includes a link failure condition and a corresponding boundary line position, where the boundary line passes through the second link at the link failure location and extends along the first direction.

[0078] Among them, refer to Figure 5 , Figure 6 The routing information needs to be notified 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.

[0079] At this time, the announcement content in the announcement content, in addition to the link failure situation (ie, routing information), should also include information representing the position of the above dividing line.

[0080] 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, which is used to ensure that the normal notification information should not be transmitted across the dividing line, that is, it can be considered that the notification information is mainly transmitted in the "left part" and the "right part" respectively.

[0081] When the notification information includes routing information, the embodiment of the present disclosure is used to implement the notification of routing information, so it can also play a role in accelerating routing convergence.

[0082] In some embodiments, the method of the present disclosure further includes:

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

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

[0085] The demarcation line passes through a second link connected to a preset side of the current node, and the initial notification information includes notification content;

[0086] The target downstream node includes a node connected to the current node through another first link, and the corresponding initial notification information also includes the sum of the link index values ​​of the current node;

[0087] The target downstream node also includes a node connected to the current node via 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;

[0088] The target downstream node also includes a node connected to the current node via a second link across the dividing line.

[0089] When the fault condition of a link in a mesh network changes (such as link disconnection or recovery), it is obvious that the node connected to the link is the first to "discover" it, so the node needs to generate "new" routing information and corresponding demarcation lines, and "trigger" the process of routing information (notification information) transmission.

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

[0091] The boundary line must pass through the second link, and the fault is located on the first link at this time. Therefore, the current node needs to determine the boundary line through the connection on its side according to the pre-set setting (such as Figure 5 is the second link on the right).

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

[0093] 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 its link index values.

[0094] In some embodiments, the link indicator value is link delay.

[0095] As one method of an embodiment of the present disclosure, the above link indicator value may be the link delay; thus, the sum of the link indicator values ​​of each node is the "accumulated delay" used for information transmission to the node.

[0096] Among them, the above nodes are the nodes that "trigger" the transmission of the announcement information, so the announcement information has not been transmitted at this time, so 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.

[0097] Among them, a second link connected to the current node must not cross the dividing line, and its corresponding initial notification information includes not only the accumulated delay of the current node itself, but also the accumulated delay of the upper and lower nodes (second bypass nodes) of the current node.

[0098] Among them, the second bypass node is a node connected to the current node through the first link, so 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.

[0099] Among them, 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 part" of the mesh network and start transmission, and the node that receives the initial announcement information at this time is the node that "trigger" the announcement of the "other side part", so 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 position) (of course, the link indicator value can also be summed).

[0100] For example, refer to Figure 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.

[0101] Among them, node E sends initial notification information to node B and node D respectively, and the initial notification information includes the accumulated delay of node E ∑E=0, and 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 .

[0102] Among them, the symbol W XY Indicates the link delay of the link between node X and node Y, the same below.

[0103] 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.

[0104] Among them, the initial notification information sent to node B, node D, node K, and node G did not cross the dividing line, so it is equivalent to node E and node H "triggering" the transmission of notification information on the "left side" of the dividing line through these initial notification information.

[0105] Among them, 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 of the "right part" of the dividing line.

[0106] It should be understood that, after receiving the initial announcement information via the second link across the dividing line, any node should "trigger" the transmission of the announcement information on "the side" of the dividing line in a similar manner.

[0107] For example, refer 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 it to the node on its right, node C, and node I should further send it to the node on its right, node L, thereby triggering the transmission of announcement information on the "right part" of the dividing line.

[0108] Among them, 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 it should also include its own accumulated 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 its second bypass node.

[0109] In some embodiments, the method of the present disclosure further includes:

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

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

[0112] Wherein, the demarcation line passes through the second link where the fault condition changes, and the initial notification information includes notification content;

[0113] The target downstream node includes a node connected to the current node through another second link, and the 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;

[0114] 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.

[0115] 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.

[0116] 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 (horizontal notification) should also include the accumulated delay of the second bypass node.

[0117] For example, refer to Figure 6 , when a second link fails, the node F connected to it 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, and all initial notification information includes its own cumulative delay ∑F=0, while the initial notification information sent to node E also includes the cumulative delay of node B ∑B=∑F+W BF The cumulative delay of node J is ∑J=∑F+W FJ .

[0118] 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.

[0119] In some embodiments, when the target link is the second link, the first notification information further includes the sum of link index values ​​of the upstream node and the sum of 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 (S103) according to the first notification information and the target link includes:

[0120] 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 value of the second bypass node.

[0121] 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.

[0122] When the current node receives the notification information (first notification information) through the second link (target link) on its side, if the second link does not extend across the dividing line, it indicates that the notification information corresponds to the information transmission process inside one side of the dividing line (i.e., horizontal information notification). Therefore, the current node can directly determine that the node connected to the second link on the other side is the target downstream node, and add the accumulated delay (sum of link indicator values) of the current node itself and its upper and lower nodes (second bypass nodes) to the notification information (second notification information) corresponding to the target downstream node.

[0123] Among them, since the current node receives the first notification information through the second link, its upstream 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 and its upstream and downstream nodes (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.

[0124] At the same time, the current node also compares the cumulative delay used for the notification information to be transmitted through itself to the upstream and downstream nodes (second bypass nodes), and the cumulative delay used for the notification information to be transmitted through the upstream and downstream nodes (first bypass nodes) of the upstream node to the second bypass node. If the speed of transmission to a second bypass node through itself 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.

[0125] For example, refer to Figure 7 Node E (current node) receives the first notification information sent by node F (upstream node) on its right through the second link that does not pass through the dividing line. The first notification information includes the accumulated delays ∑F, ∑C, and ∑I of node F, node C (first bypass node), and node I (first bypass node).

[0126] Therefore, node E determines that node D connected to the second link on its left side is the target downstream node, and calculates the cumulative delays ∑E, ∑B, ∑H of node E, node B (second bypass node), and node H (second bypass node) according to the cumulative delays ∑F, ∑C, ∑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 position) and ∑E, ∑B, ∑H as the second announcement information to node D.

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

[0128] (1) For Node B

[0129] 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+W BC ; 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 it; 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 it.

[0130] (2) For node H

[0131] 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 it; 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 it.

[0132] In some embodiments, when the target link is a first link adjacent to the demarcation line, the first notification information further includes a sum of link indicator values ​​of upstream nodes; determining the target downstream node and the corresponding second notification information (S103) according to the first notification information and the target link includes:

[0133] S103B1. Determine that a node connected to the current node through another first link is 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.

[0134] 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.

[0135] For the node adjacent to the dividing line (current node), when it receives the first notification information (i.e., information notification in the vertical 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 link indicator values) to the second notification information.

[0136] Among them, since the current node receives the first notification information through the first link adjacent to the dividing line, its upstream node must send the second notification information to 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.

[0137] At the same time, the current node also sends a second notification message through a second link that does not cross the boundary line, and adds its own accumulated delay and the accumulated delays of the upper and lower nodes (second bypass nodes) to the second notification message.

[0138] For example, refer to Figure 7 , node F receives the first notification information sent by node I through the first link adjacent to the dividing line below (including the accumulated delay ∑I of node I), 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 .

[0139] At the same time, node F also sends a second notification message to node E through the second link connected to it and deviating from the demarcation 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 .

[0140] 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 its right side.

[0141] In some embodiments, when the target link is a first link spaced from the demarcation line, determining the target downstream node and the corresponding second notification information (S103) according to the first notification information and the target link includes:

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

[0143] When a node (current node) receives the first notification information through a first link (target link, 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) along 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.

[0144] Among them, 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.

[0145] For example, refer to Figure 7 , 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 it is not necessary to include the accumulated delay.

[0146] In some embodiments, determining the target downstream node and the corresponding second notification information according to the first notification information and the target link (S103) includes:

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

[0148] In the disclosed embodiment, each node processes the same notification content (such as routing information representing the same link failure) only "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".

[0149] For example, refer 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 S101A method or S101C method 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.

[0150] For example, refer 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 notification content twice.

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

[0152] In summary, if each node in the mesh network transmits information according to the method of the embodiment of the present disclosure (taking the notification of routing information as an example), then at the location where the fault occurs, the routing information will first be notified in the vertical direction on each side of the dividing line (S103B2), and when notified to each node, the transmission along the horizontal direction will be "branched" out (S103B1). Each node that receives the horizontal notification will continue to notify in the horizontal direction (S103A1) on the one hand, and on the other hand, it will also determine whether the notification it made to the upper and lower nodes (the second bypass node) is "prior" to the notification received by the node from the horizontal direction based on the accumulated delay. If so, it will also notify in the corresponding vertical direction (S103A2). Since different branches in the horizontal direction (second direction) have different notification speeds (different delays of the second link), the above method allows the "faster" horizontal branch to "turn to" the vertical direction for notification (S103C1) after exceeding the adjacent horizontal branch; and the original notification of the horizontal branch is no longer processed because it arrives "later" (S103D1).

[0153] For example, refer to Figure 8 , the routing information (notification information) is transmitted from the first link to node D, node H, node L, and further to node C, node G, and node K; among them, node C calculates that its 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 according to the notification received "first" in the vertical direction, and does not process the notification received "later" from node H, so that the subsequent nodes F and E of the horizontal branch are also notified by nodes B and node A along the vertical direction respectively; and the notification of node G to node K is "later" than the notification of node L to node K, so that the subsequent node J of the horizontal branch still receives the notification of node K, and processes it according to the order of the notification and the notification from node F.

[0154] Therefore, the embodiments of the present disclosure can notify each node in the mesh network and complete the transmission of notification information with the shortest possible delay and the least possible invalid transmission.

[0155] 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 (S103) according to the first notification information and the target link includes:

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

[0157] In some cases, some nodes may be connected "only" to the first link (see Figure 4, polar-orbiting communication satellites in the polar regions), so after these nodes receive the first notification information through a first link (target link) to which they are connected, they can only continue to transmit it along the first direction.

[0158] In some embodiments, sending the corresponding second notification information to the target downstream node (S104) includes:

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

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

[0161] There may be multiple links in the mesh network that fail at the same time, 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.

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

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

[0164] It should be understood that the second notification information above 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:

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

[0166] For example, refer to Fig. 9 Node E determines that node D is the target downstream node, but the second link between it 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.

[0167] The second notification information may also be forwarded through a path of 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 short delay is selected).

[0168] In order to unify the results, the delay in the above detour process may not be included in the cumulative delay (sum of link index values), that is, node E may add its own and the second bypass node's cumulative delay ∑E, ∑B, ∑H in the second notification information sent out, and after node D receives the second notification information that requires detour, it still processes it as if the notification information comes directly from node E, such as calculating the cumulative delay of itself and the second bypass node as ∑D=∑E+W DE ,∑A=∑B+W AB ,∑G=∑H+W GH .

[0169] If the target downstream node can receive the first notification information "first" through other paths, the second notification information of the detour may not be processed. Fig. 9 If node A receives the first notification information from node B before receiving the first notification information of the detour, node A may not process the second notification information of the detour whose target is node D after receiving it.

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

[0171] Reference Fig.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 vertical path of node H, node E, and node B, and in the vertical path, each node notifies the node on the left and the node on the right; thus, the vertical path "separated by one path" from the dividing line "replaces" the original fault-related link to play the role of vertical notification, and at the same time, the vertical path also "reverses" the original fault-related link for notification.

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

[0173] Reference Fig.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.

[0174] Example 1

[0175] Exemplarily, a specific information transmission method (routing information transmission) of an embodiment of the present disclosure is described in detail below.

[0176] Reference Fig.12 ,At a certain moment, in the satellite communication network composed of polar ,orbiting communication satellites as nodes, the second link between two nodes A1 and ,A2 fails, so that a dividing line is set according to the fault ,location, and the satellite communication network is divided into the left part and the left part.

[0177] The following is an introduction to the routing information transmission process on the left side, which is triggered by node A2 and includes:

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

[0179] The notification process from node A2 to node A3 is a horizontal notification.

[0180] 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 accumulated delays (sum of link index values) ∑B2, ∑A2, ∑E2 of nodes A2, B2, and E2 to the announcement information (initial announcement information), where ∑A2=0, ∑B2=W A2B2 ,∑E2=W A2E2 .

[0181] Among them, node A2 regularly maintains the basic topological state based on its own position and orbital parameters, so the link delay W between it and its neighbor nodes (such as W A2B2 , W A2E2 ) can be known.

[0182] Based on the same reasoning, the link delay W used by the following nodes can also be known.

[0183] In the second step, after receiving the routing information (first notification information) (through the target link), node A3 determines by default that node A4 should be notified (ie, sends out the second notification information), and determines whether to notify node B3 and node E3.

[0184] Since node A4 is notified 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 notification information, where ∑A3 = W A2A3 ,∑B3=∑B2+W B2B3 ,∑E3=∑E2+W E2E3 .

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

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

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

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

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

[0190] 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.

[0191] 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 .

[0192] Node C2 continues to notify nodes D2 and C3 in a similar manner to node B2 until the notification in the vertical direction passes through the Arctic region and reaches the other hemisphere, and "meets" the vertical notification in the direction from node A2 to node E2 at a certain node.

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

[0194] The notification process from node A2 to node E2 is consistent with the notification process from node A2 to node B2 and will not be described in detail.

[0195] (4) Overall notification process

[0196] Among them, refer to Fig.12 , nodes D1-node Dn in the Arctic region are only connected to the first link, so nodes C1-node Cn connected to them through the first link must notify nodes D1-node Dn respectively, and after receiving the notification information, nodes D1-node Dn continue to notify along the other first link to which they are connected.

[0197] Among them, refer to Fig.12, node C4 determines that the notification it makes to node B4 is "faster", so it notifies node B4. For node B4, it continues to notify node A4 along the second direction according to the notification of node C4, and no longer processes the notification of node B3 received "later". For node A4, it first receives the notification of node A3, so it continues to notify node A5 according to the notification of node A3, and no longer processes the notification of node B4 received "later".

[0198] Among them, refer to Fig.12 , node C5 also determines that the notification it made to node B5 is "faster", so it notifies node B5. For node B5, it continues to notify node A5 along the second direction according to the notification of node C5, and as before, because node B4 no longer processes the notification of node B3, node C5 will not receive the notification of node B4. For node A5, it processes the notification that "arrived first" among the notifications of node B5 and node A4, and no longer processes the notification that "arrived later".

[0199] It should be understood that Fig.12 The routing information transmission process on the right side of is the same as the above process and will not be described in detail.

[0200] 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 boundary line may be located on one side of the corresponding node according to the pre-set (such as still on the other side). Fig.12 ), so that the two nodes on the left side of the dividing line connected to the first failed 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 and upward, and the lower node (node ​​B2) notifies to the left and downward, and at the same time, the two nodes 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 the two sides of the dividing line also trigger the notification process of the right part; wherein, 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.

[0201] Second, refer to Fig.13 An embodiment of the present disclosure provides a node, which includes a memory and a processor; the memory stores a computer program that can be executed by the processor, and when the computer program is executed by the processor, any information transmission method of the embodiment of the present disclosure is implemented.

[0202] 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.

[0203] Thirdly, refer to Fig.14An embodiment of the present disclosure provides a computer-readable medium on which a computer program is stored. When the computer program is executed by a processor, any information transmission method of the embodiment of the present disclosure is implemented.

[0204] Among them, the processor is a device with data processing capabilities, including but not limited to the central processing unit (CPU); the 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), flash memory (FLASH); the I / O interface (read-write interface) is connected between the processor and the memory, and can realize information exchange between the memory and the processor, including but not limited to the data bus (Bus), etc.

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

[0206] 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.

[0207] Some physical components or all 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 implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-temporary medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium 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; read-only compact disk (CD-ROM), digital versatile disk (DVD) or other optical disk storage; magnetic cassettes, magnetic 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, it is well known to those skilled in the art that 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.

[0208] 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 limiting purposes. 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, those skilled in the art will appreciate 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, including 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 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; 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 information 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: Determine that a node connected to the current node through another first link is the target downstream node, and determine that the corresponding second notification information also includes the sum of the link index value 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 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; 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, wherein: Also includes: 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 corresponding initial notification information 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 via the second link deviating from the dividing line, and the 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 the second link crossing the dividing line.

6. The method according to claim 3, wherein: Also includes: 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 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 the first link, and the corresponding initial notification information 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, and the computer program, when executed by the processor, implements the method for information transmission as claimed in any one of claims 1 to 12.

14. A computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method for transmitting information according to any one of claims 1 to 12 is implemented.

Images