摘要
Scheduling periodic real-time traffic in wireless networks is challenging due to the unreliable wireless channels. We first formulate the scheduling problem as a restless multiarmed bandit (RMAB) problem. Then, we theoretically prove the indexability of the scheduling problem. Based on the indexability, we further derive the closed-form Whittle's index. It motivates us to propose a simple index-based scheduling algorithm which schedules users with higher indices. Simulation results have demonstrated that the derived scheduling algorithm outperforms the earliest deadline first (EDF) and myopic algorithms in terms of the total discounted reward.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1129-1132 |
| 页数 | 4 |
| 期刊 | IEEE Wireless Communications Letters |
| 卷 | 8 |
| 期 | 4 |
| DOI | |
| 出版状态 | 已出版 - 8月 2019 |
基金资助
This work was supported by the China Post-Doctoral Science Fund under Grant 2017M612503. The associate editor coordinating the review of this paper and approving it for publication was D. Tarchi.
关键词
- Periodic traffic
- unreliable network
- real-time scheduling
- restless multi-armed bandit
收录
- EI
- Scopus
- SCIE
学术指纹
探究 'Scheduling Periodic Real-Time Traffic in Lossy Wireless Networks as Restless Multi-Armed Bandit' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver