IP Library › Granted Patent US 8,300,538
Granted Patent B2
US 8,300,538 · App. 12/610,976 · Granted Oct 30, 2012

Method and system for setting routing path considering hidden node and carrier sense interference, and recording medium thereof

Assignee: KAIST (Korea Advanced Institute of Science and Technology)
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,300,538
App. No.
12/610,976
Granted
Oct 30, 2012
Kind
B2
Abstract

A method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network including plural nodes and plural links for connecting two nodes with each other. The method includes calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node. The method further includes calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path. The method further includes calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.

Claims (68)

1. A method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network consisting of plural nodes and plural links for connecting two nodes with each other, comprising:

calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node;

calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path, wherein the hidden node weight is calculated by expected collision numbers due to all hidden links affecting the specific link in the path and the packet transmission time over the specific link, and the expected collision number is the number of transmissions of a packet due to collisions with the hidden node according to a hidden node collision (HNCOL) analytical model; and

calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.

2. The method according to claim 1 ,

wherein the carrier sense interference weight represents the carrier sense interference among links in a path using the same shared channel or in adjacent paths, and

wherein the hidden node weight represents hidden node problems caused by the links in the same path or adjacent paths.

3. The method according to claim 1 , wherein the wireless multi-hop network includes nodes with multiple heterogeneous radio transceivers to each of which is assigned a different channel.

4. The method according to claim 1 , wherein the carrier sense interference weight is calculated by packet transmission time on the specific link in the path and packet retransmission number over the link.

5. The method according to claim 4 , wherein the packet transmission time is calculated by using a fixed packet size, a pre-assigned raw link bandwidth, and MAC layer protocol inter-frame spacing and control packets.

6. The method according to claim 4 , wherein the packet retransmission number is calculated by using weighted forward and reverse delivery ratios along time over the specific link, and wherein the weighted forward and reverse delivery ratios are calculated by applying the exponential weighted averaging technique to two successive delivery ratios.

7. The method according to claim 1 ,

wherein the hidden node weight is calculated by using the probability of having a collision with the hidden node, and

wherein the probability of a collision with the hidden node is calculated by Equation 1 as follows:

Prob

⁡

(

HNCOL

AB

)

=

Data_pkt

⁢

_TT

AB

VP

(

1

)

where A and B are nodes, VP is a period for which a hidden node collision may occur in link A-B, and Data_pkt_TT is data packet transmission time.

8. The method according to claim 1 , wherein, considering that the total estimated packet transmission time due to carrier sense interference effect in the path p is WCEPTT_CS, the total estimated packet transmission time due to hidden node is CEPTT_HN, and WCEPTT_CS and CEPTT_HN are combined using the exponential moving averaging technique with a smoothing factor β, the total data transmission time is calculated by Equation 2 as follows:

HIAM=β*WCEPTT_CS p +(1−β)*CEPTT_HN p   (2).

9. The method according to claim 8 , further comprising updating a routing table based on a value of HIAM.

10. A non-transitory recording medium having embodied therein a computer program for the method of claim 1 .

11. The method according to claim 1 , further comprising updating an Indirect_Neighbors_Table based on the HNCOL.

12. A system of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network consisting of plural nodes and plural links for connecting two nodes with each other, comprising:

a processor configured to calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node;

the processor configured to calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path; and

the processor configured to calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path,

wherein the wireless multi-hop network includes nodes with multiple heterogeneous radio transceivers to each of which is assigned a different channel,

wherein the hidden node weight is calculated by expected collision numbers due to all hidden links affecting the specific link in the path and the packet transmission time over the specific link, the expected collision number is the number of transmissions of a packet due to collisions with the hidden node according to a hidden node collision (HNCOL) analytical model.

13. The system according to claim 12 ,

wherein the carrier sense interference weight represents the carrier sense interference among links in a path using the same shared channel or in adjacent paths, and

wherein the hidden node weight represents hidden node problems caused by the links in the same path or adjacent paths.

14. The system according to claim 12 , wherein the carrier sense interference weight is calculated by packet transmission time on the specific link in the path and packet retransmission number over the link.

15. The system according to claim 14 , wherein the packet transmission time is calculated by using a fixed packet size, a pre-assigned raw link bandwidth, and MAC layer protocol inter-frame interval and control packets.

16. The system according to claim 14 , wherein the packet retransmission number is calculated by using weighted forward and reverse delivery ratios along time over the specific link, and wherein the modified forward and reverse delivery ratios are calculated by applying exponential weighted averaging techniques to two successive delivery ratios.

17. The system according to claim 12 , wherein, considering that the total estimated packet transmission time due to carrier sense interference effect in the path p is WCEPTT_CS, the total estimated packet transmission time due to hidden node is CEPTT_HN, and WCEPTT_CS and CEPTT_HN are combined using the exponential moving averaging technique with a smoothing factor β, the total data transmission time is calculated by Equation 3 as follows:

HIAM=β*WCEPTT_CS p +(1−β)*CEPTT_HN p   (3).

18. The system according to claim 12 ,

wherein the hidden node weight is calculated by using the probability of having a collision with the hidden node, and

wherein the probability of a collision with the hidden node is calculated by Equation 1 as follows:

Prob

⁡

(

HNCOL

AB

)

=

Data_pkt

⁢

_TT

AB

VP

(

1

)

where A and B are nodes, VP is a period for which a hidden node collision may occur in link A-B, and Data_pkt_TT is data packet transmission time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 2, 2009
From: KIM, MYUNGCHUL; KANG, SUNGWON; MOHAMMAD, HAMMASH DEEMA AHMAD
To: KAIST(KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY)
Reel/Frame 023458/0505 →
Priority Claims (1)
KR 10-2009-0091469 · Sep 28, 2009 · national
Continuity (1)
Related Publication 20110075578A1 · Mar 31, 2011