Method for Establishing Reverse Path of Central Node Based on Wireless Mesh Network and Related Devices

Abstract

The present application relates to a method for establishing a reverse path of a central node based on a wireless Mesh network and related devices, and relates to the technical field of wireless networks. The method includes: reporting a countdown for the forward best path of each routing node; reporting the forward best path of the first reported routing node determined based on the reported countdown as a valid path to the next-hop routing node; taking the next-hop routing node as the current routing node, if the valid path reported to the current routing node duplicates the forward best path of the current-hop routing node, cancel the reporting countdown for the forward best path of the current routing node, report the valid path reported to the current routing node to the next-hop routing node, and continue to take the next-hop routing node as the current routing node until the valid path is reported to the central node; establishing a reverse best path according to the valid path reported to the central node. Using this method can reduce the wireless network overhead.

Description

Technical Field

[0001] This application relates to the field of wireless network technologies, and particularly to a method for establishing a reverse path of a central node based on a wireless Mesh network and related devices. Background Art

[0002] With the development of smart homes, more and more smart home devices have networking capabilities, and these smart home devices need to use some wireless network technologies during use. Generally, in wireless network technologies, when each routing node needs to communicate with each other but cannot reach the destination node in a single hop, such as the central node, it is necessary to establish paths for each routing node to reach the destination node respectively. On this basis, it is also necessary to establish paths from the destination node to each routing node to achieve two-way communication between each routing node and the central node. However, in traditional methods for establishing the reverse path of the central node, there may be a problem of repeated reporting during the process of each routing node reporting the path, resulting in a large overhead of the wireless network. Summary of the Invention

[0003] Based on this, in view of the above technical problems, it is necessary to provide a method, device, system, computer device, storage medium, and computer program product for establishing a reverse path of a central node based on a wireless Mesh network that can reduce the overhead of the wireless network.

[0004] In a first aspect, this application provides a method for establishing a reverse path of a central node based on a wireless Mesh network, the method including:

[0005] Report countdowns for the forward best paths of each routing node; the duration of the report countdown for the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node;

[0006] In the case where the first routing node to report is determined based on the report countdown, report the forward best path of the first routing node to report as a valid path to the next-hop routing node;

[0007] Take the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward best path of the current-hop routing node, cancel the report countdown for the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the valid path is reported to the central node;

[0008] Establish a reverse best path from the central node to each routing node according to the valid path reported to the central node.

[0009] In a second aspect, the present application provides a central node reverse path establishment device based on a wireless Mesh network. The device includes:

[0010] A countdown module, configured to perform a reporting countdown on the forward optimal path of each routing node; the duration of the reporting countdown of the forward optimal path of each routing node is negatively correlated with the length of the forward optimal path of each routing node;

[0011] A path reporting module, configured to, when determining the first routing node to report based on the reporting countdown, report the forward optimal path of the first routing node as a valid path to the next-hop routing node; use the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward optimal path of the current-hop routing node, cancel the reporting countdown for the forward optimal path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute using the next-hop routing node as the current-hop routing node until the valid path is reported to the central node;

[0012] A path establishment module, configured to establish a reverse optimal path from the central node to each routing node according to the valid path reported to the central node.

[0013] In a third aspect, the present application provides a central node reverse path establishment system based on a wireless Mesh network. The system includes: a central node and each routing node;

[0014] Each routing node is configured to perform a reporting countdown on the forward optimal path of each routing node; the duration of the reporting countdown of the forward optimal path of each routing node is negatively correlated with the length of the forward optimal path of each routing node; when determining the first routing node to report based on the reporting countdown, report the forward optimal path of the first routing node as a valid path to the next-hop routing node; use the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward optimal path of the current-hop routing node, cancel the reporting countdown for the forward optimal path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute using the next-hop routing node as the current-hop routing node until the valid path is reported to the central node;

[0015] The central node is configured to establish a reverse optimal path from the central node to each routing node according to the valid path reported to the central node.

[0016] In some embodiments, each routing node is configured to, if the valid path reported to the current-hop routing node does not duplicate with the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node in the valid paths of the current-hop routing node; when the reporting countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid paths of the current-hop routing node.

[0017] In some embodiments, each routing node is configured to obtain the path hop count of the forward best path corresponding to each routing node; for each routing node, determine the duration of the reporting countdown for the forward best path of the routing node according to the path hop count corresponding to the routing node; the duration of the countdown is negatively correlated with the path hop count.

[0018] In some embodiments, each routing node is configured to respectively record the end time points of the forwarding windows for forwarding the route discovery broadcast by each routing node; the route discovery broadcast is initiated by the central node and forwarded by each routing node to determine the forward best paths from each routing node to the central node; the forwarding window is used to control the forwarding time range for each routing node to forward the route discovery broadcast; starting from the end time points of the forwarding windows corresponding to each routing node, perform reporting countdowns for the forward best paths of each routing node according to the durations of the reporting countdowns corresponding to each routing node respectively.

[0019] In some embodiments, when there is a routing node in the valid path reported to the current-hop routing node that is not adjacent to the current-hop routing node, each routing node is configured to determine the routing node that is not adjacent to the current-hop routing node in the valid path as the target node; determine the unique routing path between the current-hop routing node and the target node from the valid path reported to the current-hop routing node; store the unique routing path in the unique routing table of the current-hop routing node.

[0020] In some embodiments, the central node is configured to synchronously store the determined reverse best paths from the central node to each routing node in the routing table of the central node, so that the central node communicates with each routing node through the reverse best paths stored in the routing table.

[0021] In a fourth aspect, the present application provides a computing device, including a memory and a processor, where the memory stores a computer program, and when the processor executes the computer program, the steps of the above-mentioned method for establishing the reverse path of the central node based on a wireless Mesh network are implemented.

[0022] Fifth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned method for establishing a reverse path of a central node based on a wireless Mesh network are implemented.

[0023] Sixth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned method for establishing a reverse path of a central node based on a wireless Mesh network are implemented.

[0024] For the above-mentioned method, device, system, computer device, storage medium, and computer program product for establishing a reverse path of a central node based on a wireless Mesh network, by introducing a countdown strategy, a countdown is reported for the forward best path of each routing node; among them, the duration of the countdown for reporting the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node, so as to ensure that the remote routing node with a long best path reports first, and the proximal routing node with a short path reports later. Then, in the case where the first reported routing node is determined based on the reported countdown, the forward best path of the first reported routing node is reported as an effective path to the next-hop routing node; the next-hop routing node is used as the current-hop routing node. If the effective path reported to the current-hop routing node duplicates the forward best path of the current-hop routing node, the countdown for reporting the forward best path of the current-hop routing node is cancelled, that is, the reporting operation of the forward best path stored by the current-hop routing node itself is cancelled, and only the effective path reported to the current-hop routing node is reported to the next-hop routing node to avoid duplicate reporting of paths, and continue to execute using the next-hop routing node as the current-hop routing node until the effective path is reported to the central node; according to the effective path reported to the central node, a reverse best path from the central node to each routing node is established. That is to say, the present application can ensure that the upper-hop routing node at the far end reports the forward best path first according to the countdown strategy. During the process of the upper-hop routing node at the far end reporting the forward best path, if it is found that the current-hop routing node at the near end duplicates the forward best path reported by the upper-hop routing node at the far end, the path reporting for the current-hop routing node at the near end is cancelled, which can avoid the problem of duplicate reporting of the forward best path, thereby reducing the overhead of the wireless network. Description of the Drawings

[0025] Figure 1 It is a schematic flowchart of a method for establishing a reverse path of a central node based on a wireless Mesh network provided by an embodiment of the present application;

[0026] Figure 2 It is a schematic diagram of a routing table provided by an embodiment of the present application;

[0027] Figure 3 A schematic diagram of the positional relationship between routing nodes provided by an embodiment of the present application;

[0028] Figure 4 A schematic diagram of the process of a routing node forwarding a routing discovery broadcast provided by an embodiment of the present application;

[0029] Figure 5 A schematic diagram of a unique routing table provided by an embodiment of the present application;

[0030] Figure 6 A schematic diagram of the structure of a central node reverse path establishment device based on a wireless Mesh network provided by an embodiment of the present application;

[0031] Figure 7 A schematic diagram of the structure of a central node reverse path establishment system based on a wireless Mesh network provided by an embodiment of the present application;

[0032] Figure 8 An internal structure diagram of a computer device provided by an embodiment of the present application. Detailed implementation manners

[0033] In order to make the objectives, technical solutions and advantages of the present application clearer and more understandable, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0034] In some embodiments, as Figure 1 shown, a method for establishing a central node reverse path based on a wireless Mesh network is provided. This method is described by taking the interaction between a central node and each routing node other than the central node as an example, and includes the following steps:

[0035] Step 102, report the countdown for the forward best path of each routing node.

[0036] It can be understood that in a certain wireless network, including multiple different routing nodes, when communication is required between each routing node but it is impossible to reach the destination node in a single hop, it is necessary to establish communication paths for each routing node to reach the destination node, such as the central node. The above path establishment process is called routing discovery.

[0037] Since the central node does not have any routing information about the communication paths from this node to other routing nodes, such as the communication paths from the central node to other routing nodes, the above routing discovery process can only achieve one-way communication from each routing node to the central node. Considering the above situation, on the basis of realizing the routing discovery of the central node, it is also necessary to establish communication paths from the central node to each routing node to achieve two-way communication between each routing node and the central node.

[0038] Among them, the destination node can be understood as the communication object that one or more routing nodes want to communicate with. The central node is the initiator of the wireless network and is generally integrated inside the gateway or the central control.

[0039] In some embodiments, the central node can be in the form of a home gateway, a central control, a smart device, such as a multi-functional audio system, etc., and other routing nodes other than the central node can be some different smart devices. Among them, the central node is the concentration point of the vast majority of information in the wireless network and is also the routing node with the largest data volume and the most frequent communication. For example, when the user controls other routing nodes through voice commands or software, commands need to be issued through the central node, and the information reports of other routing nodes also need to be reported to the central node for centralized processing in the vast majority of cases.

[0040] It can be understood that after the routing discovery of the central node is executed, each routing node other than the central node obtains at least one communication path from itself to the central node. Among them, for each routing node, if the communication path from this routing node to the central node is one, then this communication path is the best communication path determined by this routing node from this routing node to the central node, called the forward best path. For each routing node, if the communication path from this routing node to the central node is multiple, then in addition to the forward best path from this routing node to the central node, this communication path also includes at least one alternative path from this communication path to the central node. Correspondingly, after reporting the forward best path determined by each routing node to the central node, the central node can obtain the reverse best path from the central node to each routing node according to the forward best path.

[0041] In some embodiments, after each routing node determines its own forward best path to the central node, it can establish as Figure 2The shown routing table is stored synchronously. Among them, the routing table includes all paths from node 2, node 3, node 4, node 5, node 6, node 7, and node 8 to node 1 respectively. LQ represents the link quality of the corresponding path, and LIST represents the corresponding path. It should be noted that for the routing tables of the central nodes in each column from node 2 to node 8, they are the forward optimal paths stored in the memory of this routing node itself and can only be refreshed until the next time the central node initiates a routing discovery.

[0042] In some embodiments, according to Figure 2 the forward optimal paths in the routing table, that is, according to Figure 2 the first paths of each routing node in Figure 3 the network structure diagrams of other routing nodes to the central node as shown can be drawn. Among them, the solid lines are the forward optimal paths, and the dashed lines are alternative paths other than the forward optimal paths. The solid lines and each routing node form a tree structure, and node 1 is the root node in the tree structure.

[0043] In practical applications, considering the network overhead generated when establishing reverse paths, the embodiments of this application consider only allowing each routing node to report the forward optimal paths without reporting alternative paths to reduce the network overhead.

[0044] It should be noted that considering that the forward optimal paths stored by each routing node may be repeated, if each routing node reports the forward optimal paths to the central node simultaneously, the problem of repeated reporting may occur. Therefore, the embodiments of this application consider introducing a countdown strategy to control the reporting time of each routing node reporting the forward optimal paths, and identifying whether the forward optimal paths of each routing node are repeated during the path reporting process, so as to avoid the problem of repeated reporting of forward paths and achieve the effect of saving bandwidth.

[0045] Among them, the reporting countdown refers to the countdown for each routing node to report the forward optimal paths determined by itself to the central node respectively. The duration of the reporting countdown of the forward optimal paths of each routing node is generated according to the length of the forward optimal paths of each routing node. The length of the forward optimal path refers to the distance between each routing node and the central node.

[0046] In some embodiments, the length of the forward optimal path can be determined by the number of links on the forward optimal path connecting each routing node to the central node. In other embodiments, the length of the forward optimal path can also be determined by the number of routing nodes passed on the forward optimal path connecting each routing node to the central node.

[0047] In some embodiments, the duration of the reporting countdown for the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node. That is to say, the longer the forward best path of a routing node, the shorter the duration of the reporting countdown for its corresponding forward best path; the shorter the forward best path of a routing node, the longer the duration of the reporting countdown for its corresponding forward best path.

[0048] Specifically, before each routing node reports its determined forward best path to the central node, the reporting countdown for each routing node can be performed respectively according to the pre-determined duration of the reporting countdown for each routing node, or after determining the duration of the reporting countdown for each routing node according to the length of the forward best path of each routing node, the reporting countdown for each routing node can be performed respectively according to the duration of the reporting countdown.

[0049] Step 104, in the case of determining the first reporting routing node based on the reporting countdown, report the forward best path of the first reporting routing node as the valid path to the next-hop routing node.

[0050] Among them, the next-hop routing node refers to the routing node that is adjacent to the currently reporting routing node and has not yet performed the forward best path reporting operation in the forward best path. Similarly, the previous-hop routing node refers to the routing node that is adjacent to the currently reporting routing node and has sent the forward best path to the currently reporting routing node.

[0051] Specifically, after each routing node determines its corresponding reporting countdown, the first routing node to complete the countdown can be determined, and this routing node is the first routing node to report the forward best path in the whole network. It can be understood that since the duration of the reporting countdown for the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node, the first reporting routing node determined is the routing node farthest from the central node. After determining the first reporting routing node, report the forward best path of the first reporting routing node as the valid path to the next-hop routing node. It should be noted that the routing node farthest from the central node refers to the routing node with the largest number of links on the forward best path to the central node or the routing node with the largest number of routing nodes passed on the forward best path to the central node.

[0052] Among them, a valid path refers to a path that can be normally reported to the central node, and an invalid path refers to a path that cannot be reported to the central node. It can be understood that if a routing node, such as node A, during the process of reporting the forward optimal path, if a certain node on the forward optimal path, such as node B, discovers that the forward optimal path reported by node A duplicates the forward optimal path stored by itself, then the forward optimal path stored by node B itself can be marked as an invalid path, and the operation of path reporting is not performed.

[0053] Step 106: Take the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward optimal path of the current-hop routing node, cancel the reporting countdown for the forward optimal path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the valid path is reported to the central node.

[0054] Specifically, after the first reporting routing node sends the forward optimal path to the next-hop routing node, take the next-hop routing node as the current-hop routing node. The current-hop routing node needs to determine whether the valid path reported by the previous-hop routing node to itself duplicates the forward optimal path stored by the current-hop routing node itself, that is, the current-hop routing node can judge whether the valid path of the previous-hop routing node contains the forward optimal path stored by the current-hop routing node itself. If the valid path of the previous-hop routing node duplicates the forward optimal path of the current-hop routing node, or in other words, the valid path of the previous-hop routing node contains the forward optimal path of the current-hop routing node, then cancel the reporting countdown for the forward optimal path of the current-hop routing node, so that the current-hop routing node does not report its own forward optimal path to the central node, avoiding duplicate reporting of the forward optimal path. In addition, the current-hop routing node also continues to report the valid path reported to the current-hop routing node to the next-hop routing node, and continues to execute taking the next-hop routing node as the current-hop routing node until the valid path is reported to the central node.

[0055] For the sake of easy understanding, an example is given below. Assume that the reporting countdown of node 7 has not ended, and node 7 receives the forward optimal path reported by node 8 as: node 1 -> node 5 -> node 7 -> node 8, but referring to Figure 2 and Figure 3 it can be known that the forward optimal path of node 7 itself is: node 1 -> node 5 -> node 7. Since node 1 -> node 5 -> node 7 -> node 8 contains node 1 -> node 5 -> node 7, it means that the forward optimal path of node 8 and the forward optimal path of node 7 are duplicate, so cancel the reporting countdown of node 7, so that node 7 does not need to report its own forward optimal path, saving wireless resources.

[0056] Step 108: Establish a reverse optimal path from the central node to each routing node according to the valid paths reported to the central node.

[0057] Specifically, after the central node obtains all the valid paths reported to this node, the reverse routing establishment process from each of the other routing nodes to the central node is completed. According to the received valid paths, the central node can know the optimal communication paths from itself to each of the other routing nodes, that is, the reverse optimal paths from the central node to each routing node, so as to achieve two-way communication between each routing node and the central node.

[0058] In the above method for establishing the reverse path of the central node based on the wireless Mesh network, by introducing a countdown strategy, a countdown is performed for reporting the forward optimal paths of each routing node; among them, the duration of the countdown for reporting the forward optimal paths of each routing node is negatively correlated with the length of the forward optimal paths of each routing node, so that it can be ensured that the remote routing nodes with long optimal paths report first, and the proximal routing nodes with short paths report later. Then, in the case where the first reported routing node is determined based on the reported countdown, the forward optimal path of the first reported routing node is reported as a valid path to the next-hop routing node; the next-hop routing node is used as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward optimal path of the current-hop routing node, the countdown for reporting the forward optimal path of the current-hop routing node is cancelled, that is, the reporting operation of the forward optimal path stored by the current-hop routing node itself is cancelled, and only the valid path reported to the current-hop routing node is reported to the next-hop routing node to avoid duplicate reporting of paths, and continue to execute using the next-hop routing node as the current-hop routing node until the valid path is reported to the central node; establish a reverse optimal path from the central node to each routing node according to the valid paths reported to the central node. That is to say, this application can ensure that the upper-hop routing node at the remote end reports the forward optimal path first according to the countdown strategy. During the process of the upper-hop routing node at the remote end reporting the forward optimal path, if it is found that the current-hop routing node at the proximal end duplicates the forward optimal path reported by the upper-hop routing node at the remote end, the path reporting for the current-hop routing node at the proximal end is cancelled, so that the problem of duplicate reporting of the forward optimal path can be avoided, thereby reducing the overhead of the wireless network.

[0059] In some embodiments, the method for establishing a reverse path of a central node based on a wireless Mesh network of the present application specifically further includes, but is not limited to, the steps of: if the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, then report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node; when the reporting countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid path of the current-hop routing node.

[0060] Specifically, when the current-hop routing node determines that the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, that is, when the current-hop routing node determines that the valid path of the previous-hop routing node does not contain the forward best path stored by the current-hop routing node itself, then continue to report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the step of reporting the valid path to the central node. In addition, when the reporting countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid path of the current-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the step of reporting the valid path to the central node.

[0061] Before reporting the forward best path stored by itself, and when it is determined that the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, the present application reports the non-duplicated forward best routing path with other routing nodes only after the countdown ends, which can avoid the problem of duplicate reporting of the forward best path, thereby reducing the overhead of the wireless network.

[0062] In some embodiments, before step 102, the method for establishing a reverse path of a central node based on a wireless Mesh network of the present application specifically further includes, but is not limited to, the steps of: obtaining the path hops of the forward best path corresponding to each routing node; for each routing node, determining the duration of the reporting countdown for the forward best path of the routing node according to the path hops corresponding to the routing node.

[0063] Among them, the path hops of the forward best path refer to the number of routing nodes passed by the forward best path, and the duration of the countdown is negatively correlated with the path hops. That is to say, the more the path hops of the forward best path, the shorter the duration of the reporting countdown corresponding to the forward best path; the fewer the path hops of the forward best path, the longer the duration of the reporting countdown corresponding to the forward best path.

[0064] It can be understood that after determining the duration of the reporting countdown for the forward optimal path of a routing node, it is also necessary to perform a reporting countdown for the forward optimal path of each routing node. Among them, the countdown start point of a certain routing node is the end point of the forwarding window for the routing node to forward the routing discovery broadcast, that is, the end time point.

[0065] Specifically, each routing node directly calculates the duration of the reporting countdown for the forward optimal path of the routing node according to the number of hops of its corresponding forward optimal path. Alternatively, each routing node calculates the duration of the reporting countdown for the forward optimal path of the routing node according to the number of hops of its corresponding forward optimal path and in combination with the number of hops of the longest path in the wireless network. By introducing a countdown strategy in the embodiments of the present application, the routing nodes far from the central node report first, which can avoid the problem of repeated reporting of the forward optimal path and achieve the effect of solving the bandwidth.

[0066] In some embodiments, the difference in the number of hops can be obtained by subtracting the number of hops of the forward optimal path of a certain routing node from the number of hops of the longest path in the wireless network, and the difference in the number of hops is multiplied by a natural number to obtain the duration of the reporting countdown for the forward optimal path of the routing node.

[0067] In other embodiments, the difference in the number of hops can also be obtained by subtracting the number of hops of the forward optimal path of a certain routing node from the number of hops of the longest path in the wireless network, and then the difference in the number of hops is multiplied by the length of the forwarding window and a preset amplification factor to obtain the duration of the reporting countdown for the forward optimal path of the routing node. Among them, the forwarding window is used to control the forwarding time range for the routing node to forward the routing discovery broadcast, and this forwarding time range is the length of the forwarding window.

[0068] In some embodiments, the duration of the reporting countdown for the forward optimal path of a certain routing node can be calculated by formula (1):

[0069] H = K * T(M - N) (1)

[0070] Wherein, H refers to the duration of the reporting countdown for the forward optimal path of a certain routing node, K refers to the amplification factor, generally set between 1.1 and 2, T refers to the length of the forwarding window for the routing node to forward the routing discovery broadcast, M refers to the number of hops of the longest path in the wireless network, and N refers to the number of hops of the forward optimal path of the routing node.

[0071] For ease of understanding, an example is given below. Assume that the number of hops of the longest path in the wireless network is 10 hops, then M = 10 can be determined, and as Figure 3The forward best path of node 3 shown is: node 3 -> node 2 -> node 1, the number of hops N of the path is 2, and the pre-determined K*T = 2, so the duration H of the reporting countdown of node 3 is H = 2*(10 - 2) = 16 seconds.

[0072] In some embodiments, step 102 specifically includes but is not limited to the steps of: respectively recording the end time points of the forwarding windows for each routing node to forward the routing discovery broadcast; starting from the end time points of the forwarding windows corresponding to each routing node, performing a reporting countdown on the forward best path of each routing node according to the duration of the reporting countdown corresponding to each routing node.

[0073] Among them, the routing discovery broadcast is initiated by the central node and forwarded by each routing node to determine the forward best path of each routing node to the central node.

[0074] It should be noted that during the routing discovery process of the central node, as the routing node initiating the routing discovery broadcast, the central node first sends the routing discovery broadcast to each neighboring node. At this time, the central node can be regarded as the current-hop routing node, and each neighboring node of the central node can be regarded as the next-hop routing node. After a certain neighboring node of the central node receives the routing discovery broadcast sent by the central node, this neighboring node can be regarded as the current-hop routing node, the central node that forwarded the routing discovery broadcast to this neighboring node can be regarded as the previous-hop routing node. After the neighboring node as the current-hop routing node receives the routing discovery broadcast, it can determine the forward best path of this node to the central node from each routing discovery broadcast, add the determined forward best path to the routing discovery broadcast and forward it to its neighboring node, that is, the next-hop routing node. The next-hop routing node continues to execute the process of determining the forward best path and forwarding the routing discovery broadcast, so as to obtain the forward best path of all routing nodes to the central node respectively.

[0075] Specifically, during the routing discovery process of the central node, each routing node respectively records the time point when it forwards the routing discovery broadcast as the end time point of the forwarding window. Starting from the end time points of the forwarding windows corresponding to each routing node, performing a reporting countdown on the forward best path of each routing node according to the duration of the reporting countdown corresponding to each routing node, so that the routing nodes far from the central node, that is, the routing nodes with more hops, report first, which can avoid the problem of repeated reporting of the forward best path and achieve the effect of solving the bandwidth.

[0076] Among them, the forwarding window is used to control the forwarding time range for this routing node to forward the routing discovery broadcast, and this forwarding time range is the length of the forwarding window.

[0077] For ease of understanding, an example is given below. Suppose that during the route discovery process of the central node, node 3 performs an operation of forwarding a route discovery broadcast to the next-hop route node. Then, a countdown starts from the end time point of the forwarding window for forwarding this route discovery broadcast by node 3. After the duration of the reporting countdown determined by node 3, for example, 16 seconds, the countdown operation ends, and node 3 reports its corresponding forward best path.

[0078] In some embodiments, during the route discovery process of the destination node, such as the central node, the routing nodes in the wireless network can be hierarchically divided to determine which level of routing node the corresponding routing node is. According to the specific level of each routing node, the time range of the forwarding window for forwarding the route discovery broadcast can be determined, and each routing node can only forward the received route discovery broadcast within the time range of its forwarding window.

[0079] It should be noted that if a routing node forwards a route discovery broadcast within the time range of its corresponding forwarding window, the end time point of this window can be used as the countdown start point for this routing node. That is, starting from the countdown start point, a reporting countdown is performed on this routing node, and after the duration of the reporting countdown ends, the forward best path determined by this routing node is reported.

[0080] Exemplarily, as Figure 4 shown, suppose that nodes 2, 4, and 5 are routing nodes at the same level, and the forwarding windows of nodes 2, 4, and 5 are set to be the same. Nodes 3, 6, and 7 are routing nodes at another level, and the forwarding windows of nodes 2, 4, and 5 are set to be another. It can be understood that after node 1 sends a route discovery broadcast, after nodes 2, 4, and 5 respectively forward the route discovery broadcast within their corresponding time windows, they need to wait and start a reporting countdown respectively at the end time point of the time window. Similarly, after nodes 3, 6, and 7 respectively forward the route discovery broadcast within their corresponding time windows, they also need to wait and start a reporting countdown respectively at the end time point of the time window.

[0081] In some embodiments, the method for establishing a reverse path of the central node based on a wireless Mesh network in this application specifically further includes but is not limited to the steps of: when there is a routing node in the valid path reported to the current-hop routing node that is not adjacent to the current-hop routing node, determining the routing node that is not adjacent to the current-hop routing node in the valid path as the target node; determining the only routing path between the current-hop routing node and the target node from the valid path reported to the current-hop routing node; and storing the only routing path in the unique routing table of the current-hop routing node.

[0082] Among them, the unique routing path refers to the only communication path between the current-hop routing node and the destination node.

[0083] Exemplarily, as Figure 3 shown, are the valid paths from each routing node to the central node. Among them, two routing nodes connected by a dashed line or a straight line represent that they can communicate directly with each other. For example, there is a straight line connecting node 1 and node 4, which means that node 1 and node 4 can communicate directly with each other. In other cases, routing nodes that are not directly connected by a dashed line or a straight line represent that they cannot communicate directly. If these two routing nodes need to communicate, they can only be relayed through other routing nodes. For example, if node 4 and node 6 are not directly connected by a dashed line or a straight line, it means that node 4 and node 6 cannot communicate directly with each other. If node 4 needs to communicate with node 6, it needs to be relayed through other routing nodes, such as through node 5.

[0084] Specifically, in the case where there are routing nodes in the valid path reported to the current-hop routing node that are not adjacent to the current-hop routing node, the routing nodes in the valid path that are not adjacent to the current-hop routing node are determined as the destination nodes. That is to say, the current-hop routing node cannot communicate with the destination node. In order to establish an accessible path from the current-hop routing node to the destination node, the current-hop routing node can determine the unique routing path between the current-hop routing node and the destination node from the valid path reported to the current-hop routing node. When the unique routing path determined by the current-hop routing node does not repeat the unique path stored in the unique path table of the current-hop routing node, the unique routing path determined by the current-hop routing node is stored in the unique routing table of the current-hop routing node. And when the unique routing path determined by the current-hop routing node repeats the unique path stored in the unique path table of the current-hop routing node, it is not necessary to store the unique routing path determined by the current-hop routing node in the unique routing table, so as to prevent the unique paths stored in the unique routing table from repeating and reduce resource occupancy. This can ensure that when the current-hop routing node needs to communicate with the destination node, it does not need to initiate a routing discovery again and can directly communicate according to the unique routing path in the unique routing table, effectively improving the communication efficiency of the routing node.

[0085] For the sake of easy understanding, an example is given below in combination with Figure 2 、 Figure 3From the strategies of each routing node for reporting countdown, it can be known that node 8 is the routing node that reports the path earliest in the entire wireless network, and the forward best path reported by node 8 is: node 1 -> node 5 -> node 7 -> node 8. When node 5 receives this path sent by node 7 and finds that there is a routing node in this path that is not its neighbor node, that is, node 8, then node 5 can use node 8 as the target node and determine the reachable path from node 5 to node 8 according to node 1 -> node 5 -> node 7 -> node 8, that is: node 5 -> node 7 -> node 8. At this time, node 5 can store the determined reachable path from node 5 to node 8 into the unique routing table as shown in Figure 5 Node 5 can directly communicate with node 8 according to the reachable path from node 5 to node 8 in the unique routing table without having to initiate a new route discovery, effectively improving the communication efficiency of the routing node.

[0086] In some embodiments, after step 108, the method for establishing the reverse path of the central node based on the wireless Mesh network of the present application specifically further includes but is not limited to the steps of: synchronously storing the determined reverse best paths from the central node to each routing node into the routing table of the central node, so that the central node can communicate with each routing node through each reverse best path stored in the routing table.

[0087] Specifically, the central node synchronously stores the determined reverse best paths from the central node to each routing node into its own routing table. When the central node needs to communicate with each routing node, it can directly communicate with each routing node through each reverse best path stored in the routing table without having to initiate a new route discovery, effectively improving the communication efficiency.

[0088] In some embodiments, the method for establishing the reverse path of the central node of the application specifically further includes but is not limited to the following steps:

[0089] Obtain the path hops of the forward best paths respectively corresponding to each routing node, and for each routing node, determine the duration of the reporting countdown for the forward best path of the routing node according to the path hops corresponding to the routing node.

[0090] Record the end time points of the forwarding windows for each routing node to forward the route discovery broadcast respectively. Starting from the end time points of the forwarding windows respectively corresponding to each routing node, perform reporting countdown on the forward best paths of each routing node according to the duration of the reporting countdown respectively corresponding to each routing node.

[0091] In the case of determining the first reporting routing node based on the reporting countdown, report the forward best path of the first reporting routing node as the valid path to the next-hop routing node.

[0092] Take the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node does not overlap with the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node. When the reporting countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the forward best path of the current-hop routing node. If the valid path reported to the current-hop routing node overlaps with the forward best path of the current-hop routing node, perform the next step.

[0093] Cancel the reporting countdown for the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to take the next-hop routing node as the current-hop routing node until the valid path is reported to the central node.

[0094] In the case where there is a routing node in the valid path reported to the current-hop routing node that is not adjacent to the current-hop routing node, determine the routing node that is not adjacent to the current-hop routing node in the valid path as the target node; determine the unique routing path between the current-hop routing node and the target node from the valid path reported to the current-hop routing node; store the unique routing path in the unique routing table of the current-hop routing node.

[0095] Establish a reverse best path from the central node to each routing node according to the valid path reported to the central node.

[0096] Synchronously store the determined reverse best path from the central node to each routing node in the routing table of the central node, so that the central node can communicate with each routing node through each reverse best path stored in the routing table.

[0097] It should be understood that although the steps in the flowcharts involved in the above-described embodiments are sequentially shown according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless there is a clear indication in this article, the execution of these steps has no strict order limit, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-described embodiments may include multiple steps or multiple stages. These steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be executed alternately or in turn with at least a part of other steps or steps or stages in other steps.

[0098] Based on the same inventive concept, the embodiments of the present application further provide a system for establishing a reverse path of a central node based on a wireless Mesh network for implementing the method for establishing a reverse path of a central node based on a wireless Mesh network involved above. The implementation solution provided by this system to solve the problem is similar to the implementation solution described in the above method. Therefore, the specific limitations in one or more embodiments of the system for establishing a reverse path of a central node based on a wireless Mesh network provided below can refer to the limitations on the method for establishing a reverse path of a central node based on a wireless Mesh network in the above text, and will not be repeated here.

[0099] Reference Figure 6 , is a schematic structural diagram of a device for establishing a reverse path of a central node based on a wireless Mesh network provided by an embodiment of the present application. In some embodiments, as Figure 6 shown, a device for establishing a reverse path of a central node based on a wireless Mesh network is provided, including a countdown module 602, a path reporting module 604, and a path establishment module 606, where:

[0100] The countdown module 602 is used to report the countdown for the forward best path of each routing node; the duration of the countdown for reporting the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node;

[0101] The path reporting module 604 is used to, when determining the first routing node to report based on the reporting countdown, report the forward best path of the first routing node as a valid path to the next-hop routing node; take the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward best path of the current-hop routing node, cancel the reporting countdown for the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the valid path is reported to the central node;

[0102] The path establishment module 606 is used to establish a reverse best path from the central node to each routing node according to the valid path reported to the central node.

[0103] In some embodiments, the path reporting module 604 is further used to, if the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node; when the reporting countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid path of the current-hop routing node.

[0104] In some embodiments, the countdown module 602 is further configured to obtain the number of hops of the forward optimal path corresponding to each routing node; for each routing node, determine the duration of the reporting countdown for the forward optimal path of the routing node according to the number of hops corresponding to the routing node; the duration of the countdown is negatively correlated with the number of hops.

[0105] In some embodiments, the countdown module 602 is further configured to record the end time points of the forwarding windows for each routing node to forward the route discovery broadcast respectively; the route discovery broadcast is initiated by the central node and forwarded by each routing node to determine the forward optimal paths from each routing node to the central node respectively; starting from the end time points of the forwarding windows corresponding to each routing node, the reporting countdown for the forward optimal path of each routing node is performed according to the duration of the reporting countdown corresponding to each routing node respectively.

[0106] In some embodiments, the central node reverse path establishment device based on the wireless Mesh network further includes a path storage module, and the path storage module is configured to, when there are routing nodes that are not adjacent to the current-hop routing node in the valid path reported to the current-hop routing node, determine the routing nodes that are not adjacent to the current-hop routing node in the valid path as target nodes; determine the unique routing path between the current-hop routing node and the target node from the valid path reported to the current-hop routing node; store the unique routing path in the unique routing table of the current-hop routing node.

[0107] In some embodiments, the path storage module is further configured to synchronously store the determined reverse optimal paths from the central node to each routing node in the routing table of the central node, so that the central node communicates with each routing node through the reverse optimal paths stored in the routing table.

[0108] Reference Figure 7 , is a schematic structural diagram of a central node reverse path establishment system based on a wireless Mesh network provided by an embodiment of the present application. In some embodiments, as Figure 7 shown, a central node reverse path establishment system based on a wireless Mesh network is provided, including a central node 702 and each routing node 704, where:

[0109] Each routing node 704 is used to report a countdown for the forward best path of each routing node 704; the duration of the reported countdown for the forward best path of each routing node 704 is negatively correlated with the length of the forward best path of each routing node 704; in the case where the first reported routing node is determined based on the reported countdown, the forward best path of the first reported routing node is reported as a valid path to the next-hop routing node; the next-hop routing node is used as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward best path of the current-hop routing node, the reported countdown for the forward best path of the current-hop routing node is cancelled, the valid path reported to the current-hop routing node is reported to the next-hop routing node, and the process of using the next-hop routing node as the current-hop routing node is continued until the valid path is reported to the central node 702;

[0110] The central node 702 is used to establish a reverse best path from the central node 702 to each routing node 704 according to the valid paths reported to the central node 702.

[0111] In some embodiments, each routing node 704 is used to, if the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node; in the case where the reported countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid path of the current-hop routing node.

[0112] In some embodiments, each routing node 704 is used to obtain the path hop count of the forward best path corresponding to each routing node 704 respectively; for each routing node, determine the duration of the reported countdown for the forward best path of the routing node according to the path hop count corresponding to the routing node; the duration of the countdown is negatively correlated with the path hop count.

[0113] In some embodiments, each routing node 704 is used to record the end time point of the forwarding window for forwarding the route discovery broadcast by each routing node 704 respectively; the route discovery broadcast is initiated by the central node 702 and forwarded by each routing node 704 to determine the forward best path from each routing node 704 to the central node 702 respectively; starting from the end time point of the forwarding window corresponding to each routing node 704, a reported countdown is performed on the forward best path of each routing node 704 according to the duration of the reported countdown corresponding to each routing node 704 respectively.

[0114] In some embodiments, each routing node 704 is configured to, when there is a routing node in the valid path reported to the current-hop routing node that is not adjacent to the current-hop routing node, determine the routing node that is not adjacent to the current-hop routing node in the valid path as the target node; determine the unique routing path between the current-hop routing node and the target node from the valid path reported to the current-hop routing node; and store the unique routing path in the unique routing table of the current-hop routing node.

[0115] In some embodiments, the central node 702 is configured to synchronously store the determined reverse best paths from the central node 702 to each routing node 704 in the routing table of the central node 702, so that the central node 702 communicates with each routing node 704 through the reverse best paths stored in the routing table.

[0116] In some embodiments, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as Figure 8 shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit, and an input device. Among them, the processor, the memory, and the input / output interface are connected through a system bus, and the communication interface, the display unit, and the input device are connected to the system bus through the input / output interface. Among them, the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used for exchanging information between the processor and external devices. The communication interface of the computer device is used for communicating with external terminals in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, NFC (Near Field Communication), or other technologies. When the computer program is executed by the processor, it implements a method for establishing a reverse path of a central node based on a wireless Mesh network. The display unit of the computer device is configured to form a visually visible picture, which may be a display screen, a projection device, or a virtual reality imaging device. The display screen may be a liquid crystal display screen or an electronic ink display screen. The input device of the computer device may be a touch layer covering the display screen, or a button, a trackball, or a touchpad provided on the outer shell of the computer device, or an external keyboard, a touchpad, or a mouse, etc.

[0117] Those skilled in the art can understand that Figure 8 the structure shown in merely shows the block diagram of some parts of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer parts than those shown in the figure, or combine some parts, or have different component arrangements.

[0118] In some embodiments, a computer device is further provided. The computer device includes a memory and a processor. A computer program is stored in the memory. When the processor executes the computer program, the steps in the above method embodiments are implemented.

[0119] In some embodiments, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above method embodiments are implemented.

[0120] In some embodiments, a computer program product is provided. The computer program product includes a computer program. When the computer program is executed by a processor, the steps in the above method embodiments are implemented.

[0121] Those of ordinary skill in the art can understand that all or part of the processes of implementing the above method embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the above method embodiments. Among them, any reference to a memory, a database, or other media provided in the various embodiments of the present application can include at least one of non-volatile and volatile memories. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc. The databases involved in the various embodiments of the present application can include at least one of relational databases and non-relational databases. Non-relational databases can include distributed databases based on blockchain, etc., without limitation. The processors involved in the various embodiments of the present application can be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, data processing logics based on quantum computing, etc., without limitation.

[0122] The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as falling within the scope described in this specification.

[0123] The above-described embodiments merely represent several implementation manners of the present application. The description is relatively specific and detailed, but it should not be construed as a limitation on the patent scope of the present application. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the appended claims.

Claims

1. A method for establishing a reverse path of a central node based on a wireless Mesh network, characterized in that, the method includes: Report countdown for the forward best path of each routing node; the duration of the report countdown for the forward best path of each routing node is negatively correlated with the length of the forward best path of each routing node; In the case of determining the first reported routing node based on the report countdown, report the forward best path of the first reported routing node as a valid path to the next-hop routing node; Take the next-hop routing node as the current-hop routing node. If the valid path reported to the current-hop routing node duplicates the forward best path of the current-hop routing node, cancel the report countdown for the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node, and continue to execute taking the next-hop routing node as the current-hop routing node until the valid path is reported to the central node; Establish a reverse best path from the central node to each routing node according to the valid path reported to the central node.

2. The method according to claim 1, characterized in that, the method further includes: If the valid path reported to the current-hop routing node does not duplicate the forward best path of the current-hop routing node, report the valid path reported to the current-hop routing node to the next-hop routing node in the valid path of the current-hop routing node; In the case where the report countdown for the forward best path of the current-hop routing node ends, trigger reporting the forward best path of the current-hop routing node as a valid path to the next-hop routing node in the valid path of the current-hop routing node.

3. The method according to claim 1, characterized in that, Before the report countdown for the forward best path of each routing node, the method further includes: Obtain the path hop count of the forward best path corresponding to each routing node; For each routing node, determine the duration of the report countdown for the forward best path of the routing node according to the path hop count corresponding to the routing node; the duration of the countdown is negatively correlated with the path hop count.

4. The method according to claim 3, characterized in that, The report countdown for the forward best path of each routing node includes: Record the end time points of the forwarding windows for the respective routing nodes to forward the route discovery broadcast; the route discovery broadcast is initiated by the central node and forwarded by the respective routing nodes to determine the forward best paths from the respective routing nodes to the central node; the forwarding window is used to control the forwarding time range for the respective routing nodes to forward the route discovery broadcast; Starting from the end time points of the respective forwarding windows corresponding to the respective routing nodes, perform report countdown for the forward best paths of the respective routing nodes according to the respective durations of the report countdown corresponding to the respective routing nodes.

5. The method according to claim 1, characterized in that, the method further includes: In the case that there is a routing node in the valid path reported to the current hop routing node that is not adjacent to the current hop routing node, determine the routing node that is not adjacent to the current hop routing node in the valid path as the target node; Determine the unique routing path between the current hop routing node and the target node from the valid paths reported to the current hop routing node; Store the unique routing path in the unique routing table of the current hop routing node.

6. The method according to any one of claims 1 to 5, wherein, after establishing the reverse optimal paths from the central node to the respective routing nodes according to the valid paths reported to the central node, the method further includes: Synchronously storing the determined reverse optimal paths from the central node to the respective routing nodes in the routing table of the central node, so that the central node communicates with the respective routing nodes through the respective reverse optimal paths stored in the routing table.

7. A central node reverse path establishment device based on a wireless Mesh network, wherein, the device includes: A countdown module, configured to perform a countdown for reporting the forward optimal paths of each routing node; the duration of the countdown for reporting the forward optimal paths of each routing node is negatively correlated with the length of the forward optimal paths of each routing node; A path reporting module, configured to, in the case of determining the first reporting routing node based on the reporting countdown, report the forward optimal path of the first reporting routing node as a valid path to the next hop routing node; use the next hop routing node as the current hop routing node. If the valid path reported to the current hop routing node duplicates the forward optimal path of the current hop routing node, cancel the countdown for reporting the forward optimal path of the current hop routing node, report the valid path reported to the current hop routing node to the next hop routing node, and continue to perform the step of using the next hop routing node as the current hop routing node until the valid path is reported to the central node; A path establishment module, configured to establish the reverse optimal paths from the central node to the respective routing nodes according to the valid paths reported to the central node.

8. A central node reverse path establishment system based on a wireless Mesh network, wherein, the system includes: a central node and each routing node; Each of the routing nodes is used to report a countdown for the forward optimal path of each of the routing nodes; the duration of the countdown for reporting the forward optimal path of each routing node is negatively correlated with the length of the forward optimal path of each routing node; in the case where the first reported routing node is determined based on the reported countdown, the forward optimal path of the first reported routing node is reported as an effective path to the next-hop routing node; the next-hop routing node is used as the current-hop routing node. If the effective path reported to the current-hop routing node duplicates the forward optimal path of the current-hop routing node, the countdown for reporting the forward optimal path of the current-hop routing node is cancelled, the effective path reported to the current-hop routing node is reported to the next-hop routing node, and the process of using the next-hop routing node as the current-hop routing node is continued until the effective path is reported to the central node; The central node is used to establish a reverse optimal path from the central node to each of the routing nodes according to the effective paths reported to the central node.

9. A computer device, comprising a memory and a processor, where the memory stores a computer program, characterized in that, when the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer-readable storage medium, on which a computer program is stored, characterized in that, when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images