Method of uplink scheduling for data communication
View Patent ↗A method of scheduling data communication over an uplink. The method enables two or more users seeking to transmit data over the uplink to be scheduled in response to their path loss. The user having the most attractive determined path loss among the two or more users seeking to transmit data over the uplink us scheduled first. Thereafter, the next user having the next most attractive path loss among the remaining users may be subsequently scheduled if the total noise rise leftover is greater than zero. This process repeats so long as or until the total noise rise leftover is about zero.
1. A method comprising:
scheduling at least one of a plurality of users for transmitting data over an uplink based on a noise rise leftover associated with each user, wherein the users are prioritized by their path loss such that the user of the plurality with the least path loss is scheduled for transmitting data first, and wherein the user with the next least path loss is scheduled after the user with the least path loss if the noise rise leftover associated with the user with the next least path loss is greater than zero.
2. The method of claim 1 ,
wherein the users are prioritized in response to a ratio of a channel transmission rate to a throughput and/or a monotonically increasing function of the throughput for each user such that the user of the plurality with the largest ratio is scheduled first.
3. The method of claim 2 , wherein another user with the next largest ratio is scheduled after the user with the largest ratio.
4. The method of claim 2 , wherein the channel transmission rate of each user is determined from at least one variable selected from the group comprising channel bandwidth (w), instantaneous path loss (hi), maximum transmit power (P) and total interference (IT).
5. The method of claim 4 , wherein each channel transmission rate is calculated by a mathematical expression of w*log (1+ i *P) or a mathematical expression of w*log (1+ i *P[P/I T ]).
6. A method comprising:
scheduling at least one of a plurality of users for transmitting data over an uplink based on a noise rise leftover associated with each user, wherein the users are prioritized in response to deadlines for each user such that the user of the plurality with the earliest deadline is scheduled first.
7. The method of claim 6 , wherein the user with the next earliest deadline is scheduled after the user with the earliest deadline.
8. The method of claim 7 , wherein the deadline for each user is determined from at least one variable selected from the group comprising normalized delay (S(t)), request size (J i ) for the data to be transmitted over the uplink, channel transmission rate (R i ), arrival time (ai) of a request for transmitting the data over the uplink, and total interference (I T ).
9. The method of claim 8 , wherein each deadline is calculated by a mathematical expression of S(t)*[J i /R i ]+a i , and each channel transmission rate (R i ) is determined from a channel bandwidth (w), an instantaneous path loss (hi) and a, maximum transmit power (P) by a mathematical expression of w*log (1+ i *P) or a mathematical expression of w*log (1+ 1[P/I T ]).
10. The method of claim 6 ,
wherein the data transmissions are prioritized by their path loss such that the data transmission of the plurality with the least path loss is scheduled first.
11. A method comprising:
scheduling at least one of a plurality of data transmissions for reception over an uplink based on a noise rise leftover associated with each data transmission, wherein the data transmissions are prioritized by their path loss such that the data transmission of the plurality with the least path loss is scheduled first, and wherein the data transmission with the next least path loss is scheduled after the data transmission with the least path loss if the noise rise leftover associated with the data transmission with the next least path loss is greater than zero.
12. The method of claim 11 ,
wherein the data transmissions are prioritized in response to a ratio of a channel transmission rate to a throughput for each data transmission such that the data transmission of the plurality with the largest ratio is scheduled first.
13. The method of claim 12 , wherein the data transmission with next largest ratio is scheduled after the data transmission with the largest ratio.
14. The method of claim 12 , wherein the channel transmission rate of each data transmission is determined from at least one variable selected from the group comprising channel bandwidth (w), instantaneous path loss (h i ), maximum transmit power (P) and total interference (I T ).
15. The method of claim 14 , wherein each channel transmission rate is calculated by a mathematical expression of w*log (1+ i *P) or a mathematical expression of w*log (1+ i *[P/I T ]).
16. A method comprising:
scheduling at least one of a plurality of data transmissions for reception over an uplink based on a noise rise leftover associated with each data transmission, wherein the data transmissions are prioritized in response to deadlines for each data transmission such that the data transmission of the plurality with the earliest deadline is scheduled first.
17. The method of claim 16 , wherein the data transmission with the next earliest deadline is scheduled after the data transmission with the earliest deadline.
18. The method of claim 16 , wherein the deadline for each data transmission is determined from at least one variable selected from the group comprising normalized delay (S(t)), request size (J i ) for the data to be transmitted over the uplink, channel transmission rate (R i ), and arrival time (a i ) of a request for transmitting the data over the uplink.
19. The method of claim 18 , wherein the deadline of each uplink data transmission is calculated by a mathematical expression of S(t)*[J i /R i ]+a i , and each channel transmission rate (R i ) is determined from a channel bandwidth (w), an instantaneous path loss (h i )′ a maximum transmit power (P) and total interference (I T ) by a mathematical expression of w*log (1+ i *P) or a mathematical expression of w*log (1+ i *[P/I T ]).