Cross-layer routing method in wireless sensor network

• US 8,102,794 B2
• Filed: 08/18/2008
• Issued: 01/24/2012
• Est. Priority Date: 12/10/2007
• Status: Expired due to Fees

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Shin, Chang Sub, Kim, Bong Soo, Pyo, Cheol Sig, Chae, Jong Suk, Lim, Hyuk, Jang, In Hyeok, Kim, Hyo Joo
• Primary Examiner(s): Mui, Gary
• Application Number:
  US12/193,181
• Publication Number:
  US 20090147725A1
• Time in Patent Office: 1,254 Days
• Field of Search: 370229-238, 370/226, 370/243, 370/492, 370/501, 370/246, 370/315
• US Class Current: 370/315
• CPC Class Codes: H04B 7/155 Ground-based stations H04B7/204 takes precedence
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Abstract

Provided is a cross-layer routing method in a wireless sensor network including: locating a destination node which is a final destination of data by a source node which generates the data; and determining an optimal relay node among one or more neighboring nodes using their position information for each hop and forwarding the data from the source node to the destination node through the determined relay nodes. Therefore, an effective and stable routing which reduces overheads of additional control messages used for stable data forwarding and reduces collisions in a shared channel by using wireless link layer characteristics can be implemented.

Claims

1. A cross-layer routing method in a wireless sensor network comprising:

locating a destination node which is a final destination of data by a source node which generates the data; and

determining an optimal relay node among one or more neighboring nodes using their position information for each hop and forwarding the data from the source node to the destination node through the determined relay nodes,

wherein determining an optimal relay node and forwarding the data comprises;

broadcasting data by a sending node;

forwarding the data through broadcasting first by a node determined as a winner node from among neighboring nodes that receive the broadcasting of the sending node;

canceling data forwarding by nodes in a transmission range of the winner node after receiving the broadcasting of the winner node; and

canceling data forwarding of the neighboring nodes that do not cancel data forwarding, by the sending node after receiving the broadcasting of the winner node,

wherein forwarding the data through broadcasting first by a node determined as a winner node comprises;

waiting for data relaying by calculating contention windows according to priorities by the neighboring nodes; and

forwarding data through broadcasting first by a winner node that calculates the lowest contention window among the neighboring nodes, and

wherein the contention window value includes a progress obtained by projecting a distance between the sending node and a receiving node onto a straight line connecting the sending node to the destination node, the least distance between the receiving node and the straight line connecting the sending node to the destination node, a transmission range of the sending node, and the maximum contention window value of the receiving node.

2. The method of claim 1, wherein the data includes an identification number and coordinates of the source node, an identification number and coordinates of the sending node, an identification number and coordinates of the destination node, and an message identification number of the data.

3. The method of claim 1, wherein canceling data forwarding of the neighboring nodes that do not cancel data forwarding comprises:

broadcasting a suppression message for canceling data forwarding of the neighboring nodes by the sending node after receiving the broadcasting of the winner node; and

canceling data forwarding by neighboring nodes that do not cancel data, among the neighboring nodes that wait for data relaying, after receiving the suppression message.

4. The method of claim 1, wherein the contention window value CWF(r,d,p) is obtained by an equation

5. The method of claim 1, wherein canceling data forwarding of the neighboring nodes that do not cancel data forwarding comprises:

waiting for a distributed interframe space (DIFS) before data forwarding by a node that is outside the transmission range of the winner node and receives data broadcasting from the sending node; and

after the winner node completes the data forwarding, broadcasting a suppression message by the sending node after waiting for a short interframe space (SIFS).