Scheduling for autonomous dynamic spectrum access systems

• US 20080112428A1
• Filed: 11/10/2006
• Published: 05/15/2008
• Est. Priority Date: 11/10/2006
• Status: Abandoned Application

• Current Assignee: POWERWAVE COGNITION, INC.
• Original Assignee: POWERWAVE COGNITION, INC.
• Inventors: Seidel, Scott Y.
• Application Number:
  US11/595,716
• Publication Number:
  US 20080112428A1
• Time in Patent Office: Days
• US Class Current: 370/436
• CPC Class Codes: H04W 72/566 of the information or information source or recipient
• CPC Class Codes: H04W 72/569 of the traffic information
• CPC Class Codes: H04W 76/10 Connection setup
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 88/02 Terminal devices

Abstract

Scheduling communication between a first node and one or more neighbor nodes includes, at each of the first node and the one or more neighbor nodes determining a neighborhood of the one or more neighbor nodes; classifying each of the first node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot; and determining one or more links, wherein each link is defined by a pair of nodes and an associated bearer frequency, and wherein at least two of the links have different associated bearer frequencies; and scheduling one or more links for the time slot.

Claims

1. A method for scheduling communication between a first node and one or more neighbor nodes, comprising:

at each of the first node and the one or more neighbor nodes;

determining a neighborhood of the one or more neighbor nodes;

classifying each of the first node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot; and

determining one or more links, wherein each link is defined by a pair of nodes and an associated bearer frequency, and wherein at least two of the links have different associated bearer frequencies; and

scheduling one or more links for the time slot.

2. The method of claim 1, where determining a neighborhood of the one or more neighbor nodes comprises:

determining a two-hop network neighborhood of the one or more neighbor nodes.

3. The method of claim 1, where classifying each of the first node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot:

classifying each of the first node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot based, at least in part, on neighbor node information.

4. The method of claim 1, where scheduling one or more links for the time slot comprises:

prioritizing the one or more links; and

for each unique associated bearer frequency, choosing the link with a highest priority.

5. The method of claim 4, where prioritizing the one or more links comprises:

assigning a priority to each link based, at least in part, on a randomization function.

6. The method of claim 4, where prioritizing the one or more links comprises:

assigning a priority to each link based, at least in part, on neighbor node information.

7. The method of claim 6, where neighbor node information comprises one or more priority weighing factors associated with one or more messages that a neighbor node is attempting to send or receive, and where prioritizing the one or more links comprises:

weighing one or more links by one or more priority weighing factors.

8. The method of claim 6, where neighbor node information comprises one or more amounts of pending data for one or more links and one or more amounts of data previously send over one or more of the links, and where prioritizing the one or more links comprises:

weighing one or more links by one or more of the total amount of pending data for the link and the amount of data previously sent over the link.

9. The method of claim 1, further comprising:

sharing neighbor node information via an adaptive control channel.

10. A wireless node operable to communicate with one or more other mobile nodes, comprising:

an interface operable to;

send and receive signals; and

one or more processors configured to;

determine a neighborhood of the one or more other mobile nodes;

classify each of the wireless node and one or more of the other mobile nodes as one of a transmitting node or a receiving node for a time slot; and

determine one or more links, wherein each link is defined by a pair of nodes and an associated bearer frequency, and wherein at least two of the links have different associated bearer frequencies; and

schedule one or more links for the time slot.

11. The wireless node of claim 10, where when determining a neighborhood of the one or more other mobile nodes the one or more processors are further configured to:

determine a two-hop network neighborhood of the one or more other wireless nodes.

12. The wireless node of claim 10, where when classifying each of the wireless node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot the one or more processors are further configured to:

classify each of the wireless node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot based, at least in part, on neighbor node information.

13. The wireless node of claim 12, where neighbor node information comprises one or more amounts of pending data for one or more links and one or more amounts of data previously send over one or more of the links, and where when prioritizing the one or more links the one or more processors are further configured to:

weigh one or more links by one or more of the total amount of pending data for the link and the amount of data previously sent over the link.

14. The wireless node of claim 10, where when scheduling one or more links for the time slot the one or more processors are further configured to:

prioritize the one or more links; and

for each unique associated bearer frequency, choose the link with a highest priority.

15. The wireless node of claim 14, where when prioritizing the one or more links the one or more processors are further configured to:

assign a priority to each link based, at least in part, on a randomization function.

16. The wireless node of claim 14, where when prioritizing the one or more links the one or more processors are further configured to:

assign a priority to each link based, at least in part, on neighbor node information.

17. The wireless node of claim 16, where neighbor node information comprises one or more priority weighing factors associated with one or more messages that a neighbor node is attempting to send or receive, and where when prioritizing the one or more links the one or more processors are further configured to:

weigh one or more links by one or more priority weighing factors.

18. The wireless node of claim 16, where neighbor node information comprises one or more amounts of pending data for one or more links and one or more amounts of data previously send over one or more of the links, and where when prioritizing the one or more links the one or more processors are further configured to:

weigh one or more links by one or more of the total amount of pending data for the link and the amount of data previously sent over the link.

19. The wireless node of claim 10, wherein the one or more processors are further configured to:

share neighbor node information via an adaptive control channel.

20. A system for scheduling communications between a plurality of nodes, comprising:

means for determining a neighborhood of the one or more neighbor nodes;

means for classifying each of the first node and one or more of the neighbor nodes as one of a transmitting node or a receiving node for a time slot; and

means for determining one or more links, wherein each link is defined by a pair of nodes and an associated bearer frequency, and wherein at least two of the links have different associated bearer frequencies; and

means for scheduling one or more links for the time slot.