arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.10598cs.NI
收藏

基于图的Mmwave车载网络波束管理模型

Graph-based Model for Beam Management in Mmwave Vehicular Networks

Zana Limani Fazliu, Carla Fabiana Chiasserini, Francesco Malandrino, Alessandro Nordio

摘要:

Mmwave频段被广泛吹捧为未来5G网络的一个非常有前途的选择,特别是在使此类网络能够满足高要求的速率要求方面。因此,在5G车载网络的背景下,这些频段的使用也越来越受到关注,预计联网汽车很快将需要发送和接收大量数据。然而,毫米波通信需要使用窄定向波束来建立链路,以克服恶劣的传播条件。先进的天线系统还允许在基站进行复杂的波束设计,其中可以设置不同宽度的多个波束。在这项工作中,我们专注于在城市车辆网络的光束管理,使用基于图的方法来建模的系统特性和现有的限制。特别是,与以前的工作不同,我们制定的光束设计问题作为一个最大重量匹配问题的二分图的冲突,然后我们解决它使用一个有效的启发式算法。我们的研究结果表明,我们的方法很容易优于先进的方法,基于聚类算法。

英文摘要:

Mmwave bands are being widely touted as a very promising option for future 5G networks, especially in enabling such networks to meet highly demanding rate requirements. Accordingly, the usage of these bands is also receiving an increasing interest in the context of 5G vehicular networks, where it is expected that connected cars will soon need to transmit and receive large amounts of data. Mmwave communications, however, require the link to be established using narrow directed beams, to overcome harsh propagation conditions. The advanced antenna systems enabling this also allow for a complex beam design at the base station, where multiple beams of different widths can be set up. In this work, we focus on beam management in an urban vehicular network, using a graph-based approach to model the system characteristics and the existing constraints. In particular, unlike previous work, we formulate the beam design problem as a maximum-weight matching problem on a bipartite graph with conflicts, and then we solve it using an efficient heuristic algorithm. Our results show that our approach easily outperforms advanced methods based on clustering algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑