Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.13730

Direct Air-to-Underwater Optical Wireless Communication: Statistical Characterization and Outage Performance

Ziyaur Rahman·S. M. Zafaruddin·V. K. Chaubey
View original source ↗Read source document ↗Export metadata ↓

Abstract

In general, a buoy relay is used to connect the underwater communication to the terrestrial network over a radio or optical wireless communication (OWC) link. The use of relay deployment may pose security and deployment issues. This paper investigates the feasibility of direct air-to-underwater (A2UW) communication from an over-the-sea OWC system to an underwater submarine without deploying a relaying node. We analyze the statistical performance of the direct transmission over the combined channel fading effect of atmospheric turbulence, random fog, air-to-water interface, oceanic turbulence, and pointing errors. We develop novel analytical expressions for the probability density function (PDF) and cumulative distribution function (CDF) of the resultant signal-to-noise ratio (SNR) in terms of bivariate Meijer-G and Fox-H functions. We use the derived statistical results to analyze the system performance by providing exact and asymptotic results of the outage probability in terms of system parameters. We use computer simulations to demonstrate the performance of direct A2UW transmissions compared to the relay-assisted system.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ziyaur Rahman, S. M. Zafaruddin, V. K. Chaubey. 2022-04-28. Direct Air-to-Underwater Optical Wireless Communication: Statistical Characterization and Outage Performance. https://doi.org/10.1109/tvt.2022.3211186

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↗