Zigbee Address Assignment via Top-Down Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing ZigBee network address assignment methods result in address wastage and inflexibility, particularly when branches are re-attached or detached, leading to inefficient use of addresses and the need for new address blocks.
Innovation Solution
A top-down address assignment method in ZigBee networks that dynamically allocates address blocks of varying sizes based on the number of child nodes, allowing for efficient reuse of old address blocks during re-attachment and reducing address wastage by using a routing table to manage branch IDs and address blocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If addresses are assigned using fixed probability ranges for child nodes, then address assignment is simple and systematic, but address wastage occurs when branches are re-attached or detached
Solution Approach 1:
The patent applies dynamics by transitioning from a static address assignment system to a dynamic one. The address assignment algorithm now adapts to network changes (branch attachment/detachment) by requesting and receiving desirable address blocks from ancestor nodes, allowing the system to respond to varying network conditions rather than following a fixed pattern
Solution Approach 2:
The patent changes the parameter of address block size from fixed to variable. Instead of assigning addresses based on predetermined probability ranges, the system now requests address blocks of desirable sizes based on actual child node requirements, and receives address blocks from ancestor nodes, enabling flexible adaptation to different network configurations
2Stability of the object's composition
If addresses are assigned using predetermined constants Cm and Lm for the whole network, then address assignment is consistent across all nodes, but the system lacks flexibility when branches need to be re-attached
Solution Approach 1:
The patent segments the address assignment process into multiple stages: nodes first request desirable address blocks from their ancestor nodes, then receive and assign these address blocks to child nodes. This segmentation allows each node to operate semi-independently while maintaining overall network consistency, enabling flexible re-attachment without requiring network-wide reconfiguration
Solution Approach 2:
The patent introduces feedback mechanisms where nodes request address blocks based on their actual needs and receive address blocks from ancestor nodes. This feedback loop enables the system to adapt to changing network conditions while maintaining consistency, as each node's address assignment is based on real-time network state information
3Adaptability or versatility
If address blocks are allocated based on maximum network parameters, then sufficient addresses are available for future expansion, but address wastage increases when not all child nodes are fully populated
Solution Approach 1:
The patent applies partial action by having nodes request only the address blocks they actually need based on their current child node requirements, rather than allocating maximum possible address blocks. This allows the system to maintain sufficient addresses for future expansion while avoiding wastage of addresses that are not currently needed
Data Source
AI summary
An address assigning method in a ZigBee network environment formed of a plurality of devices (or nodes), includes: linking the plurality of nodes in a cluster-tree structure; requesting desirable address blocks from a lowest level to a second highest level of the tree ancestor nodes desirable address blocks, respectively; and assigning the desired address blocks to descendents using a top-down procedure.