ZigBee Beacon Scheduling via Distributed Address Offsets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing ZigBee network scheduling method is not standardized, leading to beacon collisions and data transmission delays when new devices join overlapping communication areas or when routers move, causing incorrect beacon reception and overlapping data transmissions.
Innovation Solution
A beacon scheduling method based on a distributed address assignment scheme that calculates a time offset between beacon reception and transmission using expressions like Tn=SD×(1+On×Bd) or Tn=BI−SD*(1+On*Bd) to create a collision-free schedule, ensuring all routers transmit beacons within one beacon interval, thereby preventing collisions and minimizing data delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If routers transmit beacons in overlapping communication areas without standardized scheduling, then network flexibility and device mobility are improved, but beacon collisions and data transmission delays occur
Solution Approach 1:
The patent applies parameter changes by calculating unique time offsets for each router based on its address and network depth parameters. The formula Tn=SD×(1+On×Bd) dynamically adjusts beacon transmission timing parameters according to the router's position in the network hierarchy, ensuring collision-free transmission while maintaining network flexibility.
Solution Approach 2:
The patent introduces a standardized scheduling mechanism as an intermediary between routers in overlapping communication areas. This scheduling system acts as a mediator that coordinates beacon transmissions by calculating unique time offsets, preventing collisions without restricting network flexibility or device mobility.
2Adaptability or versatility
If new devices are added to overlapping communication areas, then network expandability is improved, but beacon reception correctness deteriorates due to collisions
Solution Approach 1:
The patent applies preliminary action by pre-calculating unique time offsets for each router based on its address and network depth before beacon transmission begins. This advance scheduling ensures that even when new devices are added to overlapping communication areas, their beacon transmission times are predetermined and collision-free, maintaining reception correctness.
3Adaptability or versatility
If routers move to different communication areas, then device mobility is improved, but data transmission reliability worsens due to overlapping data periods
Solution Approach 1:
The patent applies dynamics by enabling routers to dynamically change their beacon transmission timing based on their current network position and depth. When routers move to different communication areas, their time offsets are recalculated according to their new addresses and depths, ensuring that data transmission reliability is maintained despite device mobility.
Data Source
AI summary
Provided is a beacon scheduling method based on a distributed address assignment scheme that schedules a beacon and minimizes data delay using non-collision of addresses in a network, such as a ZigBee network, that provides a distributed address system. In the method, a time offset Tn between beacon reception from a parent device and beacon transmission of a device in a wireless network system having a tree structure may be obtained from Tn=SD×(1+On×Bd) according to an address of the device determined by a distributed address assignment mechanism to create a beacon transmission schedule, where SD denotes a super-frame duration, On denotes a value for determining which child among sibling devices in the network the device corresponds to, and Bd denotes a maximum number of router devices that a sub-network having a depth d in a tree can have.