A method for island recovery in a wired and wireless hybrid network

Abstract

The present invention discloses a method for island recovery in a wired-wireless hybrid network, comprising: S1: obtaining a baseline topology network with a fixed number of nodes and a topology graph; S2: if there is line damage, using the damaged line to divide the island to obtain the topology graph of the current baseline topology network; S3: controlling the target island to determine the first specific node in the topology graph of the current baseline topology network according to the topology graph of the historical baseline topology network; S4: controlling the external island to determine the second specific node in the topology graph of the current baseline topology network according to the topology graph of the historical baseline topology network; S5: determining the shortest path between the first specific node and the second specific node; S6: when there is a boundary in the shortest path, raising the wireless network and repairing other lines between the first specific node and the second specific node; S7: if there is a connected line between the first specific node and the second specific node, lowering the wireless network to complete island recovery.

Description

Technical Field

[0001] The present invention relates to the technical field of network restoration, and in particular to an island restoration method in a wired-wireless hybrid network. Background Art

[0002] When an island appears in the network, the nodes in the island lose connection with the external nodes. In order to quickly connect the nodes in the island, the existing island detection and recovery generally requires manual operation, which is time-consuming, labor-intensive and inefficient. The detection time is long and affects the network status. Summary of the Invention

[0003] The object of the present invention is to provide an island recovery method in a wired-wireless hybrid network, so as to realize automatic detection and recovery of islands.

[0004] The technical solution of the present invention to solve the above technical problems is as follows:

[0005] The present invention provides a method for recovering an isolated island in a wired-wireless hybrid network, the method comprising:

[0006] S1: Obtain a baseline topology network with a fixed number of nodes and topology graph;

[0007] S2: If there is a line damage in the reference topology network, divide the damaged line into islands to obtain a topology map of the current reference topology network, where the islands include at least target islands and external islands;

[0008] S3: controlling the target island to determine a first specific node in a topology graph of a current reference topology network according to a topology graph of a historical reference topology network, wherein the first specific node is located on the external island;

[0009] S4: controlling the external island to determine a second specific node in the topology graph of the current reference topology network according to the topology graph of the historical reference topology network, wherein the second specific node is located on the target island;

[0010] S5: Determine the shortest path between the first specific node and the second specific node;

[0011] S6: When there is a boundary in the shortest path, raising the wireless network and repairing other lines between the first specific node and the second specific node;

[0012] S7: If there is a connection line between the first specific node and the second specific node, the wireless network is downgraded to complete island recovery.

[0013] Optionally, the island recovery method in the wired-wireless hybrid network further includes:

[0014] The Prim algorithm is used to divide and update islands every 30 seconds.

[0015] Optionally, the dividing and updating of islands every 30 seconds using the improved Prim algorithm includes:

[0016] A1: Control each node in the baseline topology network to send a heartbeat packet to the central node every 30 seconds;

[0017] A2: If the current node does not receive a reply from the central node within the preset time threshold, it controls all edges of the current node to search for the shortest path and determines the island based on the shortest path search results;

[0018] A3: After the shortest path search is completed for each edge in the island, a new central node will be recommended within the island and the process will return to step A1.

[0019] Optionally, the step A2 includes:

[0020] Control the current node to find all the edges it can access;

[0021] Compare the current edge with the historical edge to determine the minimum edge in the current comparison state;

[0022] Repeat the comparison until the current edge is the last edge, and obtain multiple minimum edges;

[0023] Take all the minimum edges as the minimum spanning tree;

[0024] The range formed by the minimum spanning tree is used as the island range to determine the island.

[0025] The present invention has the following beneficial effects:

[0026] The present invention can automatically detect and restore islands. In addition, it not only solves the problem of emergency connectivity recovery method between islands after the formation of islands in the topology, but also solves the problem of how to lower the wireless nodes that have been raised to maintain the highest concealment after the wired connectivity between some nodes is restored. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 Flowchart of the island recovery method in a wired / wireless hybrid network of the present invention;

[0028] Figure 2 This is a schematic diagram of the baseline topology network structure after the island update;

[0029] Figure 3 This is a schematic diagram of the structure of the benchmark topology network after island division;

[0030] Figure 4It is a schematic diagram of the structure of the baseline topology network after the wireless network is established;

[0031] Figure 5 This is a schematic diagram of the structure of a benchmark topology network with a maximum of 12 nodes;

[0032] Figure 6 Schematic diagram of the baseline topology network after filtering nodes for an island with a maximum of 12 nodes;

[0033] Figure 7 A schematic diagram of the structure of a baseline topology network after the wireless network is established with a maximum of 12 nodes;

[0034] Figure 8 The diagram shows the structure of the baseline topology network after wired connection restoration with a maximum of 12 nodes. DETAILED DESCRIPTION

[0035] The principles and features of the present invention are described below with reference to the accompanying drawings. The examples given are only used to explain the present invention and are not used to limit the scope of the present invention.

[0036] The technical solution of the present invention to solve the above technical problems is as follows:

[0037] The present invention provides a method for recovering isolated islands in a wired / wireless hybrid network. Figure 1 As shown, the island recovery method in the wired-wireless hybrid network includes:

[0038] S1: Obtain a baseline topology network with a fixed number of nodes and topology graph;

[0039] The reference topology network of the present invention is a static and constant reference topology network.

[0040] S2: If there is a line damage in the reference topology network, divide the damaged line into islands to obtain a topology map of the current reference topology network, where the islands include at least target islands and external islands;

[0041] S3: controlling the target island to determine a first specific node in a topology graph of a current reference topology network according to a topology graph of a historical reference topology network, wherein the first specific node is located on the external island;

[0042] S4: controlling the external island to determine a second specific node in the topology graph of the current reference topology network according to the topology graph of the historical reference topology network, wherein the second specific node is located on the target island;

[0043] S5: Determine the shortest path between the first specific node and the second specific node;

[0044] S6: When there is a boundary in the shortest path, raising the wireless network and repairing other lines between the first specific node and the second specific node;

[0045] S7: If there is a connection line between the first specific node and the second specific node, the wireless network is downgraded to complete island recovery.

[0046] Optionally, the island recovery method in the wired-wireless hybrid network further includes:

[0047] The Prim algorithm is used to divide and update islands every 30 seconds.

[0048] Optionally, the dividing and updating of islands every 30 seconds using the improved Prim algorithm includes:

[0049] A1: Control each node in the baseline topology network to send a heartbeat packet to the central node every 30 seconds;

[0050] A2: If the current node does not receive a reply from the central node within the preset time threshold, it controls all edges of the current node to search for the shortest path and determines the island based on the shortest path search results;

[0051] A3: After the shortest path search is completed for each edge in the island, a new central node will be recommended within the island and the process will return to step A1.

[0052] Optionally, the step A2 includes:

[0053] Control the current node to find all the edges it can access;

[0054] Compare the current edge with the historical edge to determine the minimum edge in the current comparison state;

[0055] Repeat the comparison until the current edge is the last edge, and obtain multiple minimum edges;

[0056] Take all the minimum edges as the minimum spanning tree;

[0057] The range formed by the minimum spanning tree is used as the island range to determine the island.

[0058] Example 2

[0059] When an island appears in the network, the nodes in the island lose connection with the external nodes. In order to quickly connect the nodes in the island, it is necessary to find the shortest path between the two islands to a given node. The specific content of this embodiment is described below:

[0060] Each node in the topology belongs to a whole before being damaged, and each node retains the topology map of the entire topology. Figure 2 shown.

[0061] Figure 2 Each node in the system will use Prim's algorithm to divide the islands and update the island range every 30 seconds. When a node line in the topology is damaged and forms a network island, the system will automatically divide and update the island range, such as Figure 3 shown.

[0062] For each island, the external network situation is unknown, so the entire external world can be regarded as an island.

[0063] When an island is formed, the specific node on the target island will use the previously saved topology map to find the same specific node in the external island (the node with the largest number in the island is selected at this time), and the external island will also use the same method to find the specific node of the target island. Figure 4 Node 3, the largest node in island 1, will search for node 9, the largest node in the unknown island. At this point, the topology of the entire topology is retained in the memory of each node. Each island (including unknown islands) will calculate the shortest distance to the unknown island. The optimal path is node 3 -> node 6 -> node 9.

[0064] When the island encounters a boundary while searching for a node in the island, a wireless signal will be raised at the boundary to ensure smooth network operation. Figure 4 shown.

[0065] Each node's wired network also continuously attempts to connect to adjacent nodes to ensure network connectivity. However, there is a delay in the diffusion of information between these nodes, which can cause inconsistent network map updates between nodes within their own island. Inconsistent network map information can prevent islands from correctly finding the optimal wireless rise and fall nodes, thus failing to ensure optimal concealment.

[0066] In order to prevent delays in information diffusion, each node in the island will select a central node when the entire system starts (if this central node loses connection, each node in the island will automatically select a new central node according to specific rules). The central node will collect connection data from each node in the island in the form of polling and send it to other nodes regularly, so as to ensure the consistency of information data between nodes.

[0067] like Figure 5 As shown, the screening principle of the central node is based on the maximum node, and the maximum node is 12 at this time.

[0068] When the wired connections between nodes 4 and 7, nodes 5 and 8, and nodes 6 and 9 are disconnected, the nodes in each island will reselect the central node. At this time, the upper island will select node 6, and the lower island will select node 12 (as shown in the following example). Figure 6 ).

[0069] A wireless network has been established between nodes 6 and 9, see Figure 7 .

[0070] When the wired connection between nodes 5 and 8 is restored, the system will automatically lower the connection between nodes 6 and 9. Figure 8 .

[0071] If it detects that the adjacent node's wired network is restored and the adjacent node's wireless connection is enabled, the system will lower the wireless network at both ends to maximize concealment.

[0072] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for recovering isolated islands in a wired / wireless hybrid network, characterized in that: The island recovery method in the wired-wireless hybrid network includes: S1: Obtain a baseline topology network with a fixed number of nodes and topology graph; S2: If there is a line damage in the reference topology network, divide the damaged line into islands to obtain a topology map of the current reference topology network, where the islands include at least target islands and external islands; S3: controlling the target island to determine a first specific node in a topology graph of a current reference topology network according to a topology graph of a historical reference topology network, wherein the first specific node is located on the external island; S4: controlling the external island to determine a second specific node in the topology graph of the current reference topology network according to the topology graph of the historical reference topology network, wherein the second specific node is located on the target island; S5: Determine the shortest path between the first specific node and the second specific node; S6: When there is a boundary in the shortest path, raising the wireless network and repairing other lines between the first specific node and the second specific node; S7: If there is a connection line between the first specific node and the second specific node, the wireless network is downgraded to complete island recovery.

2. The method for recovering an isolated island in a wired / wireless hybrid network according to claim 1, wherein: The isolated island recovery method in the wired / wireless hybrid network further includes: The improved Prim algorithm is used to divide and update islands every 30 seconds.

3. The method for recovering an isolated island in a wired / wireless hybrid network according to claim 2, wherein: The method of dividing and updating the islands every 30 seconds using the improved Prim algorithm includes: A1: Control each node in the baseline topology network to send a heartbeat packet to the central node every 30 seconds; A2: If the current node does not receive a reply from the central node within the preset time threshold, it controls all edges of the current node to search for the shortest path and determines the island based on the shortest path search results; A3: After the shortest path search is completed for each edge in the island, a new central node will be recommended within the island and the process will return to step A1.

4. The method for recovering an isolated island in a wired / wireless hybrid network according to claim 3, wherein: The step A2 comprises: Control the current node to find all the edges it can access; Compare the current edge with the historical edge to determine the minimum edge in the current comparison state; Repeat the comparison until the current edge is the last edge, and obtain multiple minimum edges; Take all the minimum edges as the minimum spanning tree; The range formed by the minimum spanning tree is used as the island range to determine the island.

Images