论文标题
无人机辅助毫米波火车地面通信系统的强大传输计划
Robust Transmission Scheduling for UAV-assisted Millimeter-Wave Train-Ground Communication System
论文作者
论文摘要
随着移动数据的爆炸性增长,高速铁路(HSR)乘客对宽带无线访问服务的需求迫切需要支持超高速度场景宽带无线通信。毫米波(mmwave)可以达到高数据传输速率,但伴随着高传播损失和易受阻塞的脆弱性。为了解决这个问题,定向天线和无人机(UAVS)的发展增强了MMWave火车地面通信系统的鲁棒性。在本文中,我们提出了无人机和夫人接力援助(UMRA)算法,以有效克服链路阻塞,这可以在满足QoS要求和渠道质量的前提下最大化传输流量的数量。首先,我们为完整双链(FD)模式的无人机轨迹设计和传输计划制定了混合整数非线性编程(MINLP)问题。然后,在UMRA中,提出了基于图理论的继电器决策算法和传输计划算法,这在计算复杂性和系统性能之间做出了良好的权衡。广泛的仿真结果表明,合适的UAV位置将大大提高UMRA算法的性能,并使其接近最佳解决方案。与其他两个现有的基准方案相比,具有高频道质量要求和大区域阻塞,UMRA可以大大改善已完成的流量和系统吞吐量的数量。
With the explosive growth of mobile data, the demand of high-speed railway (HSR) passengers for broadband wireless access services urgently needs the support of ultra-highspeed scenario broadband wireless communication. Millimeterwave (mmWave) can achieve high data transmission rates, but it is accompanied by high propagation loss and vulnerability to blockage. To address this issue, developments of directional antennas and unmanned aerial vehicles (UAVs) enhance the robustness of the mmWave train-ground communication system. In this paper, we propose a UAV and MRs relay assistance (UMRA) algorithm to effectively overcome link blockage, which can maximize the number of transmission flows on the premise of meeting QoS requirements and channel qualities. First, we formulate a mixed integer nonlinear programming (MINLP) problem for UAV trajectory design and transmission scheduling in the full-duplex (FD) mode. Then, in UMRA, the relay decision algorithm and transmission scheduling algorithm based on graph theory are proposed, which make a good tradeoff between computation complexity and system performance. Extensive simulation results show that a suitable UAV position will greatly improve the performance of the UMRA algorithm and make it close to the optimal solution. Compared with the other two existing benchmark schemes, with the high channel quality requirements and large-area blockage, UMRA can greatly improve the number of completed flows and system throughput.