密集mmWave网络中的用户关联
User Association in Dense mmWave Networks as Restless Bandits
摘要：
我们研究了用户关联问题，即，在密集毫米波（mmWave）网络中，确定用户应当与哪个基站（BS）相关联。在我们的系统模型中，在每个时隙中，用户以一定的概率到达由密集毫米波网络服务的相对较小的地理区域。我们的目标是设计一个关联策略，在每个时隙中，用户到达，它被分配到一个BS，以便最大限度地减少用户在系统中花费的时间的加权平均量。上面的问题是一个不安分的多臂强盗问题，并且可以证明很难解决。我们证明了这个问题是Whittle指数，并基于这个结果，提出了一个关联策略下，到达用户与BS具有最小的Whittle指数。使用模拟，我们表明，我们提出的政策优于几个用户关联政策提出了在以前的工作。
英文摘要：
We study the problem of user association, i.e., determining which base station (BS) a user should associate with, in a dense millimeter wave (mmWave) network. In our system model, in each time slot, a user arrives with some probability in a region with a relatively small geographical area served by a dense mmWave network. Our goal is to devise an association policy under which, in each time slot in which a user arrives, it is assigned to exactly one BS so as to minimize the weighted average amount of time that users spend in the system. The above problem is a restless multi-armed bandit problem and is provably hard to solve. We prove that the problem is Whittle indexable, and based on this result, propose an association policy under which an arriving user is associated with the BS having the smallest Whittle index. Using simulations, we show that our proposed policy outperforms several user association policies proposed in prior work.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
