论文标题

毫米波车辆网络中的移动性和阻塞感知通信

Mobility and Blockage-aware Communications in Millimeter-Wave Vehicular Networks

论文作者

Hussain, Muddassar, Scalabrin, Maria, Rossi, Michele, Michelusi, Nicolo

论文摘要

移动性可能会降低在毫米波频谱下运行的下一代车辆网络的性能:频繁的错误对准和堵塞需要重复的横梁训练和移交,并且会产生巨大的开销。然而,流动性在通信梁和阻塞事件中引起时间相关性。在本文中,提出了梁训练,数据传输和移交的自适应设计,该设计将学习和利用这些时间相关性,以减少光束训练开销,并最佳地权衡吞吐量和功耗。在每个时间槽中,服务基站(BS)决定在系统状态下的不确定性下检测到阻塞时进行梁训练,数据通信或移交。决策问题是部分可观察到的马尔可夫决策过程,目标是在平均功率约束下最大化输送到UE的吞吐量。为了解决高维优化,开发了一个近似约束的基于点的基于点的值迭代(C-PBVI)方法,该方法同时优化了原始功能,以满足功率约束。数值结果表明,基于2D迁移率的分析与模拟之间的匹配良好,并且通过BSS和UE的均匀平面阵列形成3D模拟光束,并揭示了C-PBVI在近距离上的表现,并且在光谱效率方面效果超过了38%的基线方案,并超过了基线方案。出于C-PBVI政策的结构,提出了两种启发式方法,这些启发式方法具有次级优势的贸易复杂性,光谱效率仅实现4%和15%的损失。

Mobility may degrade the performance of next-generation vehicular networks operating at the millimeter-wave spectrum: frequent mis-alignment and blockages require repeated beam training and handover, and incur enormous overhead. Nevertheless, mobility induces temporal correlations in the communication beams and in blockage events. In this paper, an adaptive design of beam training, data transmission and handover is proposed, that learns and exploits these temporal correlations to reduce the beam training overhead and optimally trade-off throughput and power consumption. At each time-slot, the serving base station (BS) decides to perform either beam training, data communication, or handover when blockage is detected, under uncertainty in the system state. The decision problem is cast as a partially observable Markov decision process, and the goal is to maximize the throughput delivered to the UE, under an average power constraint. To address the high dimensional optimization, an approximate constrained point-based value iteration (C-PBVI) method is developed, which simultaneously optimizes the primal and dual functions to meet the power constraint. Numerical results demonstrate a good match between the analysis and a simulation based on 2D mobility and 3D analog beamforming via uniform planar arrays at both BSs and UE, and reveal that C-PBVI performs near-optimally, and outperforms a baseline scheme with periodic beam training by 38% in spectral efficiency. Motivated by the structure of the C-PBVI policy, two heuristics are proposed, that trade complexity with sub-optimality, and achieve only 4% and 15% loss in spectral efficiency.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源