Invention Grant
US08213400B2 Collision-free beacon scheduling method based on distributed address assignment scheme
有权
基于分布式地址分配方案的无冲突信标调度方法
- Patent Title: Collision-free beacon scheduling method based on distributed address assignment scheme
- Patent Title (中): 基于分布式地址分配方案的无冲突信标调度方法
-
Application No.: US12394946Application Date: 2009-02-27
-
Publication No.: US08213400B2Publication Date: 2012-07-03
- Inventor: Jae-Ho Kim , Min-Hwan Song , Il-Yeup Ahn , Sang-Shin Lee , Tae-Hyun Kim , Kwang-Ho Won
- Applicant: Jae-Ho Kim , Min-Hwan Song , Il-Yeup Ahn , Sang-Shin Lee , Tae-Hyun Kim , Kwang-Ho Won
- Applicant Address: KR Seongnam, Gyeonggi-province
- Assignee: Korea Electronics Technology Institute
- Current Assignee: Korea Electronics Technology Institute
- Current Assignee Address: KR Seongnam, Gyeonggi-province
- Agency: Lowe Hauptman Ham & Berner, LLP
- Priority: KR10-2008-0133933 20081224
- Main IPC: H04J3/00
- IPC: H04J3/00

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.
Public/Granted literature
- US20100157914A1 Collision-Free Beacon Scheduling Method based on Distributed Address Assignment Scheme Public/Granted day:2010-06-24
Information query