Mesh Network Node Information Location via Benchmark Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mesh networks, particularly those with limited node devices, efficiently locating information such as identification data for object tracking, upgrade data, and resources is challenging due to limited resources and bandwidth, leading to significant signalling overhead and long update times during software upgrades.
Innovation Solution
A method where inquiry messages are exchanged between node devices, with an initiating node evaluating and updating a listing of candidate nodes based on benchmark data, allowing only qualified nodes to participate in the message exchange, thereby reducing unnecessary communication and resource usage, and utilizing a cross-layer protocol to dynamically update message content and aggregate resource information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If all node devices are collected and compared to find the best match for information retrieval, then the information can be located accurately, but the network traffic increases significantly and may overload the communication channel
Solution Approach 1:
The patent applies preliminary action by pre-collecting and storing benchmark data (such as information type, storage capacity, processing power, and location) at each node device before an information search is initiated. When an information request is made, the initiating node can quickly filter and identify candidate nodes using this pre-prepared benchmark data, avoiding the need to collect and compare all node devices in real-time, thus reducing network traffic while maintaining accurate information location.
2Measurement precision
If all node devices are collected and compared to find the best match for information retrieval, then the information can be located accurately, but the memory and computing load on the collecting node device increases significantly
Solution Approach 1:
The patent applies segmentation by dividing the information search process into multiple stages: (1) The initiating node filters candidate nodes using locally stored benchmark data, (2) Only selected candidate nodes are contacted for detailed information exchange, and (3) The final best match is determined from this reduced set. This segmentation reduces the memory and computing load on any single node device while maintaining accurate information location through systematic filtering.
3Reliability
If information is distributed and stored at multiple node devices with backups, then the system reliability and robustness improve, but the time required to locate and retrieve information increases
Solution Approach 1:
The patent applies feedback by implementing a benchmark data structure that includes version numbers and status information about stored information at each node device. When searching for information, nodes use this feedback data to quickly identify which candidate nodes have the latest or most relevant information versions, enabling efficient selection among multiple backup locations without requiring sequential checking of all backup nodes, thus reducing retrieval time while maintaining system reliability.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A node device (4) in a network (1) of communicatively interconnected node devices (4) having limited data processing and storage resources, such as a mesh network (1) of node devices (4), receives an inquiry message of the type 'find the best match' for information to be located at a node device (4). The inquiry message comprises benchmark data relating to the information to be located. The receiving node device updates the message based on a comparison of the content in the latest received message and the node's locally stored information. The locally stored information is derived from previous received messages from other node devices (4) in the network (1) and information available at the receiving node device. When no update is required, no message is broadcasted by a node device (4) and the local copy at the node devices involved converges in a few broadcasts to a static content from which the information sought can be located in the network (1).