Method and apparatus for congestion relief within an ad-hoc communication system

• US 20060067257A1
• Filed: 09/28/2004
• Published: 03/30/2006
• Est. Priority Date: 09/28/2004
• Status: Active Grant

• Current Assignee: Google Technology Holdings LLC (Alphabet Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Bonta, Jeffrey D.
• Granted Patent: US 7,403,496 B2
• Time in Patent Office: Days
• US Class Current: 370/310
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: H04W 28/021 in wireless networks with changing topologies, e.g. ad-hoc networks self-organizing networks H04W84/18
• CPC Class Codes: H04W 28/0284 detecting congestion or overload during communication monitoring arrangements H04L43/00
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A network reconfiguration protocol is provided that is initiated by the congested communication node (300). When a node (300) determines it is a bottleneck node, it will then analyze complaints from other nodes to determine which nodes are being affected by the bottleneck. The congested node will request the reconfiguration of select neighboring communication nodes in the ad hoc network to use an alternate channel (e.g., frequency) for future communications. Because nodes experiencing poor transmission/reception due to a bottleneck node are reconfigured to operate on a different channel, congestion is greatly reduced.

Claims

1. A method for congestion relief within an ad-hoc communication system, the method comprising the steps of:

determining that congestion exists for data sent from a transmitting node to a first downstream node;

sending a message to the first downstream node indicating that the transmitting node is experiencing congestion; and

receiving a second message from the first downstream node directing the transmitting node to potentially switch frequencies, causing the transmitting node to route data through a second downstream node, bypassing the first downstream node.

2. The method of claim 1 wherein the step of determining that congestion exists for data sent from the transmitting node comprises the step of determining that a threshold is reached for outgoing buffered data.

3. The method of claim 1 wherein the step of sending the message to the first downstream node comprises the step of sending a CONGESTION_INQUIRY message to the first downstream node, wherein the CONGESTION_INQUIRY message comprises an identification of a desired destination node and/or Quality of Service (QOS) information describing latency requirements of delayed buffered data.

4. The method of claim 1 wherein the step of receiving the second message from the first downstream node directing the transmitting node to switch frequencies comprises the step of receiving a PATH_SWITCH message containing a time stamp to indicate when a channel switch should occur.

5. The method of claim 1 wherein the step of receiving the second message from the first downstream node directing the transmitting node to switch frequencies comprises the step of receiving a PATH_SWITCH message containing a time stamp to indicate when a channel switch should occur and a communication route of IP addresses that skips the first downstream node.

6. The method of claim 1 wherein the step of receiving the second message from the first downstream node directing the transmitting node to switch frequencies comprises the step of receiving a PATH_SWITCH message containing a time stamp to indicate when a channel switch should occur, a communication route of IP addresses that skips the first downstream node, and an RF channel that should be used.

7. The method of claim 1 further comprising the step of:

routing data through the second downstream node.

8. The method of claim 1 further comprising the steps of:

determining if transmitting node can successfully bypass the downstream node by trying to directly communicate with a next node in a communication route received in the second message.

9. A method for performing congestion relief within an ad-hoc communication system, the method comprising the steps of:

receiving, at a receiving node, a message from an upstream node that the upstream node is experiencing congestion;

determining if the receiving node is experiencing congestion; and

if the receiving node is experiencing congestion, sending the message to a downstream node, otherwise performing congestion relief for the upstream node.

10. The method of claim 9 wherein the step of receiving the message comprises the step of receiving a CONGESTION_INQUIRY message from the upstream node, wherein the CONGESTION_INQUIRY message comprises an indication of a desired destination node and/or Quality of Service (QOS) information describing latency requirements of delayed buffered data.

11. The method of claim 9 wherein the step of determining if the receiving node is experiencing congestion comprises the step of determining that a threshold is reached for outgoing buffered data.

12. The method of claim 9 wherein the step of performing congestion relief for the upstream node comprises the step of directing the upstream node to switch channels.

13. The method of claim 9 wherein the step of performing congestion relief for the upstream node comprises the step of directing the upstream node to switch RF channels.

14. The method of claim 9 wherein the step of performing congestion relief for the upstream node comprises the step of sending a PATH_SWITCH message containing a time stamp to indicate when a channel switch should occur, a communication route of IP addresses that skips the receiving node, and an RF channel that should be used.

15. An apparatus comprising:

logic circuitry determining that congestion exists for data sent from a transmitting node to a first downstream node;

a transmitter sending a message to the first downstream node indicating that the transmitting node is experiencing congestion; and

receiving circuitry receiving a second message from the first downstream node directing the transmitting node to potentially switch frequencies, causing the transmitting node to route data through a second downstream node, bypassing the first downstream node.

16. The apparatus of claim 15 wherein the logic circuitry determines that congestion exists by determining that a threshold is reached for outgoing buffered data.

17. The apparatus of claim 15 wherein the second message comprises an identification of a desired destination node and/or Quality of Service (QOS) information describing latency requirements of delayed buffered data.

18. A receiving node comprising:

a receiver receiving a first message from an upstream node that the upstream node is experiencing congestion;

logic circuitry determining if the receiving node is experiencing congestion; and

a transmitter sending the first message to a downstream node if the receiving node is experiencing congestion otherwise sending a second message to the upstream node directing the upstream node to change channels.

19. The apparatus of claim 18 wherein the first message comprises an indication of a desired destination node and/or Quality of Service (QOS) information describing latency requirements of delayed buffered data.

20. The apparatus of claim 18 wherein the logic unit determines if the receiving node is experiencing congestion by determining that a threshold is reached for outgoing buffered data.