Loop Path Search in Mesh Networks via Adjacent Node Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional loop path calculation methods in mesh networks suffer from low efficiency, with a time complexity of O(Kn^3), leading to inefficient search processes.
Innovation Solution
The method involves searching for adjacent nodes, deleting edges, using a K Shortest Path algorithm to calculate paths, and traversing these paths to identify loop paths by adding the starting node, thereby improving efficiency by dividing loop paths into paths between adjacent nodes and paths from adjacent nodes to the starting node.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a recursive traversal mode is employed to calculate loop paths, then all loop paths can be found, but the time complexity increases to O(Kn^3) resulting in low search efficiency
Solution Approach 1:
The patent segments the loop path search problem into two independent parts: (1) finding all simple paths between adjacent nodes of the target node, and (2) combining these paths with the target node to form complete loop paths. This segmentation avoids the need for recursive traversal of the entire graph while ensuring all loop paths are captured, reducing time complexity from O(Kn^3) to O(Kn^2).
Solution Approach 2:
The patent performs preliminary action by first identifying all adjacent nodes of the target node and computing all simple paths between these adjacent nodes before constructing the final loop paths. This preliminary computation of paths between adjacent nodes eliminates the need for repeated recursive searches during loop path construction, significantly improving search efficiency.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
The present invention discloses a method and apparatus for loop path search in a mesh network, comprising: a network side searching for all nodes adjacent to node v1 in the mesh network, and deleting all edges formed by node v1 and nodes directly connected to node v1 in the mesh network; the network side performing calculation for all obtained nodes adjacent to node v1 through a K shortest path algorithm to obtain all paths between all nodes adjacent to node v1; and the network side traversing all obtained paths between all nodes adjacent to node v1, and adding node v1 at start and termination of each path to finish search for all loop paths of node v1 in the Mesh network. With the present invention, the problem of low loop path search efficiency existed in the conventional method is solved, and the loop path search efficiency is improved.