论文标题
使用Whittle索引理论在无线网络中进行计划
Scheduling in Wireless Networks using Whittle Index Theory
论文作者
论文摘要
我们考虑在无线用户网络中安排数据包传输的问题，同时最大程度地减少消耗的能量和传输延迟。一个挑战是，彼此互相干扰的用户的传输，而相距遥远的用户可以同时发送而不会太多干扰。每个用户都有一组数据包，这些数据包在单个通道上传输，并且相互非干扰用户重复使用频谱。使用Whittle索引理论以最大程度地减少不安的土匪的成本，我们设计了四个基于指数的策略，并将其表现与众所周知的策略进行比较：闲聊的Aloha，最大的重量调度，Lyapunov Drift，Cella和Cesa Bianchi算法以及两份基于Whittle Index的policies来自最近出版的Paper frol a Ploply Pappared Paperforme。我们将代码用于公开执行我们的模拟，以便可以将其用于整个研究社区的未来工作。
We consider the problem of scheduling packet transmissions in a wireless network of users while minimizing the energy consumed and the transmission delay. A challenge is that transmissions of users that are close to each other mutually interfere, while users that are far apart can transmit simultaneously without much interference. Each user has a queue of packets that are transmitted on a single channel and mutually non interfering users reuse the spectrum. Using the theory of Whittle index for cost minimizing restless bandits, we design four index-based policies and compare their performance with that of the well-known policies: Slotted ALOHA, maximum weight scheduling, quadratic Lyapunov drift, Cella and Cesa Bianchi algorithm, and two Whittle index based policies from a recently published paper. We make the code used to perform our simulations publicly available, so that it can be used for future work by the research community at large.
