Zigbee Node Address Reassignment for Dynamic Network Volume
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Zigbee networks require all nodes to perform a new network join procedure and waste network resources when changing the number of maximum child nodes or levels, leading to increased packet transmission overhead and delayed data transmission during address reassignment.
Innovation Solution
A method where nodes in a Zigbee network adaptively reassess their logical addresses by calculating a family tree and new logical addresses based on changes in network volume, allowing for reduced packet overhead by using a reserved bit in data packets to indicate the new address and maintaining both old and new addresses during transition.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes perform a new network join procedure to receive newly allocated logical addresses when network volume changes, then the address allocation can be updated, but network resources are wasted and data transmission is delayed
Solution Approach 1:
The patent segments the address reassignment process into two independent parts: (1) the coordinator generates new address blocks based on changed network volume, and (2) parent nodes autonomously reassign addresses to their children using the new blocks. This eliminates the need for all nodes to perform full network join procedures, reducing transmission delays while ensuring accurate address allocation.
Solution Approach 2:
The coordinator performs preliminary action by generating new address blocks and notifying parent nodes before actual address reassignment occurs. Parent nodes then use these pre-prepared blocks to reassign addresses to their children, avoiding the need for children to perform discovery procedures and reducing overall reassignment time.
2Reliability
If all nodes perform a new network join procedure for address reassignment, then addresses can be reallocated, but packet transmission overhead increases
Solution Approach 1:
The patent extracts the address block generation function from the network join procedure. The coordinator generates new address blocks independently and distributes them to parent nodes, separating this function from the traditional join process. This eliminates unnecessary packet transmissions during address reassignment while ensuring accurate allocation.
Solution Approach 2:
Parent nodes perform self-service by autonomously reassigning addresses to their children using the new address blocks received from the coordinator. Children nodes do not need to initiate discovery or join procedures, as the address reassignment is pushed down the tree automatically, reducing network resource consumption.
3Adaptability or versatility
If the number of maximum child nodes or levels is expanded, then the network can accommodate more nodes, but all existing nodes must change their logical addresses
Solution Approach 1:
The patent applies local quality by allowing different parts of the network tree to have different address block allocations. When network volume changes, only the affected parent nodes and their children need to receive new address blocks, while other parts of the tree maintain their existing addresses. This localized approach reduces reassignment complexity compared to requiring all nodes to change addresses.
Data Source
AI summary
A method of adaptively reassigning addresses of nodes according to changes in volume or a wireless network. The method includes receiving, at the node of the wireless network, information according to the changes in volume from a coordinator as a top level of the tree structure, calculating, at the node, a family tree indicating information and a location of the node in the tree structure according to an old logical address of the node and the information, and calculating a new logical address of the node according to the change in volume and the calculated family tree; and transceiving, at the node, a data packet according to the newly calculated logical address. Accordingly, overheads of the whole network for changing addresses may be reduced when changes in volume of the network occur, so that dynamic changes in volume of the network may be rapidly and actively implemented.