发明授权
US08213400B2 Collision-free beacon scheduling method based on distributed address assignment scheme
有权
基于分布式地址分配方案的无冲突信标调度方法
- 专利标题: Collision-free beacon scheduling method based on distributed address assignment scheme
- 专利标题(中): 基于分布式地址分配方案的无冲突信标调度方法
-
申请号: US12394946申请日: 2009-02-27
-
公开(公告)号: US08213400B2公开(公告)日: 2012-07-03
- 发明人: Jae-Ho Kim , Min-Hwan Song , Il-Yeup Ahn , Sang-Shin Lee , Tae-Hyun Kim , Kwang-Ho Won
- 申请人: Jae-Ho Kim , Min-Hwan Song , Il-Yeup Ahn , Sang-Shin Lee , Tae-Hyun Kim , Kwang-Ho Won
- 申请人地址: KR Seongnam, Gyeonggi-province
- 专利权人: Korea Electronics Technology Institute
- 当前专利权人: Korea Electronics Technology Institute
- 当前专利权人地址: KR Seongnam, Gyeonggi-province
- 代理机构: Lowe Hauptman Ham & Berner, LLP
- 优先权: KR10-2008-0133933 20081224
- 主分类号: H04J3/00
- IPC分类号: H04J3/00
摘要:
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.
公开/授权文献
信息查询