arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.05929eess.SP
收藏

海报摘要:模式3车辆对车辆侧链路通信的分层子信道分配

Poster Abstract: Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications

Luis F. Abanto-Leon, Arie Koppelaar, Sonia Heemstra de Groot

摘要:

在V2 V模式-3中,eNodeB向车辆分配子信道,以便它们周期性地广播CAM消息\cite{b2}。一个关键方面是确保同一集群中的车辆将在正交时间子信道\footnote{A subchannel is a time-frequency resource chunk capable of sufficiently conveying a CAM message.}中广播以避免冲突。通常,资源/子信道分配问题可以表示为加权二分图。然而,在这种情况下,存在附加的时间正交性约束,其不能由传统的图匹配方法\cite{b3}直接处理。因此,在我们的方法中,已经考虑到了上述限制。我们还执行分配任务的顺序方式的基础上,每个集群的约束。为了说明问题的要点,在图1中,我们示出了两个部分重叠的集群,其中,由于所分配的子信道在相同的子帧中,所以产生了车辆$V_8$和$V_{10}$之间的冲突。

英文摘要:

In V2V Mode-3, eNodeBs assign subchannels to vehicles in order for them to periodically broadcast CAM messages \cite{b2}. A crucial aspect is to ensure that vehicles in the same cluster will broadcast in orthogonal time subchannels\footnote{A subchannel is a time-frequency resource chunk capable of sufficiently conveying a CAM message.} to avoid conflicts. In general, resource/subchannel allocation problems can be represented as weighted bipartite graphs. However, in this scenario there is an additional time orthogonality constraint which cannot be straightforwardly handled by conventional graph matching methods \cite{b3}. Thus, in our approach the mentioned constraint has been taken into account. We also perform the allocation task in a sequential manner based on the constrainedness of each cluster. To illustrate the gist of the problem, in Fig. 1 we show two partially overlapping clusters where a conflict between vehicles $V_8$ and $V_{10}$ is generated as the allotted subchannels are in the same subframe.

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

↑