Power-Aware Wireless File Downloading: A Lyapunov Indexing Approach to a Constrained Restless Bandit Problem
Power-Aware Wireless File Downloading: A Lyapunov Indexing Approach to a Constrained Restless Bandit Problem
复制标题
功率感知无线文件下载：解决受限不安强强盗问题的 Lyapunov 索引方法
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
M. Neely
中科院分区：
文献类型：
--
作者：
Xiaohan Wei;M. Neely
本文讨论了多用户文件下载系统中的功耗感知吞吐量最大化。每个用户只有在完成前一个文件后才能收到新文件。每个用户的文件状态进程充当耦合的马尔可夫链，形成广义的不安分强盗系统。首先，针对一个用户的情况导出最佳算法。该算法在平均功率约束下最大化吞吐量。接下来，将单用户算法扩展到多用户问题的低复杂度启发式算法。该启发式使用简单的在线索引策略。在没有功率约束的特殊情况下，多用户启发式方法被证明是吞吐量最优的。模拟用于证明启发式方法在一般情况下的有效性。对于可以离线计算最佳解决方案的简单情况，启发式方法对于各种参数来说都接近最佳。
This paper treats power-aware throughput maximization in a multiuser file downloading system. Each user can receive a new file only after its previous file is finished. The file state processes for each user act as coupled Markov chains that form a generalized restless bandit system. First, an optimal algorithm is derived for the case of one user. The algorithm maximizes throughput subject to an average power constraint. Next, the one-user algorithm is extended to a low-complexity heuristic for the multiuser problem. The heuristic uses a simple online index policy. In a special case with no power-constraint, the multiuser heuristic is shown to be throughput-optimal. Simulations are used to demonstrate effectiveness of the heuristic in the general case. For simple cases where the optimal solution can be computed offline, the heuristic is shown to be near-optimal for a wide range of parameters.