Dynamic channel sharing using bandwidth metrics

• US 7,965,671 B2
• Filed: 09/30/2008
• Issued: 06/21/2011
• Est. Priority Date: 10/01/2007
• Status: Active Grant

• Current Assignee: Raytheon Company (Rtx Corporation)
• Original Assignee: POWERWAVE COGNITION, INC.
• Inventors: Anderson, Arthur E., Kishaba, Wendell Y., Hughes, Timothy J.
• Primary Examiner(s): Yao, Kwang B
• Assistant Examiner(s): LOO, JUVENA W
• Application Number:
  US12/242,462
• Publication Number:
  US 20090116511A1
• Time in Patent Office: 994 Days
• Field of Search: 370/229, 370/230, 370/230.1, 370231-238, 370/351, 370/431, 370321-349
• US Class Current: 370/322
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04W 28/20 Negotiating bandwidth
• CPC Class Codes: H04W 72/20 Control channels or signalling for resource management
• CPC Class Codes: H04W 72/535 based on resource usage policies
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

In a Mobile Ad Hoc Network (MANET), each node calculates a bandwidth output value representative of data output requirements for the node relative to the transmit time slots available to the node. This value is shared with other nodes in the MANET and may be employed to more efficiently allocate channel usage among nodes as traffic demands and network topology change.

Claims

1. A method comprising:

determining a value indicative of a data output requirement for a node in an ad hoc network, the node having a plurality of one hop neighbors coupled in direct wireless communication with the node to form a neighborhood including as participants the node and the plurality of one hop neighbors;

determining a value indicative of a transmission capacity for the node;

calculating a bandwidth output metric for the node based upon the transmission capacity and the data output requirement;

communicating the bandwidth output metric to the plurality of one hop neighbors of the node;

receiving a corresponding bandwidth output metric from each one of the plurality of one hop neighbors of the node in an exchange of information whereby each one of the plurality of one hop neighbors share a common view with the node of all of the bandwidth output metrics for the neighborhood; and

determining network scheduling that allocates at least one time slot to each participant in the neighborhood, wherein the network scheduling is biased in favor of at least one of the plurality of nodes in the neighborhood based on the bandwidth output metric for the node and the corresponding bandwidth output metric from each one of the plurality of one hop neighbors of the node.

2. The method of claim 1 wherein the data output requirement is based upon a size of a number of data output queues.

3. The method of claim 2 further comprising adjusting the bandwidth output metric according to a change in the size of the number of data output queues.

4. The method of claim 1 wherein determining a value indicative of the transmission capacity includes negotiating for one or more channel access rights with at least one of the plurality of one hop neighbors.

5. The method of claim 1 wherein network scheduling includes determining one or more channel access rights using a fair access technique weighted according to the neighbor bandwidth output metric for each one of the plurality of one hop neighbors.

6. The method of claim 5 further comprising determining the transmission capacity for the node based upon the one or more channel access rights.

7. The method of claim 1 further comprising retransmitting the neighbor bandwidth output metric to each one of the plurality of one hop neighbors.

8. The method of claim 1 further comprising transmitting the bandwidth output metric for the node to each one of the plurality of one hop neighbors.

16. The method of claim 1 wherein the neighborhood includes a plurality of two hop neighbors of the node.

9. A computer program product comprising computer executable code embodied in a non-transitory computer readable medium that, when executing on one or more computing devices, performs the steps of:

determining a value indicative of a data output requirement for a node in an ad hoc network, the node having a plurality of one hop neighbors coupled in direct wireless communication with the node to form a neighborhood including as participants the node and the plurality of one hop neighbors;

determining a value indicative of a transmission capacity for the node;

calculating a bandwidth output metric for the node based upon the transmission capacity and the data output requirement;

communicating the bandwidth output metric to the plurality of one hop neighbors of the node;

receiving a corresponding bandwidth output metric from each one of the plurality of one hop neighbors of the node in an exchange of information whereby each one of the plurality of one hop neighbors share a common view with the node of all of the bandwidth output metrics for the neighborhood; and

determining network scheduling that allocates at least one time slot to each participant in the neighborhood, wherein the network scheduling is biased in favor of at least one of the plurality of nodes in the neighborhood based on the bandwidth output metric for the node and the corresponding bandwidth output metric from each one of the plurality of one hop neighbors of the node.

10. The computer program product of claim 9 wherein the data output requirement is based upon a size of a number of data output queues.

11. The computer program product of claim 10 further comprising code that performs the step of adjusting the bandwidth output metric according to a change in the size of the number of data output queues.

12. The computer program product of claim 9 wherein determining a value indicative of the transmission capacity includes negotiating for one or more channel access rights with at least one of the plurality of one hop neighbors.

13. The computer program product of claim 9 wherein network scheduling includes determining one or more channel access rights for the node based upon the neighbor bandwidth output metric from each one of the plurality of one hop neighbors.

14. The computer program product of claim 13 further comprising code that performs the step of determining one or more channel access rights using a fair access technique weighted according to the neighbor bandwidth output metric for each one of the plurality of one hop neighbors.

17. The computer program product of claim 9 wherein the neighborhood includes a plurality of two hop neighbors of the node.

15. A device comprising:

a data queue that stores data;

a data link that packetizes data from the data queue into packets, and that negotiates access to a number of time slots in a mobile ad hoc network;

a radio that provides an air interface to the mobile ad hoc network and transmits the packets during the one or more time slots; and

a signal processor that calculates a bandwidth output value for the device, the bandwidth output value representing a size of the data queue relative to the number of time slots, and that transmits the bandwidth output value to one or more neighboring nodes during a control time slot, the signal processor further configured to receive a corresponding bandwidth output metric from each the one or more neighboring nodes and to determine network scheduling that allocates at least one time slot to each participant in a neighborhood that includes the device and the one or more neighboring nodes, wherein the network scheduling is biased in favor of at least one of the plurality of nodes in the neighborhood based on the bandwidth output metric for the node and the corresponding bandwidth output metric from each of the one or more neighboring nodes.

18. The device of claim 15 wherein the neighborhood includes a plurality of two hop neighbors of the node.