Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Halarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Hal
Conference object . 2018
Data sources: Hal
https://doi.org/10.1109/sitis....
Article . 2018 . Peer-reviewed
Data sources: Crossref
DBLP
Conference object . 2025
Data sources: DBLP
versions View all 3 versions
addClaim

Latency Aware Into LTE-V2X Mode 4 System

Authors: Houda Chihi; Rafik Zitouni; Ridha Bouallegue; Amar Ramdane-Cherif;

Latency Aware Into LTE-V2X Mode 4 System

Abstract

Intelligent Transportation System (ITS) is the focus of many researchers due to the growing of traffic, which ensures complexity, especially in urban scenario. In this regard, Ultra-Reliable Low Latency Communication (URLLC) achievement is the main purpose for ITS. Latency represents a relevant metric for real time exchange of messages and improve the network Quality of Service (QoS). In this contribution, the purpose is delay investigation into Long Term Evolution Vehicle (LTE-V), which is an enabling cellular technology for vehicular connectivity. The idea is RB (Resource Block) allocation for delay minimization through a direct interaction enabled by LTE-V features. We start by a mathematical analysis of a cross-layer structure based on the joint association between physical layer together with a Medium Access Control (MAC) sub layer. Hence, latency minimization is transformed into an optimization problem in which data rate is maximized under the constraint of queue length. Resource allocation resolution is based on Lyapunov policy. Numerical results are obtained according to a Manhattan scenario towards an urban model where the performance criterion is Complementary Cumulative Distribution Function (CCDF) of queue length. The obtained results highlight the efficiency of the proposed resource allocation algorithm.

Keywords

[INFO] Computer Science [cs]

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!