Optical signal propagation through underwater channels is affected by three main degrading phenomena, namely, absorption, scattering, and fading. In this paper, we experimentally study the statistical distribution of intensity fluctuations in underwater wireless optical channels with random temperature and salinity variations, as well as the presence of air bubbles. In particular, we define different scenarios to produce random fluctuations on the water refractive index across the propagation path and, then, examine the accuracy of various statistical distributions in terms of their goodness of fit to the experimental data. We also obtain the channel coherence time to address the average period of fading temporal variations. The scenarios under consideration cover a wide range of scintillation index from weak to strong turbulence. Moreover, the effects of beam-expander-and-collimator (BEC) at the transmitter side and aperture averaging lens (AAL) at the receiver side are experimentally investigated. We show that the use of a transmitter BEC and/or a receiver AAL suits single-lobe distributions, such that the generalized Gamma and exponentiated Weibull distributions can excellently match the histograms of the acquired data. Our experimental results further reveal that the channel coherence time is on the order of 10 −3 s and larger which implies to the slow fading turbulent channels.
26 February 2020 in IEEE Transactions on Wireless Communications
In this paper, we consider a relay-assisted uplink non-orthogonal multiple access (NOMA) system. In this system, two radio frequency (RF) users are grouped for simultaneous transmissions, over each resource block, to an intermediate relay. The relay then forwards the amplified version of the users’ aggregated signals, in the presence of multiuser interference, to a relatively far destination. In order to cope with the users’ ever-increasing desire for higher data rates, a high-throughput free-space optics (FSO) link is employed as the relay-destination backhaul link. It is assumed that the FSO backhaul link is subject to Gamma-Gamma turbulence with pointing error. Also, a Rayleigh fading model is considered for the user-relay access links. Under these assumptions, we derive closed-form expressions for the outage probability and tractable forms, involving only one-dimensional integrals, for the ergodic capacity. Moreover, the outage probability and ergodic capacity analysis are extended to the conventional RF-backhauled systems in the presence of multiuser interference to both relay and destination nodes, and Rician fading for the relay-destination RF link. Our results reveal the superiority of FSO backhauling for high-throughput and high-reliability NOMA systems compared to RF backhauling. This work can be considered as a general analysis of dual-hop uplink NOMA systems as well as the first attempt to incorporate power-domain NOMA in mixed RF-FSO systems.
In this paper we analyze and investigate the bit error rate (BER) performance of multiple-input multiple-output underwater wireless optical communication (MIMO-UWOC) systems. In addition to exact BER expressions, we also obtain an upper bound on the system BER. To effectively estimate the BER expressions, we use Gauss-Hermite quadrature formula as well as approximation to the sum of log-normal random variables. We confirm the accuracy of our analytical expressions by evaluating the BER through photon-counting approach. Our simulation results show that MIMO technique can mitigate the channel turbulence-induced fading and consequently, can partially extend the viable communication range, especially for channels with stronger turbulence.
5 November 2021 in IEEE Transactions on Wireless Communications
In this paper, we investigate covert communication over millimeter-wave (mmWave) frequencies. In particular, a mmWave transmitter, referred to as Alice, attempts to reliably communicate to a receiver, referred to as Bob, while hiding the existence of communication from a warden, referred to as Willie. In this regard, operating over the mmWave bands not only increases the covertness thanks to directional beams, but also increases the transmission data rates given much more available bandwidths and enables ultra-low form factor transceivers due to the lower wavelengths used compared to the conventional radio frequency (RF) counterpart. We first assume that the transmitter Alice employs two independent antenna arrays in which one of the arrays is to form a directive beam for data transmission to Bob. The other antenna array is used by Alice to generate another beam toward Willie as a jamming signal while changing the transmit power independently across the transmission blocks in order to achieve the desired covertness. For this dual-beam setup, we characterize Willie’s detection error rate with the optimal detector and the closed-form of its expected value from Alice’s perspective. We then derive the closed-form expression for the outage probability of the Alice-Bob link, which enables characterizing the optimal covert rate that can be achieved using the proposed setup. We further obtain tractable forms for the ergodic capacity of the Alice-Bob link involving only one-dimensional integrals that can be computed in closed forms for most ranges of the channel parameters. Finally, we highlight how the results can be extended to more practical scenarios, particularly to the cases where perfect information about the location of the passive warden is not available. Our results demonstrate the advantages of covert mmWave communication compared to the RF counterpart. The research in this paper is the first analytical attempt in exploring covert communication using mmWave systems.
8 March 2021 in IEEE Transactions on Communications
In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging low-capacity scenarios. The problem definition in this paper is inspired by three major requirements of the next generations of wireless networks. Firstly, the proposed scheme is particularly beneficial in low-capacity regimes which is important in practical scenarios of utmost interest such as the Internet-of-Things (IoT) and massive machine-type communication (mMTC). Secondly, we employ code-domain NOMA to efficiently share the scarce common resources among the users. Finally, the proposed recursive approach enables code-domain NOMA with low-complexity detection algorithms that are scalable with the number of users to satisfy the requirements of massive connectivity. To this end, we propose a novel encoding and decoding scheme for code-domain NOMA based on factorizing the pattern matrix, for assigning the available resource elements to the users, as the Kronecker product of several smaller factor matrices. As a result, both the pattern matrix design at the transmitter side and the mixed symbols' detection at the receiver side can be performed over matrices with dimensions that are much smaller than the overall pattern matrix. Consequently, this leads to significant reduction in both the complexity and the latency of the detection. We present the detection algorithm for the general case of factor matrices. The proposed algorithm involves several recursions each involving certain sets of equations corresponding to a certain factor matrix. We then characterize the system performance in terms of average sum rate, latency, and detection complexity. Our latency and complexity analysis confirm the superiority of our proposed scheme in enabling large pattern matrices. Moreover, our numerical results for the average sum rate show that the proposed scheme provides better performance compared to straightforward code-domain NOMA with comparable complexity, especially at low-capacity regimes.
10 August 2021 in IEEE Journal on Selected Areas in Information Theory
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into k smaller tasks, encoded using an (n,k) linear code, and performed over n distributed nodes. The goal is to reduce the average execution time of the computational job. We provide a connection between the problem of characterizing the average execution time of a coded distributed computing system and the problem of analyzing the error probability of codes of length n used over erasure channels. Accordingly, we present closed-form expressions for the execution time using binary random linear codes and the best execution time any linear-coded distributed computing system can achieve. It is also shown that there exist good binary linear codes that not only attain (asymptotically) the best performance that any linear code (not necessarily binary) can achieve but also are numerically stable against the inevitable rounding errors in practice. We then develop a low-complexity algorithm for decoding Reed-Muller (RM) codes over erasure channels. Our decoder only involves additions, subtractions, and inversion of relatively small matrices of dimensions at most logn+1, and enables coded computation over real-valued data. Extensive numerical analysis of the fundamental results as well as RM-and polar-coded computing schemes demonstrate the excellence of the RM-coded computation in achieving close-to-optimal performance while having a low-complexity decoding and explicit construction. The proposed framework in this paper enables efficient designs of distributed computing systems given the rich literature in the channel coding theory.