Name
Abstract | ||
|---|---|---|
The problem of scheduling delay insensitive data over a direct sequence code-division multiple-access downlink fading channel is considered. This work considers the case where only one user at a time is allowed to transmit. As the channels can be considered to vary asynchronously among the users, multiuser diversity gains can be obtained by exploiting channel adaptive scheduling. For this, schedulers of different adaptation rate are suggested and compared. In particular, the authors analyze a simple fast scheduler that schedules a user to transmit when its channel is good relative to its mean. This scheduler is resource fair in the sense it can provide the users with the same asymptotic channel access. They show that the achievable scheduling gain compared to round robin is equal to the gain of a selection diversity scheme. The scheduling gain is determined, both on closed-form and by numerical integration, for several scenarios, including multicellular systems and the effect of time delayed channel estimates. The results show that the scheduling gain is larger for channels with low average quality. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TWC.2003.821147 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
Rayleigh channels,adaptive scheduling,cellular radio,channel estimation,code division multiple access,delays,diversity reception,fading channels,multiuser channels,packet radio networks,radio links,spread spectrum communication,DS-CDMA downlink fading channel,Rayleigh fading channels,asymptotic channel access,channel adaptive scheduler,channel adaptive scheduling,delay insensitive data,direct sequence code division multiple access,fair transmission scheduling,high data rates,high-speed downlink packet access,multicellular systems,multiuser diversity gains,numerical integration,scheduling gain,slow schedulers,time delayed channel estimates | Fair-share scheduling,Scheduling (computing),Gain scheduling,Fading,Computer network,Rate-monotonic scheduling,Dynamic priority scheduling,Mathematics,Proportionally fair,Round-robin scheduling | Journal |
Volume | Issue | ISSN |
3 | 1 | 1536-1276 |
Citations | PageRank | References |
62 | 4.22 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fredrik Berggren | 1 | 292 | 28.16 |
| R. Jantti | 2 | 230 | 19.06 |