METHOD FOR DETERMINING SUPERFRAME FOR BEACON SCHEDULING

• US 20090274127A1
• Filed: 10/24/2007
• Published: 11/05/2009
• Est. Priority Date: 12/04/2006
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Kim, Sun-Joong, Lee, Jong-Oh, Lee, Jong-Young, Chae, Jong-Suk, Pyo, Cheol-Sig, Jeong, Hoon
• Granted Patent: US 8,254,342 B2
• Time in Patent Office: Days
• US Class Current: 370/336
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 48/16 Discovering, processing access restriction or access information
• CPC Class Codes: H04W 72/12 Wireless traffic scheduling
• CPC Class Codes: H04W 72/20 Control channels or signalling for resource management
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Provided is a method for determining superframe to efficiently perform beacon scheduling by allocating superframe lengths which are different according to a routing depth of sensor nodes in a ZigBee based wireless sensor network. The method for determining a superframe for beacon scheduling, includes the steps of: receiving a beacon from a neighboring node and grasping information on a superframe used by the neighboring nodes; and determining a transmission time and a length of own superframe based on superframe information of the grasped neighboring node.

Claims

1. A method for determining a superframe for beacon scheduling, comprising the steps of:

receiving a beacon from a neighboring node and grasping information on a superframe used by the neighboring nodes; and

determining a transmission time and a length of own superframe based on superframe information of the grasped neighboring node.

2. The method of claim 1, further comprising the steps of:

checking whether there is another node to access to the node, which is called a child node; and

when there is the child node, transmitting the determined own superframe information and superframe information of own parent node, which is a high-level node to be accessed by own node, to the child node.

3. The method of claim 2, wherein in the step of determining the superframe information, own superframe length should not be larger than a superframe interval of the parent node.

4. The method of claim 1, wherein the superframe information includes beacon interval information, superframe length information, and transmission time information of the superframe.

5. The method of claim 1, wherein the beacon has a structure that the beacon interval is divided into a plurality of basic superframe slots.

6. The method of claim 5, wherein the basic superframe slot is a slot whose superframe length is ‘

0’

.