Abstract
We consider the problem of quality of service (QoS) provisioning for K users sharing a downlink time-slotted fading channel. We develop simple and efficient schemes for admission control, resource allocation, and scheduling, which can yield substantial capacity gain. The efficiency is achieved by virtue of recently identified multiuser diversity. A unique feature of our work is explicit provisioning of statistical QoS, which is characterized by a data rate, delay bound, and delay-bound violation probability triplet. The results show that compared with a fixed-slot assignment scheme, our approach can substantially increase the statistical delay-constrained capacity of a fading channel (i.e., the maximum data rate achievable with the delay-bound violation probability satisfied), when delay requirements are not very tight, while yet guaranteeing QoS at any delay requirement. © 2005 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 1198-1206 |
| Journal | IEEE Transactions on Vehicular Technology |
| Volume | 54 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - May 2005 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Effective capacity
- Fading
- Multiuser diversity
- Quality of service (QoS)
- Resource allocation
- Scheduling