Abstract
We present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) of user transmission rates and also present a simple modification of it to limit the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates in such a way that the user whose rate is high enough but least probable to become higher is selected. It turns out that the cdf-based scheduling algorithm is equivalent to a scheduling algorithm that regards the user rates as independent identically distributed (i.i.d.) and the average throughput of a user is independent of other users' probability distribution. A distinctive feature of this proposed algorithm is that the exact user throughput can be evaluated if the user's own distribution is known. The cdf-based scheduling with starving-time limitation (CS-STL) algorithm turns out not to affect the average inter-service time but to limit the maximum starving time at the cost of a negligible throughput loss.
| Original language | English |
|---|---|
| Pages | 528-532 |
| Number of pages | 5 |
| State | Published - 2003 |
| Externally published | Yes |
| Event | IEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States Duration: 1 Dec 2003 → 5 Dec 2003 |
Conference
| Conference | IEEE Global Telecommunications Conference GLOBECOM'03 |
|---|---|
| Country/Territory | United States |
| City | San Francisco, CA |
| Period | 1/12/03 → 5/12/03 |
Keywords
- Inter-service time
- Multiuser Diversity
- Starving time
- Wireless scheduling