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

Applications of Meijer's factorization theorems in performance analyses of all-optical multi-hop FSO systems

The use of bivariate Fox H-functions (BFHFs) in performance analyses of wireless communication systems has gained considerable attention in past few decades. However, the non-existence of robust built-in routines for evaluating such functions in standard computing systems poses numerous challenges in numerical experiments and simulations. Motivated by the apparent need to circumvent these difficulties in performance analyses of cooperative wireless communications, this work presents an alternative method for obtaining the exact, approximate and asymptotic BFHF-free cumulative distribution function (CDF) of the end-to-end (e2e) signal-to-noise ratio (SNR) of multi-hop amplify-and-forward (AF) relaying wireless communication systems. As an illustration, the e2e performance analysis of an all-optical dual-hop free-space optical (FSO) transmission system over Gamma-Gamma turbulence in the presence of pointing errors is revisited. Specifically, new mathematical formulae for the statistical characteristics of the e2e SNR for systems with AF fixed-gain relaying as well as channel-state-information(CSI)-assisted using heterodyne detection (HD) or intensity modulation with direct detection (IM/DD) are derived in terms of mathematically malleable and uniformly convergent infinite series of weighted Meijer G-functions. The usefulness of the derived CDFs is illustrated through derivation of traditional system performance metrics. The accuracy of the derived analytical formulae is verified via Monte Carlo simulations in MATLAB®. Finally, based on results observed in this paper, useful expansions of common BFHFs in terms of easily computable univariate hypergeometric functions are proposed

Performance Evaluation of Ultra-Dense Networks with Applications in Internet-of-Things

The new wireless era in the next decade and beyond would be very different from our experience nowadays. The fast pace of introducing new technologies, services, and applications requires the researchers and practitioners in the field be ready by making paradigm shifts. The stringent requirements on 5G networks, in terms of throughput, latency, and connectivity, challenge traditional incremental improvement in the network performance. This urges the development of unconventional solutions such as network densification, massive multiple-input multiple-output (massive MIMO), cloud-based radio access network (C-RAN), millimeter Waves (mmWaves), non-orthogonal multiple access (NOMA), full-duplex communication, wireless network virtualization, and proactive content-caching to name a few. Ultra-Dense Network (UDN) is one of the preeminent technologies in the racetrack towards fulfilling the requirements of next generation mobile networks. Dense networks are featured by the deployment of abundant of small cells in hotspots where immense traffic is generated. In this context, the density of small cells surpasses the active users’ density providing a new wireless environment that has never been experienced in mobile communication networks. The high density of small cells brings the serving cells much closer to the end users providing a two-fold gain where better link quality is achieved and more spatial reuse is accomplished. In this thesis, we identified the distinguishing features of dense networks which include: close proximity of many cells to a given user, potential inactivity of most base stations (BSs) due to lack of users, drastic inter-cell interference in hot-spots, capacity limitation by virtue of the backhaul bottleneck, and fundamentally different propagation environments. With these features in mind, we recognized several problems associated with the performance evaluation of UDN which require a treatment different from traditional cellular networks. Using rigorous advanced mathematical techniques along with extensive Monte Carlo simulations, we modelled and analytically studied the problems in question. Consequently, we developed several mathematical frameworks providing closed-form and easy-computable mathematical instruments which network designers and operators can use to tune the networks in order to achieve the optimal performance. Moreover, the investigations performed in this thesis furnish a solid ground for addressing more problems to better understand and exploit the UDN technology for higher performance grades. In Chapter 3, we propose the multiple association in dense network environment where the BSs are equipped with idle mode capabilities. This provides the user with a “data-shower,” where the user’s traffic is split into multiple paths, which helps overcoming the capacity limitations imposed by the backhaul links. We evaluate the performance of the proposed association scheme considering general fading channel distributions. To this end, we develop a tractable framework for the computation of the average downlink rate. In Chapter 4, we study the downlink performance of UDNs considering Stretched Exponential Path-Loss (SEPL) to capture the short distances of the communication links. Considering the idle mode probability of small cells, we draw conclusions which better reflect the performance of network densification considering SEPL model. Our findings reveal that the idle mode capabilities of the BSs provide a very useful interference mitigation technique. Another interesting insight is that the system interference in idle mode capable UDNs is upper-bounded by the interference generated from the active BSs, and in turn, this is upper-bounded by the number of active users where more active users is translated to more interference in the system. This means that the interference becomes independent of the density of the small cells as this density increases. In Chapter 5, we provide the derivation of the average secrecy rate in UDNs considering their distinct traits, namely, idle mode BSs and LOS transmission. To this end, we exploit the standard moment generating function (MGF)-based approach to derive relatively simple and easily computable expressions for the average secrecy rate considering the idle mode probability and Rician fading channel. The result of this investigation avoids the system level simulations where the performance evaluation complexity can be greatly reduced with the aid of the derived analytical expressions. In Chapter 6, we model the uplink coverage of mMTC deployment scenario considering a UDN environment. The presented analysis reveals the significant and unexpected impact of the high density of small cells in UDNs on the maximum transmit power of the MTC nodes. This finding relaxes the requirements on the maximum transmit power which in turn allows for less complexity, brings more cost savings, and yields much longer battery life. This investigation provides accurate, simple, and insightful expressions which shows the impact of every single system parameter on the network performance allowing for guided tunability of the network. Moreover, the results signify the asymptotic limits of the impact of all system parameters on the network performance. This allows for the efficient operation of the network by designing the system parameters which maximizes the network performance. In Chapter 7, we address the impact of the coexistence of MTC and HTC communications on the network performance in UDNs. In this investigation, we study the downlink network performance in terms of the coverage probability and the cell load where we propose two association schemes for the MTC devices, namely, Connect-to-Closest (C2C) and Connect-to-Active (C2A). The network performance is then analyzed and compared in both association schemes. In Chapter 8, we model the uplink coverage of HTC users and MTC devices paired together in NOMA-based radio access. Closed-form and easy-computable analytical results are derived for the considered performance metrics, namely the uplink coverage and the uplink network throughput. The analytical results, which are validated by extensive Monte Carlo simulations, reveal that increasing the density of small cells and the available bandwidth significantly improves the network performance. On the other side, the power control parameters has to be tuned carefully to approach the optimal performance of both the uplink coverage and the uplink network throughput

Security protocols suite for machine-to-machine systems

Nowadays, the great diffusion of advanced devices, such as smart-phones, has shown that there is a growing trend to rely on new technologies to generate and/or support progress; the society is clearly ready to trust on next-generation communication systems to face today’s concerns on economic and social fields. The reason for this sociological change is represented by the fact that the technologies have been open to all users, even if the latter do not necessarily have a specific knowledge in this field, and therefore the introduction of new user-friendly applications has now appeared as a business opportunity and a key factor to increase the general cohesion among all citizens. Within the actors of this technological evolution, wireless machine-to-machine (M2M) networks are becoming of great importance. These wireless networks are made up of interconnected low-power devices that are able to provide a great variety of services with little or even no user intervention. Examples of these services can be fleet management, fire detection, utilities consumption (water and energy distribution, etc.) or patients monitoring. However, since any arising technology goes together with its security threats, which have to be faced, further studies are necessary to secure wireless M2M technology. In this context, main threats are those related to attacks to the services availability and to the privacy of both the subscribers’ and the services providers’ data. Taking into account the often limited resources of the M2M devices at the hardware level, ensuring the availability and privacy requirements in the range of M2M applications while minimizing the waste of valuable resources is even more challenging. Based on the above facts, this Ph. D. thesis is aimed at providing efficient security solutions for wireless M2M networks that effectively reduce energy consumption of the network while not affecting the overall security services of the system. With this goal, we first propose a coherent taxonomy of M2M network that allows us to identify which security topics deserve special attention and which entities or specific services are particularly threatened. Second, we define an efficient, secure-data aggregation scheme that is able to increase the network lifetime by optimizing the energy consumption of the devices. Third, we propose a novel physical authenticator or frame checker that minimizes the communication costs in wireless channels and that successfully faces exhaustion attacks. Fourth, we study specific aspects of typical key management schemes to provide a novel protocol which ensures the distribution of secret keys for all the cryptographic methods used in this system. Fifth, we describe the collaboration with the WAVE2M community in order to define a proper frame format actually able to support the necessary security services, including the ones that we have already proposed; WAVE2M was funded to promote the global use of an emerging wireless communication technology for ultra-low and long-range services. And finally sixth, we provide with an accurate analysis of privacy solutions that actually fit M2M-networks services’ requirements. All the analyses along this thesis are corroborated by simulations that confirm significant improvements in terms of efficiency while supporting the necessary security requirements for M2M networks