Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.09369

Performance Evaluation of Adaptive Cooperative NOMA Protocol at Road Junctions

Baha Eddine Youcef Belmekki·Abdelkrim Hamza·Benoît Escrig
View original source ↗Read source document ↗Export metadata ↓

Abstract

Vehicular communications (VCs) protocols offer useful contributions in the context of accident prevention thanks to the transmission of alert messages. This is even truer at road intersections since these areas exhibit higher collision risks and accidents rate. On the other hand, non-orthogonal multiple access (NOMA) has been show to be a suitable candidate for five generation (5G) of wireless systems. In this paper, we propose and evaluate the performance of VCs protocol at road intersections, named adaptive cooperative NOMA (ACN) protocol. The transmission occurs between a source and two destinations. The transmission is subject to interference originated from vehicles located on the roads. The positions of the interfering vehicles follow a Poison point process (PPP). First, we calculate the outage probability related to ACN protocol, and closed form expressions are obtained. Then we compare it with other existing protocols in the literature. We show that ACN protocol offers a significant improvement over the existing protocols in terms of outage probability, especially at the intersection. We show that the performance of ACN protocol increases compared to other existing protocols for high data rates. The theoretical results are verified with Monte-Carlo simulations.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Baha Eddine Youcef Belmekki, Abdelkrim Hamza, Benoît Escrig. 2020-02-21. Performance Evaluation of Adaptive Cooperative NOMA Protocol at Road Junctions. https://arxiv.org/abs/2002.09369

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗