Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 182 tok/s Pro
GPT OSS 120B 415 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Low Latency Scheduling Algorithms for Full-Duplex V2X Networks (2101.05127v1)

Published 13 Jan 2021 in cs.IT, eess.SP, and math.IT

Abstract: Vehicular communication systems have been an active subject of research for many years and are important technologies in the 5G and the post-5G era. One important use case is platooning which is seemingly the first step towards fully autonomous driving systems. Furthermore, a key performance parameter in all vehicular communication systems is the end-to-end packet latency. Towards this goal, full-duplex (FD) transceivers can potentially be an efficient and practical solution towards reducing the delay in platooning networks. In this paper, we study the delay performance of dynamic and TDMAbased scheduling algorithms and assess the effect of FD-enabled vehicles with imperfect self-interference cancellation (SIC). By simulations, we demonstrate the performance-complexity tradeoff of these algorithms and show that a TDMA centralized scheme with low-complexity and overhead can achieve comparable performance with a fully-dynamic, centralized algorithm.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.