We study the problem of scheduling packet transmissions with the aim of minimizing the energy consumption and data transmission delay of users in a wireless network in which spatial reuse of spectrum is employed. We approach this problem using the theory of Whittle index for cost minimizing restless bandits, which has been used to effectively solve problems in a variety of applications. We design two Whittle index based policies — the first by treating the graph representing the network as a clique and the second based on interference constraints derived from the original graph. We evaluate the performance of these two policies via extensive simulations, in terms of average cost and packets dropped, and show that they outperform the well-known Slotted ALOHA, maximum-weight scheduling, quadratic Lyapunov drift, and exponential Lyapunov drift algorithms, as well as an algorithm recently proposed by Cella and Cesa-Bianchi.

我们研究了调度分组传输的问题，目的是在采用频谱空间重用的无线网络中最小化用户的能量消耗和数据传输延迟。我们使用 Whittle 指数理论来解决这个问题，以最小化不安分的强盗，该理论已被用于有效解决各种应用中的问题。我们设计了两个基于 Whittle 索引的策略——第一个将表示网络的图视为一个集团，第二个基于从原始图派生的干扰约束。我们通过广泛的模拟评估这两种策略的性能，在平均成本和丢包方面，并表明它们优于众所周知的 Slotted ALOHA、最大权重调度、二次 Lyapunov 漂移、