Node Device Autonomous Route Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network routing systems, particularly in wireless communication, face challenges in maintaining high communication quality due to the dynamic nature of link changes and the need for each node to autonomously select an optimal route without overloading the network, especially as the number of nodes increases.
Innovation Solution
A node device equipped with an identification information management table, a destination node weighting table, and a frame destination determination device that autonomously selects the best route by updating weights based on the possibility of successful frame transfer, allowing each node to determine the optimal path without requiring a centralized server or extensive network topology knowledge.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If each node autonomously selects routes using traditional routing protocols (AODV, OLSR), then route selection capability is improved, but network load increases significantly
Solution Approach 1:
The patent changes the routing decision parameter from complex topology-aware metrics to simple weight values associated with each node. Nodes are assigned weights that reflect their routing quality, and route selection is based on minimizing the sum of weights along the path. This parameter simplification reduces computational complexity and message overhead while maintaining autonomous route selection capability.
Solution Approach 2:
The patent implements a self-service mechanism where nodes automatically update their own weight values based on local observations of frame transmission success. Each node monitors whether frames sent to it are successfully received and adjusts its weight accordingly, without requiring centralized control or extensive coordination with other nodes. This self-service approach reduces network load while maintaining adaptive route selection.
2Reliability
If nodes update routing information frequently to adapt to link changes, then route quality is improved, but communication overhead increases
Solution Approach 1:
The patent implements periodic weight updates triggered by successful frame transmissions rather than continuous or frequent updates. When a node successfully receives a frame, it updates its weight value at that moment. This event-driven periodic update mechanism ensures route quality adapts to link changes while minimizing unnecessary communication overhead compared to continuous updating schemes.
Solution Approach 2:
The patent uses feedback from frame transmission outcomes to adjust routing weights. When frames are successfully transmitted to a node, the node's weight is updated to reflect improved routing quality. This feedback mechanism ensures that routing information adapts to actual link conditions without requiring excessive communication, as updates are triggered only by meaningful events (successful transmissions).
3Reliability
If centralized server manages routing in large-scale networks, then route optimization is improved, but system complexity and management overhead increase
Solution Approach 1:
The patent eliminates centralized routing management by enabling each node to autonomously determine its weight value based on local frame transmission success. Nodes independently adjust their own routing parameters without requiring a central server to compute or distribute routing information. This self-service approach maintains route optimization capability while dramatically reducing system complexity and management overhead in large-scale networks.
Solution Approach 2:
The patent segments the routing decision-making process from centralized control to distributed autonomous operation. Each node independently manages its own weight value and participates in route selection based on local information. This segmentation of routing functionality into independent node-level decisions eliminates the need for centralized management infrastructure while maintaining effective route optimization.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A node device and a program of simple structures autonomously select an appropriate route without imposing a load on a network. In a node device 1 in a communication network, an FID management table 5 stores an FID for unique identification of a frame and the information about a destination node of the frame, and a weighting table 7 stores weighting information about another node as a destination for relay of the frame for each final destination node of the frame. When a frame transmitted to a local node is received, and if the FID of the received frame is stored in the FID management table 5, the data about the destination node associated with the FID is updated. If the FID of the frame received from the frame reception device is not stored in the FID management table 5, the FID management table 5 corresponding to the destination node of the frame is referred to, and another node as a destination for relay of the frame is determined.