Delay Performance of MISO Wireless Communications

Ultra-reliable, low latency communications (URLLC) are currently attracting significant attention due to the emergence of mission-critical applications and device-centric communication. URLLC will entail a fundamental paradigm shift from throughput-oriented system design towards holistic designs for guaranteed and reliable end-to-end latency. A deep understanding of the delay performance of wireless networks is essential for efficient URLLC systems. In this paper, we investigate the network layer performance of multiple-input, single-output (MISO) systems under statistical delay constraints. We provide closed-form expressions for MISO diversity-oriented service process and derive probabilistic delay bounds using tools from stochastic network calculus. In particular, we analyze transmit beamforming with perfect and imperfect channel knowledge and compare it with orthogonal space-time codes and antenna selection. The effect of transmit power, number of antennas, and finite blocklength channel coding on the delay distribution is also investigated. Our higher layer performance results reveal key insights of MISO channels and provide useful guidelines for the design of ultra-reliable communication systems that can guarantee the stringent URLLC latency requirements.Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

On the Performance of Terrestrial Free-Space Optical (FSO) Links under the Presence of Generalized Pointing Errors

En ambos grupos se han obtenido expresiones matemáticas en forma cerrada que permiten evaluar la capacidad en todo el rango de valores de SNR (Signal-to-Noise Ratio) en algunos casos y, en otros, solo ha sido posible obtener su comportamiento asintótico debido a la dificultad matemática que presentaba el análisis. A la luz de los resultados obtenidos, podemos concluir que los sistemas MISO FSO son probablemente la solución más interesante en comparación a los sistemas SIMO y MIMO FSO. Al mismo tiempo, los resultados obtenidos en comunicaciones cooperativas permiten concluir que los sistemas cooperativos basados en retransmisión DF son capaces de aumentar la capacidad e incluso mejorar a la capacidad obtenida por un sistema basado en diversidad espacial para determinadas posiciones del nodo retransmisor. En el caso de las contribuciones realizadas en el modelado de errores por desapuntamiento generalizado, los cuales siguen una distribución Beckmann, podemos destacar la aproximación propuesta en esta tesis que nos permite incluir de una forma eficiente y sencilla dichos errores por desapuntamiento al análisis de prestaciones de cualquier sistema de comunicaciones FSO. La herramienta propuesta es válida para analizar cualquier sistema FSO en términos de BER y probabilidad de outage y nos permite detectar qué efecto es dominante, es decir, si la turbulencia atmosférica o los errores por desapuntamiento. El efecto de la correlación también ha sido contemplado, concluyendo que no puede ser ignorado.Los sistemas de comunicaciones ópticas en espacio libre (FSO, Free-Space Optical) para aplicaciones terrestres se presentan en la actualidad como una solución muy interesante para solventar el importante reto provocado por la escasez del espectro RF (Radio-Frequency) disponible. Además, los sistemas FSO se configuran como una seria alternativa frente a otras tecnologías de acceso y transporte como los sistemas de RF debido a las altas tasas de señalización potencialmente muy superiores que se pueden conseguir. Estas ventajas, entre otras, han intensificado la investigación en estos sistemas en las últimas décadas. Por tanto, el análisis de sus prestaciones en términos de probabilidad de error de bit (BER, Bit Error-Rate), probabilidad de outage y capacidad ergódica es de interés relevante, siendo estas altamente afectadas por la turbulencia atmosférica, los errores por desapuntamiento entre transmisor y receptor así como por la niebla densa. En esta tesis, el análisis de las prestaciones de los sistemas FSO ha sido abordado, presentando novedosos resultados para la comunidad científica e investigadora. Dicho análisis de prestaciones se ha dividido en dos grandes áreas de investigación: análisis de la capacidad ergódica, y modelado de errores por desapuntamiento generalizado entre transmisor y receptor. Las contribuciones realizadas dentro del análisis de la capacidad ergódica están divididas en dos grupos: por un lado, el análisis de la capacidad de sistemas FSO avanzados basados en diversidad espacial tales como los sistemas MISO (Multiple-Input/Single-Output), SIMO (Single-Input/Multiple-Output) y MIMO(Multiple-Input/Multiple-Output) FSO; por otro lado, el análisis de la capacidad de sistemas cooperativos basados en retransmisión DF (Detect-and-Forward)

Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions

Wireless networks physical layer security : modeling and performance characterization

Intrigued by the rapid growth and expand of wireless devices, data security is increasingly playing a significant role in our daily transactions and interactions with different entities. Possible examples, including e-healthcare information and online shopping, are becoming vulnerable due to the intrinsic nature of wireless transmission medium and the widespread open access of wireless links. Traditionally, the communication security is mainly regarded as the tasks at the upper layers of layered protocol stack, security techniques, including personal access control, password protection, and end-to-end encryption, have been widely studied in the open literature. More recently, plenty of research interests have been drawn to the physical layer forms of secrecy. As a new but appealing paradigm at physical layer, physical layer security is based on two pioneering works: (i) Shannon’s information-theoretic formulation and (ii) Wyner’s wiretap formulation. On account of the fundamental of physical layer security and the different nature of various wireless network, this dissertation is supposed to further fill the lacking of the existing research outcomes. To be specific, the contributions of this dissertation can be summarized as three-fold:(i) exploration of secrecy metrics to more general fading channels; (ii) characterization a new fading channel model and its reliability and security analysis in digital communication systems; and (iii) investigation of physical layer security over the random multiple-input multiple-output (MIMO) α −μ fading channels. Taking into account the classic Alice-Bob-Eve wiretap model, the first contribution can be divided into four aspects: (i) we have investigated the secrecy performance over single-input single-output (SISO) α −μ fading channels. The probability of non-zero (PNZ) secrecy capacity and the lower bound of secrecy outage probability (SOP) are derived for the special case when the main channel and wiretap channel undergo the same non-linearity fading parameter, i.e., α. Later on, for the purpose of filling the gap of lacking closed-form expression of SOP in the open literature and extending the obtained results in chapter 2 to the single-input multiple-output (SIMO) α − μ wiretap fading channels, utilizing the fact that the received signal-tonoise ratios (SNRs) at the legitimate receiver and eavesdropper can be approximated as new α −μ distributed random variables (RVs), the SOP metric is therefore derived, and given in terms of the bivariate Fox’s H-function; (ii) the secrecy performance over the Fisher-Snedecor F wiretap fading channels is initially considered. The SOP, PNZ, and ASC are finalized in terms of Meijer’s G-function; (iii) in order to generalize the obtained results over α −μ and Fisher-Snedecor F wiretap fading channels, a more flexible and general fading channel, i.e., Fox’s H-function fading model, are taken into consideration. Both the exact and asymptotic analysis of SOP, PNZ, and average secrecy capacity (ASC), are developed with closed-form expressions; and (iv) finally, motivated by the fact that the mixture gamma (MG) distribution is an appealing tool, which can be used to model the received instantaneous SNRs over wireless fading channels, the secrecy metrics over wiretap fading channels are derived based on the MG approach. Due to the limited transmission power and communication range, cooperative relays or multi-hop wireless networks are usually regarded as two promising means to address these concerns. Inspired by the obtained results in Chapters 2 and 3, the second main contribution is to propose a novel but simple fading channel model, namely, the cascaded α −μ. This new distribution is advantageous since it encompasses the existing cascaded Rayleigh, cascaded Nakagami-m, and cascaded Weibull with ease. Based on this, both the reliability and secrecy performance of a digital system over cascaded α −μ fading channels are further evaluated. Closed-form expressions of reliability metrics (including amount of fading (AF), outage probability, average channel capacity, and average symbol error probability (ABEP).) and secrecy metrics (including SOP, PNZ, and ASC) are respectively provided. Besides, their asymptotic behaviors are also performed and compared with the exact results. Considering the impacts of users’ densities, spatial distribution, and the path-loss exponent on secrecy issue, the third aspect of this thesis is detailed in Chapter 8 as the secrecy investigation of stochastic MIMO system over α −μ wiretap fading channels. Both the stochastic geometry and conventional space-time transmission (STT) scheme are used in the system configuration. The secrecy issue is mathematically evaluated by three metrics, i.e., connection outage, the probability of non-zero secrecy capacity and the ergodic secrecy capacity. Those three metrics are later on derived regarding two ordering scheme, and further compared with Monte-Carlo simulations

Constrained capacity of MIMO Rayleigh fading channels

In this thesis channel capacity of a special type of multiple-input multiple-output (MIMO) Rayleigh fading channels is studied, where the transmitters are subject to a finite phase-shift keying (PSK) input alphabet. The constraint on the input alphabet makes an analytical solution for the capacity beyond reach. However we are able to simplify the final expression, which requires a single expectation and thus can be evaluated easily through simulation. To facilitate simulations, analytical expressions are derived for the eigenvalues and eigenvectors of a covariance matrix involved in the simplified capacity expression. The simplified expression is used to provide some good approximations to the capacity at low signal-to-noise ratios (SNRs). Involved in derivation of the capacity is the capacity-achieving input distribution. It is proved that a uniform prior distribution is capacity achieving. We also show that it is the only capacity-achieving distribution for our channel model. On top of that we generalize the uniqueness case for an input distribution to a broader range of channels