Optimum Resource Allocation for Full-Duplex Vehicular Communication Networks
Optimum Resource Allocation for Full-Duplex Vehicular Communication Networks
复制标题
DOI：
10.1109/access.2020.3015539
复制
发表时间：
2020
期刊：
影响因子：
3.9
通讯作者：
A. Siddig;A. Ibrahim;M. H. Ismail
中科院分区：
文献类型：
--
作者：
A. Siddig;A. Ibrahim;M. H. Ismail
本文提出了一种车载通信网络的资源分配方案。该方案利用全双工（FD）通信的频谱效率来满足车对车（V2V）链路的可靠性约束和车对基础设施（V2I）链路的高容量要求。此外，由于高迁移率，它能够应对通道的快速变化。根据链路要求，将RA问题化为非凸问题，分两步求解。首先，通过求解一个线性方程组得到最优功率分配。其次，利用匈牙利方法解决了信道分配问题，这是一个最大权值二部匹配问题。此外，还提出了一种启发式混合方案，该方案将所提出的FD方案与最优查找RA的半双工（HD）方案相结合。仿真结果表明，与基于hd的最优方案相比，除了V2V链路对传输速率要求较低的情况外，FD方案总能提供更高的V2V链路容量总和，而混合方案在所有可能的情况下都能保证更高的性能。
In this article, we propose a resource allocation (RA) scheme for vehicular communication networks (VCNs). The proposed scheme exploits the spectral efficiency of full-duplex (FD) communications to fulfill the reliability constraints of vehicle-to-vehicle (V2V) links and the high capacity requirements of vehicle-to-infrastructure (V2I) links. Also, it is capable of coping with the fast variations of the channels due to the high mobility. Based on the links requirements, the RA problem is formulated as a non-convex problem, which is solved in two steps. First, the optimal power allocation (PA) is obtained by solving a system of linear equations. Second, the channel assignment (CA), which turns out to be a maximum weight bipartite matching problem, is solved using the Hungarian method. Also, a heuristic hybrid scheme, which combines the proposed FD scheme and the half-duplex (HD) scheme that optimally finds the RA, is proposed. Compared to the optimal HD-based scheme, simulation results show that the proposed FD scheme always offers higher sum of the V2I links’ capacities except for the case in which V2V links require low transmission rates, while the hybrid scheme ensures higher performance for all potential cases.