Scheduling data transmission in a wireless communications network

• US 20060002364A1
• Filed: 09/17/2004
• Published: 01/05/2006
• Est. Priority Date: 06/30/2004
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: Westphal, Cedric
• Granted Patent: US 7,162,249 B2
• Time in Patent Office: Days
• US Class Current: 370/346
• CPC Class Codes: H04W 28/22 Negotiating communication rate
• CPC Class Codes: H04W 72/543 based on requested quality, e.g. QoS

Abstract

A method of scheduling data transmission between a plurality of nodes in a wireless communication network, the method comprising: defining a plurality of rate bins each defined by a quantile index; receiving transmission requests from said nodes, said requests each defining a data rate; assigning a value to each request based on the rate defined in the request and the quantile indices of the rate bins; and effecting a scheduling decision based on the value assigned to the request.

Claims

1. A method of scheduling data transmission between a plurality of nodes in a wireless communication network, the method comprising:

defining a plurality of rate bins, each rate bin being defined by a quantile index;

receiving transmission requests from said nodes, each of said requests defining a data rate;

assigning a value to each request based on the data rate defined in the request and the quantile indices of the rate bins; and

effecting a scheduling decision based on the value assigned to the request.

2. The method according to claim 1, wherein the node is a mobile user.

3. The method according to claim 1, wherein the node is an access point.

4. The method according to claim 1, comprising the step of transmitting data in successive time slots, wherein the scheduling decision selects which node to transmit data to in each time slot.

5. The method according to claim 4, wherein the scheduling decision ({circle around (9)}(t)) takes the form:

6. The method according to claim 1, wherein each rate bin has a size, all rate bins being of the same size.

7. The method according to claim 1, wherein each rate bin has a size, at least some of said rate bins having sizes different from other rate bins.

8. The method according to claim 1, wherein the assigned value is a linear function of the quantile index.

9. The method according to claim 1, wherein the assigned value is a non-linear function of the quantile index.

10. The method according to claim 1, wherein the step of defining the plurality of rate bins comprises using a bin update algorithm which uses rates defined in requests received over a preceding period of time.

11. The method according to claim 1, wherein the step of assigning the value comprises ascertaining with an exact probability in which rate bin the rate falls.

12. The method according to claim 1, which further comprises the step of transmitting data to one of said plurality of nodes selected in the scheduling decision over a channel for the selected node.

13. The method according to claim 12, wherein the channel is defined by a code for said node.

14. The method according to claim 13, wherein the channel is defined by a frequency for said node.

15. A network entity adapted for scheduling data transmission between a plurality of nodes in a wireless communication network, the network entity comprising:

means for defining a plurality of rate bins, each of said rate bins defined by a quantile index;

means for receiving transmission requests from said nodes, each of said requests defining a data rate;

means for assigning a value to each request based on the data rate defined in the request and the quantile indices of the rate bins; and

effecting a scheduling decision based on the value assigned to the request.

16. A network entity according to claim 15, comprising a store holding quantile indices and associated counts of data rates falling in said rate bins.