Wireless Node Neighbor Registration via Timing Adjustment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional wireless communication nodes in multi-hop wireless networks face challenges in registering suitable neighbor nodes due to packet collisions and random timing issues during the Mesh Link Establishment (MLE) protocol, leading to potential selection of nodes with high rank values and low Received Signal Strength Intensity (RSSI), and limited capacity in neighbor node lookup tables, which can result in incomplete registration of intended relay nodes.
Innovation Solution
A wireless communication node with a neighbor node information storage, a control message exchanger, a timing adjuster, and a registered node determiner that adjusts the timing of response messages based on the connective state and order of arrival to ensure registration of nodes with lower rank values and higher RSSI, and allows pre-registration of intended nodes to avoid capacity limitations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the Mesh Link Establishment (MLE) protocol is used for neighbor node registration, then packet exchange between nodes is enabled, but packet collisions occur due to random timing issues leading to incomplete registration
Solution Approach 1:
The patent applies preliminary action by having nodes wait for a predetermined period after receiving MLE messages before transmitting their own responses. This timing control mechanism ensures that nodes register in a controlled sequence rather than simultaneously, preventing packet collisions and ensuring complete registration of intended relay nodes in the neighbor node lookup table.
2Ease of operation
If neighbor nodes are registered based on random response timing, then simple implementation is achieved, but nodes with high rank values and low RSSI may be selected
Solution Approach 1:
The patent implements feedback by having nodes transmit their rank values and RSSI information during the MLE protocol exchange. The receiving node uses this feedback information to make informed decisions about which nodes to register, selecting nodes with lower rank values and higher RSSI to ensure better link quality while maintaining a relatively simple registration process.
3Quantity of substance
If the neighbor node lookup table capacity is limited, then memory usage is reduced, but not all intended relay nodes can be registered
Solution Approach 1:
The patent applies preliminary action by pre-establishing a list of intended relay nodes before the registration process begins. Nodes are registered in a controlled sequence based on this pre-planned list, ensuring that all intended relay nodes are included in the neighbor node lookup table without requiring excessive memory capacity, thus balancing registration completeness with memory usage.
4Speed
If all peripheral nodes send MLE responses simultaneously, then response speed is increased, but packet collisions prevent accurate registration
Solution Approach 1:
The patent implements periodic action by establishing a predetermined time sequence for MLE message responses. Nodes transmit their responses at specific intervals rather than simultaneously, with each node waiting for a predetermined period after receiving MLE messages before transmitting its own response. This periodic transmission pattern ensures accurate registration while maintaining efficient response speed.
Data Source
AI summary
A wireless communication node on the multi-hop wireless network has a control message exchanger for exchanging control messages with peripheral nodes to determine neighbor nodes whose information should be registered in a neighbor node information storage; a timing adjuster for adjusting, depending on a connective state of the wireless communication node in the network, a timing at which a first control message is sent back in response to a second control message arriving from other wireless communication nodes; and a registered node determiner for primarily referencing the order of arrival of a first control message from the other wireless communication node to determining neighbor nodes whose information should be registered in the neighbor node information storage.