Terminal and method for wireless sensor network for determining contention windows in contention-based channel access

• US 8,194,695 B2
• Filed: 01/12/2009
• Issued: 06/05/2012
• Est. Priority Date: 01/11/2008
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Kim, Eui Jik, Kim, Sun Gi, Choi, Hyo Hyun, Nguyen, Vu Thuy Dan, Kim, Jeong Geun
• Primary Examiner(s): Mered, Habte
• Application Number:
  US12/351,902
• Publication Number:
  US 20090180452A1
• Time in Patent Office: 1,240 Days
• Field of Search: 370/338, 370445-448, 370461-462, 370/230, 370/252, 370/329, 370/345, 370/454, 370458-459, 370/468, 455/502, 455/516
• US Class Current: 370/448
• CPC Class Codes: H04W 74/0816 with collision avoidance
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A communication terminal and method is provided for improving channel utilization efficiency in a wireless sensor network using contention-based channel access mechanism is disclosed. The communication method according to the present invention comprises initializing, when a packet transmission is required, a contention window to a size; resetting, when a channel is assessed to be busy, the size of the contention window in a hybrid expansion mode; and attempting, when the channel is assessed to be idle, the packet transmission through the channel.

Claims

1. A communication method for a terminal in a wireless sensor network using a contention-based channel access mechanism, comprising:

initializing a contention window to a known size, when a packet transmission is required;

counting a number of resets of the contention window;

resetting the size of the contention window in a hybrid expansion mode including increasing the size of the contention window one of linearly and exponentially when a parameter indicates linear expansion or exponential expansion, respectively, when a channel is assessed to be busy; and

attempting the packet transmission through the channel, when the channel is assessed to be idle,

wherein increasing the size of the contention window linearly comprises calculating a new size of the contention window as;

CW_i=CW_i-1=c, mod(i,n)≠

0(i≧

1)

wherein i is the number of resets,

CW_i is the size of the contention window,

CW_i-1 is a previous size of the contention window,

c is a linear expansion constant, and

n is a number of expansion resets in which the size of contention window is expanded.

2. The communication method of claim 1, wherein increasing the size of the contention window exponentially comprises calculating a new size of the contention window as:

CW_i=eCW_i-1, mod(i,n)=0(i≧

1)

wherein e is an exponential expansion constant.

3. The communication method of claim 1, wherein initializing the contention window comprises calculating the size of the contention window as:

CW_i=CW_min, i=0,

wherein the CW_min is a minimum size of the contention window.

4. The communication method of claim 3, wherein the number of expansion resets is 3, the linear expansion constant is 2, and the exponential constant is 2, and the minimum size of the contention window is 8.

5. The communication method of claim 1, further comprising:

assessing whether the channel is to be idle in the contention window, and

transmitting, when the channel is assessed to be idle in the contention window, the packet through the channel.

6. A communication terminal of a wireless sensor network using a contention-based channel access mechanism, comprising:

a memory unit which stores a packet carrying data collected by the terminal;

a control unit which;

initializes a contention window to a size, when a packet transmission is required,

counts a number of resets of the contention window

resets, the size of the contention window in a hybrid expansion mode when a channel is assessed to be busy, including increasing the size of the contention window linearly, when a parameter indicates a linear expansion, and increasing the size of the contention window exponentially, when the parameter indicate an exponential expansion and,

attempts the packet transmission through the channel, when the channel is assessed to be idle, and

a radio frequency unit which collects the data and transmits the packet when the channel is assessed to be idle,

wherein the control unit increases the size of the contention window as;

CW_i=CW_i-1=c, mod(i,n)≠

0(i≧

1)

wherein i is the number of resets,

CW_i is the size of the contention window,

CW_i-1 is a previous size of the contention window,

c is a linear expansion constant, and

n is a number of expansion resets in which the size of contention window is expanded.

7. The communication terminal of claim 6, wherein the control unit increases the size of the contention window exponentially as:

CW_i=eCW_i-1, mod(i,n)=0(i≧

1)

wherein e is an exponential expansion constant.

8. The communication terminal of claim 6, wherein the control unit initializes the size of the contention window as:

CW_i=CW_min, i=0,

wherein the CW_min is a minimum size of the contention window.

9. The communication terminal of claim 8, wherein the number of expansion resets is 3, the linear expansion constant is 2, and the exponential constant is 2, and the minimum size of the contention window is 8.

10. A contention-based channel access mechanism device, comprising:

a processor in communication with a memory the memory including code, which when accessed by the code causes the processor to;

initialize a contention window to a known size, when a packet transmission is required;

count a number of resets of the contention window;

reset the size of the contention window in a hybrid expansion mode, when a channel is assessed to be busy, including increasing the size of the contention window one of linearly and exponentially when a parameter indicates a linear expansion or an exponential expansion, respectively; and

attempt the packet transmission through the channel, when the channel is assessed to be idle,

wherein increasing the size of the contention window linearly comprises calculating a new size of the contention window as;

CW_i=CW_i-1=c, mod(i,n)≠

0(i≧

1)

wherein i is the number of resets,

CW_i is the size of the contention window,

CW_i-1 is a previous size of the contention window,

c is a linear expansion constant, and

n is a number of expansion resets in which the size of contention window is expanded.

11. The device of claim 10, wherein increasing the size of the contention window exponentially comprises calculating a new size of the contention window as:

CW_i=eCW_i-1, mod(i,n)=0(i≧

1)

wherein e is an exponential expansion constant.

12. The device of claim 10, wherein initializing the contention window comprises calculating the size of the contention window using an equation,

CW_i=CW_min, i=0,

wherein the CW_min is a minimum size of the contention window.

13. The device of claim 12, wherein the number of expansion resets is 3, the linear expansion constant is 2, and the exponential constant is 2, and the minimum size of the contention window is 8.

14. The device of claim 10, further comprising:

assessing whether the channel is to be idle in the contention window, and

transmitting, when the channel is assed to be idle in the contention window, the packet through the channel.