METHOD AND APPARATUS FOR SCHEDULING TIMING FOR COMMUNICATION BETWEEN SENSOR NODES IN WIRELESS SENSOR NETWORK

• US 20090207769A1
• Filed: 01/14/2009
• Published: 08/20/2009
• Est. Priority Date: 01/14/2008
• Status: Abandoned Application

• Current Assignee: Electronics and Telecommunications Research Institute, The Ohio State University Research Foundation
• Original Assignee: Electronics and Telecommunications Research Institute, The Ohio State University Research Foundation
• Inventors: MOON, Young Bag, FELEMBAN, Emad, VURAL, Serdar, EKICI, Eylem, LEE, Kangwoo, PARK, Sang Joon
• Application Number:
  US12/353,596
• Publication Number:
  US 20090207769A1
• Time in Patent Office: Days
• US Class Current: 370/311
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04W 74/04 Scheduled access hybrid access H04W74/02
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Provided is a method of scheduling timing for communication between sensor nodes in a wireless sensor network, the method including categorizing a plurality of sensor nodes in a cluster into several groups, respectively assigning time slots to the groups, and establishing data communication according to the assigned time slots.

Claims

1. A method of scheduling timing for communication between sensor nodes in a wireless sensor network, the method comprising:

categorizing a plurality of sensor nodes in a cluster into several groups;

respectively assigning time slots to the groups; and

establishing data communication according to the assigned time slots.

2. The method of claim 1, wherein the categorizing of the sensor nodes comprises:

collecting neighborhood relation information of neighboring nodes of the sensor nodes; and

designating the groups to which the sensor nodes belong according to a shortest path tree, based on the neighborhood relation information.

3. The method of claim 1, wherein the respectively assigning of the time slots to the groups comprises respectively assigning time slots to the groups, in consideration of neighborhood relation information of neighboring nodes of the sensor nodes and conflict relations between the neighboring nodes according to the neighborhood relation information.

4. The method of claim 1, wherein the establishing of data communication according to the assigned time slots comprises each of the sensor nodes entering a sleep mode in time slots to which each sensor node belongs.

5. An apparatus for scheduling timing for communication between sensor nodes in a wireless sensor network, the apparatus comprising:

a plurality of sensor nodes in a cluster; and

a cluster head node categorizing the sensor nodes into several groups, and respectively assigning time slots to the groups,

wherein data communication is established between each of the sensor nodes and the cluster head node according to the assigned time slots.

6. The apparatus of claim 5, wherein each of the sensor nodes comprises:

a multi-sectored antenna via which signals are received from all directions and transmitted to a specific sector; and

a transceiver controlling communication.

7. The apparatus of claim 5, wherein the cluster head node collects neighborhood relation information of neighboring nodes of the sensor nodes, and designates the groups to which the sensor nodes belong, based on neighborhood relation information.

8. The apparatus of claim 5, wherein the cluster head node respectively assigns time slots to the groups, in consideration of neighborhood relation information of neighboring nodes of the sensor nodes and conflict relations between the neighboring nodes according to the neighborhood relation information.

9. The apparatus of claim 5, wherein each of the sensor nodes enters a sleep mode in time slots to which the sensor node belongs.