首页>
外国专利>
Collision-free beacon scheduling method based on distributed address assignment scheme
Collision-free beacon scheduling method based on distributed address assignment scheme
展开▼
机译:基于分布式地址分配方案的无冲突信标调度方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼
机译:提供了一种基于分布式地址分配方案的信标调度方法,该方法使用提供分布式地址系统的网络(例如ZigBee网络)中的地址非冲突来调度信标并最小化数据延迟。在该方法中,可以从T n Sub获得来自父设备的信标接收与具有树结构的无线网络系统中的设备的信标传输之间的时间偏移T n Sub>。 > = SD×(1 + O n Sub>×B d Sub>)根据分布式地址分配机制确定的设备地址创建信标传输调度,其中SD表示超帧持续时间,O n Sub>表示一个值,用于确定该设备在网络中的同级设备中哪个子设备对应,B d Sub>表示路由器的最大数量树中深度为d的子网可以拥有的设备。
展开▼