Poster Abstract: Hierarchical Subchannel Allocation for Mode-3 Vehicle-to-Vehicle Sidelink Communications
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimaging
Probing Neural Topology of Large Language Models
PackHero: A Scalable Graph-based Approach for Efficient Packer Identification
Learning without Isolation: Pathway Protection for Continual Learning
Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward
Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.