Vehicle Communications Path Finding with Non-Recursive Depth-First Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing vehicle communication networks face inefficiencies in determining the most efficient path for communicating with external computing networks due to the complexity of cyclic and acyclic network topologies and the need for recursive algorithms that consume significant computing resources.
Innovation Solution
A non-recursive depth-first search algorithm is employed to identify the most efficient path within vehicle networks for communicating with external computing networks by using a stack-based approach that avoids recursive function calls, optimizing bandwidth and delay through a non-recursive depth-first search algorithm.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a recursive algorithm is used to determine the most efficient communication path in vehicle networks, then the path finding accuracy is improved, but the computing resource consumption increases significantly
Solution Approach 1:
The patent replaces the recursive algorithm (computational mechanism) with an iterative algorithm that uses explicit stack data structures. This substitution eliminates the overhead of recursive function calls and stack frame management, reducing computing resource consumption while maintaining path finding accuracy in cyclic and acyclic network topologies.
2Use of energy by moving object
If a non-recursive algorithm is used to reduce computing resource consumption, then the energy efficiency is improved, but the algorithm complexity increases due to explicit stack management
Solution Approach 1:
The patent segments the path finding algorithm into distinct iterative steps with explicit stack management. By breaking down the recursive logic into manageable iterative components with clear entry and exit points, the algorithm becomes more controllable and easier to optimize, reducing overall complexity despite the initial appearance of explicit stack handling.
3Reliability
If the network topology is made cyclic to improve communication paths, then the network reliability is improved, but the path determination complexity increases
Solution Approach 1:
The patent implements a dynamic iterative algorithm that adapts to both cyclic and acyclic network topologies. The algorithm dynamically adjusts its path exploration based on the actual network structure, using explicit stack management to handle cyclic paths without getting trapped in infinite loops, thereby maintaining reliability while managing complexity.
Data Source
AI summary
A computer that includes a processor and a memory, the memory including instructions executable by the processor to identify a communications node, included in a network for a first computer network that includes network device nodes, that includes connectivity to second computer network and identify a source node included in the network device nodes. The instructions can include instructions to execute a non-recursive algorithm on a list of network paths in the first computer network that connect the source node to the communications node; identify, from the list of network paths, a preferred network path that includes a fewest number of nodes between the source node and the communications node and communicate from the source node to the second computing network via the preferred network path and the communications node.