A wireless scheduling algorithm selects a user which the BS transmits the information to or receives from. Examples of wireless scheduling algorithms are round-robin and max C/I schemes, where the former is a temporally rotating algorithm proving a high fairness opportunity for each scheduled users and the later is a non-fair algorithm to find the best user in terms of instantaneous throughput performance. Another algorithm is Proportional fair scheduling which select users with respect to the instant rate divided its average rate, resulting that the performance is higher than the round robin scheme with the same opportunity chance to allocate in a time slot.
- The round-robin scheduling selects a user rotationally without considering channel status of users. If the instantly poorest channel user is selected, the performance of a wireless network will be seriously suffered. We avoid such bad cases using a wireless channel property that the signal is fluctuated time by time proportional to the Doppler frequency.
- The max C/I scheduling finds a user which maximize the system throughput instantly. Because users with low average SNR will not be served any data until the SNR of a user in the poor channel group becomes highest, the fairness of the system is often unachievable.
- The proportional fair scheduling finds a user with similar criterion with max C/I scheduling subject to the temporally identical fairness for every scheduled users.