Abstract
This paper designs a down-link resource scheduling algorithm for wireless cellular networks to achieve throughput-delay trade-off. The available bandwidth of the down-link is divided into some parallel sub-channels, and each sub-channel can be allocated to one potential user in every time-slot. This problem is modeled as a multi-user multi-server discrete-time queuing system with a time-varying connectivity. For this system, it is well-known that the classical MaxWeight algorithm has the optimal throughput, but its delay performance is very poor. To overcome this issue, we use the Lyapunov Optimization technique to design a throughput-utility maximizing algorithm that provides a good trade-off between the throughput and delay performance. Our approach is verified by both theoretical analysis and simulation evaluations.
| Original language | English |
|---|---|
| Pages (from-to) | 681-694 |
| Number of pages | 14 |
| Journal | Wireless Personal Communications |
| Volume | 92 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jan 2017 |
Keywords
- Lyapunov optimization
- Scheduling
- Utility maximization
Fingerprint
Dive into the research topics of 'Throughput-Delay Trade-off Scheduling in Multi-channel Downlink Wireless Networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver