METHOD FOR ROUTING MESSAGE IN WIRELESS NETWORK BASED ON RELAY PROBABILITY

• US 20090141667A1
• Filed: 08/04/2008
• Published: 06/04/2009
• Est. Priority Date: 11/30/2007
• Status: Abandoned Application

• Current Assignee: Electronics and Telecommunications Research Institute, Industry Academic Cooperation Foundation, Yonsei University Industry-Academic Telecommunications Research Institute,
• Original Assignee: Electronics and Telecommunications Research Institute, Industry Academic Cooperation Foundation
• Inventors: Jin, Gwang Ja, Kim, Dong Min, Kim, Seong Lyun, Hwang, Young Ju, Kim, Bong Soo, Pyo, Cheol Sig, Chae, Jong Suk
• Application Number:
  US12/185,506
• Publication Number:
  US 20090141667A1
• Time in Patent Office: Days
• US Class Current: 370/315
• CPC Class Codes: H04B 7/2606 Arrangements for base station coverage control, e.g. by using relays in tunnels

Abstract

Provided is a method for routing a message in a wireless network based on relay probability. The method allows dynamic delivery of a message by calculating the relay probability of each node for message transmission, measuring the strength of a beacon signal received from a destination node, and determining a node that will relay a message based on the relay probability and the strength of beacon signal.

Claims

1. A method for delivering a message from a transmission node to a destination node within a wireless network, the method comprising:

transmitting RTS (Request-to-Send) signals to neighboring nodes;

receiving response signals to the RTS signals from neighboring nodes that have determined to send the response signals based on their relay probability; and

determining one of the neighboring nodes that transmitted the response signals as a relay node.

2. The method of claim 1, wherein the determining of one of the neighboring nodes as a relay node comprises:

comparing the strengths of beacon signals contained in the response signals, which the respective neighboring nodes calculate after receiving the beacon signals from the destination node; and

determining a neighboring node with the largest beacon signal strength as a relay node.

3. The method of claim 2, further comprising, if the strength of a beacon signal calculated by the transmission node is greater than the strengths of beacon signals calculated by the neighboring nodes, transmitting the message directly to the destination node.

4. The method of claim 1, further comprising, unless receiving the response signals from the neighboring nodes, transmitting the message directly to the destination node.

5. The method of claim 1, further comprising, unless receiving an acknowledgement (ACK) after transmitting a message via the relay node or directly to the destination node, retransmitting the message using BEB (Binary Exponential Backoff).

6. A method for delivering a message from a transmission node to a destination node within a wireless network, the method comprising:

determining in a relay node that has received a message from the transmission node whether an address of the relay node is equal to an address of the destination node;

terminating transmission of the message if the address of the relay node is equal to the address of the destination node;

transmitting RTS (Request-to-Send) signals to neighboring nodes if the address of the relay node is not equal to the address of the destination node;

receiving response signals to the RTS signals from neighboring nodes that have determined to send the response signals based on their relay probability; and

determining one of the neighboring nodes that transmitted the response signals as a next relay node.

7. The method of claim 6, wherein the determining of one of the neighboring nodes as a next relay node comprises:

comparing the strengths of beacon signals contained in the response signals, which the respective neighboring nodes calculate after receiving the beacon signals from the destination node; and

determining a neighboring node with the largest beacon signal strength as a next relay node.

8. The method of claim 7, further comprising if the strength of a beacon signal calculated by the relay node is greater than the strengths of beacon signals calculated by the neighboring nodes, transmitting the message directly to the destination node.

9. The method of claim 6, further comprising, unless receiving the response signals from the neighboring nodes, transmitting the message directly to the destination node.

10. The method of claim 6, further comprising, unless receiving an acknowledgment (ACK) after transmitting a message to the next relay node or the destination node, retransmitting the message using BEB (Binary Exponential Backoff).

11. The method of claim 6, wherein if the number of hops of the node which is received the message exceeds a preset hop count, a next relay node is determined among nodes except the nodes that transmitted the message.