ACK-UCB: An Asynchronous Contextual Kernel-based Bandit Approach for User Association in MmWave Vehicular Networks
IEEE Transactions on Wireless Communications, 2026年1月28日
3行要約
- ACK-UCBは非同期・分散型の学習で、ミリ波車両通信の基地局を選ぶ。
- 伝搬特性を反映したカーネルで通信レートを推定し、車両間で報酬の要約統計を共有する。
- 広州をモデルにしたシミュレーションで、比較手法と同程度のスループットを保ちつつ共有コストを大きく減らした。
アブストラクト(原文)
Timely channel conditions are essential for vehicles to determine which base station (BS) to connect to, but acquiring them in mmWave vehicular networks is costly. Without additional channel estimations, the proposed asynchronous contextual kernelized upper confidence bound (ACK-UCB) algorithm estimates the current instantaneous transmission rates based on the historical transmission rates and contexts, such as the vehicle’s historical locations, velocities, and numbers of concurrent transmissions at the BS. ACK-UCB captures the nonlinear relationship between context and transmission rate, mapping the context into a reproducing kernel Hilbert space (RKHS), where a linear relationship becomes observable. To enhance estimation accuracy, a novel kernel function incorporating mmWave signal propagation characteristics is introduced in RKHS, allowing for a more precise evaluation of context similarity in relation to transmission rates. Furthermore, ACK-UCB encourages vehicles to share only reward distribution features after sufficient explorations, accelerating the learning process while keeping communication costs manageable. Numerical results show that ACK-UCB achieves 99.5%–100.5% network throughput and reduces 89%–91% communication cost of a benchmark algorithm that directly shares all local historical contexts and transmission rates, demonstrating the sharing efficiency of the ACK-UCB algorithm.
引用方法
X. He, X. Huang, and M. Tsukada, “ACK-UCB: An Asynchronous Contextual Kernel-based Bandit Approach for User Association in MmWave Vehicular Networks,” IEEE Transactions on Wireless Communications, 2026, doi: 10.1109/TWC.2026.3658630.
BibTeX
@article{He2026,
title = {ACK-UCB: An Asynchronous Contextual Kernel-based Bandit Approach for User Association in MmWave Vehicular Networks},
author = {Xiaoyang He and Xiaoxia Huang and Manabu Tsukada},
doi = {10.1109/TWC.2026.3658630},
issn = {1536-1276},
year = {2026},
date = {2026-01-28},
urldate = {2026-01-28},
journal = {IEEE Transactions on Wireless Communications},
abstract = {Timely channel conditions are essential for vehicles to determine which base station (BS) to connect to, but acquiring them in mmWave vehicular networks is costly. Without additional channel estimations, the proposed asynchronous contextual kernelized upper confidence bound (ACK-UCB) algorithm estimates the current instantaneous transmission rates based on the historical transmission rates and contexts, such as the vehicle’s historical locations, velocities, and numbers of concurrent transmissions at the BS. ACK-UCB captures the nonlinear relationship between context and transmission rate, mapping the context into a reproducing kernel Hilbert space (RKHS), where a linear relationship becomes observable. To enhance estimation accuracy, a novel kernel function incorporating mmWave signal propagation characteristics is introduced in RKHS, allowing for a more precise evaluation of context similarity in relation to transmission rates. Furthermore, ACK-UCB encourages vehicles to share only reward distribution features after sufficient explorations, accelerating the learning process while keeping communication costs manageable. Numerical results show that ACK-UCB achieves 99.5%–100.5% network throughput and reduces 89%–91% communication cost of a benchmark algorithm that directly shares all local historical contexts and transmission rates, demonstrating the sharing efficiency of the ACK-UCB algorithm.},
keywords = {ITS},
pubstate = {published},
tppubtype = {article}
}