Path Selection Device Using Signal Oscillation Simulation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional shortest path search algorithms consume significant computational time and resources, making it difficult to perform real-time path selection in dynamic information networks, especially in equipment with limited resources, which compromises user convenience and network responsiveness.
Innovation Solution
A path selection method and device that acquire network information, analyze network states using a computational model, and select paths by simulating signal oscillation through the network, determining the first link for each node to establish a desired path between nodes, reducing the need for extensive computational resources and enabling high-frequency path selection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional shortest path search algorithms (Dijkstra, A*) are used, then path selection can be performed, but computational time becomes excessively long for large-scale networks
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing route information between nodes before actual path selection is needed. This allows the system to quickly retrieve and combine pre-computed route segments during real-time path selection, avoiding the need to perform exhaustive search algorithms from scratch for each new path request.
Solution Approach 2:
The patent segments the path selection process into multiple components: pre-computing route segments between adjacent areas, storing them in a database, and then assembling these segments during actual path selection. This segmentation allows the heavy computational work to be done once during preprocessing rather than repeatedly during each path selection operation.
2Productivity
If preprocessing methods (bit vector, highway hierarchy) are applied to reduce search time, then path selection becomes faster, but preprocessing time and memory requirements increase
Solution Approach 1:
The patent applies local quality by computing and storing route information only for specific segments between adjacent areas rather than the entire network. This localized approach reduces the total amount of data that needs to be processed and stored, making the preprocessing more efficient while still providing useful route information for rapid path selection.
Solution Approach 2:
The patent changes the parameter of route information representation by storing not just simple path sequences but also associated metadata such as transmission times, distances, and area information. This enriched representation allows for faster path selection by providing more useful information per entry, reducing the need for extensive search and comparison operations.
3Productivity
If Dijkstra method is applied to information networks with dynamic changes, then path selection can be performed, but the method cannot adapt to dynamic network conditions
Solution Approach 1:
The patent introduces dynamics by enabling the system to update and re-query route information based on current network conditions. The database can be dynamically queried with different parameters (such as current congestion levels, link availability) to adapt path selections to changing network states, making the system responsive to dynamic conditions while maintaining the efficiency benefits of pre-computed routes.
Data Source
AI summary
A start node acquires coupled state information indicating a connectibility of nodes from a network. By executing simulation in accordance with a computational model constructed based on the coupled state information, the start node determines for each node a first link that transmitted an oscillation or a signal first to the node. A path that extends from a target node to the start node via the first link of intermediate nodes is selected.