Search arXivSearch

arXiv · 1704.02748

Robust Connectivity with Multiple Nonisotropic Antennas for Vehicular Communications

Abstract

For critical services, such as traffic safety and traffic efficiency, it is advisable to design systems with robustness as the main criteria, possibly at the price of reduced peak performance and efficiency. Ensuring robust communications in case of embedded or hidden antennas is a challenging task due to nonisotropic radiation patterns of these antennas. The challenges due to the nonisotropic radiation patterns can be overcome with the use of multiple antennas. In this paper, we describe a simple, low-cost method for combining the output of multiple nonisotropic antennas to guarantee robustness, i.e., support reliable communications in worst-case scenarios. The combining method is designed to minimize the burst error probability, i.e., the probability of consecutive decoding errors of status messages arriving periodically at a receiver from an arbitrary angle of arrival. The proposed method does not require the knowledge of instantaneous signal-to-noise ratios or the complex-valued channel gains at the antenna outputs. The proposed method is applied to measured and theoretical antenna radiation patterns, and it is shown that the method supports robust communications from an arbitrary angle of arrival.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Keerthi Kumar Nagalapur, Erik G. Ström, Fredrik Brännström, Jan Carlsson, Kristian Karlsson. 2017-04-10. Robust Connectivity with Multiple Nonisotropic Antennas for Vehicular Communications. https://arxiv.org/abs/1704.02748

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