Network Routing via Concentrator Characteristics and Node Trace Messages
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-hop wireless networks, especially ZigBee networks with concentrators, establishing and maintaining data routes is challenging due to sporadic node presence and varying concentrator characteristics, leading to costly storage requirements and inefficient bandwidth utilization.
Innovation Solution
A method where nodes receive characteristics of concentrators through messages, allowing them to adapt the sending of route trace messages based on available storage and traffic conditions, optimizing route caching and conserving bandwidth by dynamically adjusting message transmission according to concentrator capabilities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a concentrator stores source routes for many nodes to enable efficient routing, then routing efficiency is improved, but storage cost increases
Solution Approach 1:
The patent segments the routing information storage function by introducing intermediate nodes that cache route trace messages before they reach the concentrator. This divides the storage burden across multiple nodes rather than concentrating it all at the concentrator, allowing the concentrator to maintain efficient routing while reducing its storage requirements.
Solution Approach 2:
The patent implements preliminary action by having intermediate nodes process and cache route trace messages in advance before the concentrator needs them. This allows the concentrator to receive pre-processed routing information, reducing the need for the concentrator to store complete source routes for all nodes.
2Quantity of substance
If the concentrator re-establishes route information from scratch for each destination, then storage requirements are reduced, but network bandwidth utilization becomes inefficient
Solution Approach 1:
The patent applies preliminary action by having intermediate nodes perform route tracing and caching operations before the concentrator needs the routing information. This pre-processing eliminates the need for the concentrator to re-establish routes from scratch, reducing redundant bandwidth consumption while maintaining efficient routing.
Solution Approach 2:
The patent implements feedback mechanisms where intermediate nodes send cached route information back to the concentrator, allowing the concentrator to use this pre-fetched routing data without re-tracing paths. This feedback loop eliminates redundant bandwidth usage while maintaining storage efficiency.
3Device complexity
If the network uses fixed routing protocols without adapting to concentrator characteristics, then protocol simplicity is maintained, but adaptability to different concentrators deteriorates
Solution Approach 1:
The patent applies dynamics by making the routing protocol adaptive to concentrator characteristics. Intermediate nodes dynamically adjust their behavior based on concentrator capabilities, selectively sending route trace messages only when necessary. This dynamic adaptation maintains protocol simplicity at the basic level while providing versatility in handling different concentrator types.
Solution Approach 2:
The patent implements parameter changes by modifying the routing protocol parameters based on concentrator characteristics. The protocol dynamically adjusts parameters such as whether to send route trace messages, how to cache routing information, and which intermediate nodes to involve, based on the specific concentrator's capabilities and current network conditions.
Data Source
Figure 1
Figure 2a
Figure 2b
AI summary
An invitation message (112, 116, 120) is sent from a concentrator (102) to nodes in a network. Each node records (124) an identifier (126) of the node or concentrator from which it received the message and forwards (122) the message to its neighbors. A node (108) then sends a trace message (132, 134, 136) to the concentrator (102) via intermediate nodes (106, 104) traversed by the invitation message in reaching the node and appends thereto the identifiers of the intermediate nodes. The concentrator then uses source routing to send a subsequent message (144, 146, 148) to the node (108) using the identifiers included in the trace message. The invitation message and/or the subsequent message includes characteristic s) (200) of the concentrator one or more of which are then stored by nodes, including node (108). The characteristic(s) are used in deciding (206, 208) to send further trace messages, thereby regulating use of network bandwidth.