Master and Slave Nodes for Single-Wire Network ID Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing binary search algorithm for identifying slave nodes in single-wire communication networks is inefficient, particularly when dealing with large IDs, as it requires numerous search runs and can take a long time to find all connected slave nodes, leading to excessive branch exploration in the binary tree.
Innovation Solution
A method that defines a position of an ID or partial ID using an index in both the master and slave nodes, where probe commands are transmitted to compare values and adjust the index based on active status, allowing for a more efficient search by using combined enter probe commands and memory commands to store and recall indices, thereby reducing the number of search runs and commands needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a binary search algorithm is used to identify slave nodes, then the search can be systematically performed through the binary tree, but the time required increases exponentially with longer IDs due to the large number of search runs needed
Solution Approach 1:
The patent applies preliminary action by having the master node send a probe command before the enter command to check if a slave node with the desired ID prefix exists. This preliminary probing prevents unnecessary traversal into sub-branches of the binary tree that would not contain matching slave nodes, thereby reducing the total number of search runs and time required, especially for long IDs
Solution Approach 2:
The patent segments the ID search process into distinct phases: probing phase (sending DIS0/DIS1 commands to check for existence) and entering phase (sending ENT0/ENT1 commands to traverse into sub-branches). This segmentation allows the system to efficiently prune the search space by separating the exploration step from the commitment step, reducing redundant operations in the binary tree traversal
2Ease of operation
If the master node sends separate probe commands and enter commands, then the search process can be controlled step-by-step, but the number of commands transmitted increases, leading to more communication overhead
Solution Approach 1:
The patent merges the probe and enter operations into a unified search process where the master node systematically sends DIS0/DIS1 probe commands followed by ENT0/ENT1 enter commands in a coordinated sequence. This merging allows the search control logic to be centralized and optimized, reducing the total number of commands by eliminating redundant probe-enter pairs through intelligent pruning based on slave node responses
3Measurement precision
If slave nodes continuously monitor for probe commands at each ID position, then accurate identification can be achieved, but the complexity of the slave node logic increases
Solution Approach 1:
The patent applies self-service by having slave nodes autonomously compare their stored ID against the probe commands received from the master node and automatically respond with IRQ interrupts when matches are found. This self-service mechanism eliminates the need for complex centralized control logic, as each slave node independently performs the comparison and decision-making, simplifying the overall system architecture while maintaining accurate ID matching
Data Source
AI summary
Illustrative methods, apparatuses and software are described for searching for an ID of a slave node within a communication network, such as a single-wire communication network. Also, illustrative embodiments of a master node and a slave node are described.