Search arXivSearch

arXiv · 2208.00851

Antenna Combiner for Periodic Broadcast V2V Communication Under Relaxed Worst-Case Propagation

Abstract

The performance of a previously developed analog combining network (ACN) of phase shifters for vehicle-to-vehicle communication is investigated. The original ACN was designed to maximize the sum of the signal-to-noise ratios (SNRs) for $K$ consecutive, broadcast, periodic cooperative awareness messages when communication is over a dominant path whose angle of arrival (AOA) is constant over the duration of $K$ packets. In this work, we relax this scenario by allowing the dominant path AOA and path-loss (PL) to be time-variant. Assuming a highway scenario with line of sight (LOS) propagation between vehicles, we use affine approximations to model the time variation of different path quantities, including the PL, the relative distance-dependent phase shift between antennas, and the AOA-dependent far-field function of the antennas. Using these approximations, we analytically derive the ACN sum-SNRs as each one of these quantities vary over the duration of $K$ packets. Moreover, we suggest a phase slope design rule that is robust against time variation of the dominant path and optimal under time-invariant conditions. Finally, we validate this design rule using numerical computations and an example of vehicular communication antenna elements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chouaib Bencheikh Lehocine, Erik G. Ström, Fredrik Brännström. 2022-08-01. Antenna Combiner for Periodic Broadcast V2V Communication Under Relaxed Worst-Case Propagation. https://arxiv.org/abs/2208.00851

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

KEEP EXPLORING

Related papers

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

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

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