Collision-Free Beacon Scheduling Method based on Distributed Address Assignment Scheme
First Claim
1. A beacon scheduling method based on a distributed address assignment scheme, wherein 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 is 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 is capable of having.
1 Assignment
0 Petitions
Accused Products
Abstract
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.
-
Citations
16 Claims
-
1. A beacon scheduling method based on a distributed address assignment scheme, wherein 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 is 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 is capable of having. - View Dependent Claims (2, 3, 4, 9, 10, 11, 12)
- (1+On×
-
5. A beacon scheduling method based on a distributed address assignment scheme, wherein 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 is obtained from Tn=BI−
- 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 BI denotes a beacon interval, 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 is capable of having. - View Dependent Claims (6, 7, 8, 13, 14, 15, 16)
- SD*(1+On*Bd) according to an address of the device determined by a distributed address assignment mechanism to create a beacon transmission schedule,
Specification