论文标题
可靠的蜂窝网络移交中可靠的匪徒政策
Bandit Policies for Reliable Cellular Network Handovers in Extreme Mobility
论文作者
论文摘要
极端用户移动性(例如在高速火车和车辆上)对无缝互联网访问的需求已成为一种规范,而不是例外。但是,4G/5G移动网络并不总是可靠地满足这一需求,并且在基站之间的交换过程中,不可忽略的故障。可靠性的一个基本挑战是平衡探索更多测量值,以使其令人满意的切换以及及时移交的剥削(在快速移动的用户离开服务基站的无线电覆盖范围之前)。本文将这种权衡在极端流动性中提出,作为两个截然不同的多臂匪徒问题的组成。我们建议强盗和阈值调整(Batt),以最大程度地减少极端机动性中移交失败的遗憾。 Batt使用$ε$ -Binary-Search来优化服务单元的信号强度的阈值,以使用$ \ Mathcal {o}(\ log j \ log t)$遗憾地启动移交过程,这进一步避免了机会性的汤普森采样,以优化目标细胞,以优化$ \ natercal $ \ o \ o \ o \ o \ o \ o \ o \ o \ o \ o \ of themance foremist formist。来自中国高速导轨的LTE数据集验证了大幅度的遗憾减少,减少了29.1%的切换故障。
The demand for seamless Internet access under extreme user mobility, such as on high-speed trains and vehicles, has become a norm rather than an exception. However, the 4G/5G mobile network is not always reliable to meet this demand, with non-negligible failures during the handover between base stations. A fundamental challenge of reliability is to balance the exploration of more measurements for satisfactory handover, and exploitation for timely handover (before the fast-moving user leaves the serving base station's radio coverage). This paper formulates this trade-off in extreme mobility as a composition of two distinct multi-armed bandit problems. We propose Bandit and Threshold Tuning (BATT) to minimize the regret of handover failures in extreme mobility. BATT uses $ε$-binary-search to optimize the threshold of the serving cell's signal strength to initiate the handover procedure with $\mathcal{O}(\log J \log T)$ regret.It further devises opportunistic Thompson sampling, which optimizes the sequence of the target cells to measure for reliable handover with $\mathcal{O}(\log T)$ regret.Our experiment over a real LTE dataset from Chinese high-speed rails validates significant regret reduction and a 29.1% handover failure reduction.