.png){kind=icon}
返回
A Stable Online Algorithm for Energy-Efficient Multiuser Scheduling
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2010.106.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the problem of energy-efficient uplink scheduling with delay constraint for a multiuser wireless system. We address this problem within the framework of constrained Markov decision processes (CMDPs) wherein one seeks to minimize one cost (average power) subject to a hard constraint on another (average delay). We do not assume the arrival and channel statistics to be known. To handle state-space explosion and informational constraints, we split the problem into individual CMDPs for the users, coupled through their Lagrange multipliers; and a user selection problem at the base station. To address the issue of unknown channel and arrival statistics, we propose a reinforcement learning algorithm. The users use this learning algorithm to determine the rate at which they wish to transmit in a slot and communicate this to the base station. The base station then schedules the user with the highest rate in a slot. We analyze convergence, stability, and optimality properties of the algorithm. We also demonstrate the efficacy of the algorithm through simulations within IEEE 802.16 system.
Keyword:
Multiuser fading channel
constrained Markov decision process
energy-efficient scheduling
learning algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
分享收藏Critical Evaluation and Thermodynamic Optimization of the Li2O-Al2O3 and Li2O-MgO-Al2O3 Systems
PREAI
分享收藏Susceptibility of different mouse strains to oxaliplatin peripheral neurotoxicity: Phenotypic and genotypic insights.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容