Wireless networks provide flexible ubiquitous user communications but, at the same time, provide the same access to an attacker or eavesdropper trying to intercept private messages. Hence, security has become a primary concern in wireless networks, and there has been a resurgence of interest in physical layer forms of secrecy based on Shannon’s original information-theoretic formulation and Wyner’s consideration of the wiretap formulation of such. In this chapter, we venture beyond the prototypical three-node Alice-Bob-Eve security scenario to consider physical layer forms of secrecy in wireless networks, where the need to protect the message over multiple hops opens up system vulnerabilities, but the addition of system nodes beyond the communicating parties also offers opportunities. In particular, the scaling of secrecy in (asymptotically) large multihop networks will be considered, and we will focus, in particular, on how the flexibility offered by the large number of system nodes in the network can facilitate secure communication in the face of a large number of eavesdroppers, even if the location of those eavesdroppers is unknown. The transmission techniques that are employed in the conclusive results for secrecy scaling in large networks with noncollaborating eavesdroppers also have clear analogs that should prove effective in finite networks, but there are challenges to be addressed in such an adaptation.
Wireless networks provide flexible ubiquitous user communications but, at the same time, provide the same access to an attacker or eavesdropper trying to intercept private messages. Hence, security has become a primary concern in wireless networks, and there has been a resurgence of interest in physical layer forms of secrecy based on Shannon’s original information-theoretic formulation and Wyner’s consideration of the wiretap formulation of such. In this chapter, we venture beyond the prototypical three-node Alice-Bob-Eve security scenario to consider physical layer forms of secrecy in wireless networks, where the need to protect the message over multiple hops opens up system vulnerabilities, but the addition of system nodes beyond the communicating parties also offers opportunities. In particular, the scaling of secrecy in (asymptotically) large multihop networks will be considered, and we will focus, in particular, on how the flexibility offered by the large number of system nodes in the network can facilitate secure communication in the face of a large number of eavesdroppers, even if the location of those eavesdroppers is unknown. The transmission techniques that are employed in the conclusive results for secrecy scaling in large networks with noncollaborating eavesdroppers also have clear analogs that should prove effective in finite networks, but there are challenges to be addressed in such an adaptation.
Due to the broadcast nature of wireless communications, it is difficult to shield transmitted signals from adversarial users in the coverage area of the transmission. This chapter highlights many issues concerned with achieving secrecy in the physical layer. It discusses overview of the foundations dating back to the pioneering key-based Shannon and keyless Wyner–Ziv works on information-theoretic security. In 1978, Leung-Yang-Cheong and Hellman considered the Gaussian wiretap channel. The chapter introduces multiformity of cooperative jamming techniques to show the effectiveness of jamming signals transmitted by some legitimate transmitters in a network of multiple transmitters and receivers in achieving physical layer security for a certain legitimate pair. It gives the idea of employing cooperative jammers in a multiple trusted/untrusted relay networks in order to improve security, and the interactions arising between cooperation and secrecy in the presence of untrusted relays are adopted. A resurgence of interest in aspects of secrecy at the physical layer has been experienced.
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. \n \nOn 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. \n \nTaking 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. \n \nDue 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. \n \nConsidering 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.
Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in a cooperative fashion to confuse the eavesdroppers. Hence, power is not expended on “artificial noise”; rather, the signal of a given transmitter is protected by the aggregate interference produced by the other transmitters. We introduce a two-hop strategy for the case of equal path-loss between all pairs of nodes, and then consider its embedding within a multi-hop approach for the general case of an extended network. In each case, we derive an achievable number of eavesdroppers that can be present in the region while secure communication between all sources and intended destinations is ensured.
In this dissertation, we present novel physical (PHY) and cross-layer design guidelines and resource adaptation algorithms to improve the security and user experience in the future wireless networks. Physical and cross-layer wireless security measures can provide stronger overall security with high efficiency and can also provide better flexibility in response to the typically time-varying wireless environment. To better utilize limited wireless resources, we present approaches and techniques based on new performance criteria for wireless system optimization by thoroughly exploiting user information including its Quality of Service (QoS) requests and channel state information (CSI) to improve network throughput and security.
In recent years, there has been a growing research interest in wireless system security from PHY layer perspective. In a wiretap channel model introduced in the seminal work by Wyner, a sender “Alice” wishes to transmit a secret message to the intended receiver “Bob” in presence of a passive eavesdropper “Eve”. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single- and multiple-antenna systems by applying Gaussian signaling and secrecy code. Despite the impracticality of Gaussian input, its compact closed-form expression of mutual information motivated the wide use of Gaussian input assumption in theoretical analysis. In contrast to the Gaussian codebook, practical wiretap codes must consist of finite-alphabet symbols. Because of this constraint, the achievable secrecy rate for a finite-alphabet input scenario would differ from the secrecy rate achievable by a Gaussian codebook. In this thesis, we quantify the effect of finite discrete-constellation on instantaneous and ergodic secrecy rate of multiple-antenna wire-tap channels. Our results demonstrate substantial performance difference between systems involving finite-alphabet inputs and systems with Gaussian inputs. In addition, we investigate the secrecy performance of multi-terminal wiretap systems when a codebook based transmission beamforming is implemented. We characterize the secrecy outage probability of a communication link under eavesdropping. We consider a limited feedback scenario where the transmitter uses a pre-defined codebook known to both the transmitter and the receiver for beamforming, and analyze the secrecy outage probability of the link when it being eavesdropped.
Next, we consider the security of wireless multi-hop networks. Certainly, network security is an overarching issue that transcends all layers of communication protocol stack. Therefore, we tackle the problem of network security by proper user scheduling, routing, and resource management. Our approach of secrecy is complementary to the traditional cryptography based techniques. Together, they can provide stronger overall security and flexibility in selecting the desired solution and can reduce bandwidth and energy overhead as much as possible. Multi-hop wireless networks frequently employ the traditional routing and resource allocation strategies. Such strategies often fail to take into account the additional need for protection against security vulnerabilities due to the wireless medium. Thus, to address security concerns, we investigate the problem of eavesdropping control by proposing security-aware power allocation strategies and routing algorithms for multi-hop networks.
The future wireless infrastructure will consists of a plethora of heterogeneous collections of applications and services. A differentiated service structure would therefore be an essential part of the future wireless infrastructure. In addition to the security consideration of wireless network, we focus on the heterogeneous structure of the network. We study the problem of cross-layer resource allocation and admission control in a multiuser heterogeneous OFDMA network providing both QoS-constrained user servicesand best-effort services. Such heterogeneous networks provide service to both High-Priority (HP) users and Best-Effort (BE) users. By clustering subcarriers, efficient algorithms for cluster and power allocation have been proposed. Our strategy maximizes the total network utility of the BE users while satisfying the QoS request for maximum number of HP users. The feasibility of the resource allocation problem depends on the number of HP users in the network. Since a large number of demanding HP users would render the resource allocation problem infeasible, a joint admission control and resource allocation scheme could be an efficient way of tackling both problems with less overhead. By incorporating admission control, we propose an efficient and optimal joint admission control and resource allocation algorithm.
Security has become an increasingly significant and urgent issue in wireless networks. The growing computational capability of the eavesdropper (Eve) and more and more complicated secure key management in large scale and heterogeneous networks, pose more and more stringent requirement to the cryptographic protocols. As a new design paradigm, physical layer security has been recognised as a promising solution to enhance the security of wireless links relying on the channel properties and advanced signal processing, and can act as either an alternative or a complementary solution to the conventional cryptographic methods. Without complicated secure key generation and management, physical layer security is quite suitable for the large scale distributed networks. In this thesis, we aim to improve the secrecy performance in emerging wireless communication systems relying on different physical layer security techniques. Firstly, the security of an amplify-and-forward successive relaying network with multiple untrusted relay nodes is investigated, where the conventional detrimental inter-relay interference is exploited to jam the untrusted nodes without assistance of external helpers. Considering different complexity requirements, several relay selection schemes are proposed, and the closed-form expressions of the lower bound of the secrecy outage probability and the maximum secrecy diversity order are derived accordingly. It is shown that the maximum secrecy diversity order of N-1 can be achieved for an N relay nodes network. Secondly, the artificial noise (AN) aided secure transmission strategy for a multiple-input single-output multiple-Eve (MISOME) system with a secure user (Bob) and a normal user (NU) is investigated. The power allocations among Bob, NU and AN, as well as the wiretap code rates, are jointly optimized to maximize the effective secrecy throughput (EST), under the average throughput constraint of NU. An alternative optimization algorithm with guaranteed convergence is proposed to obtain the optimal parameters. It is shown that the EST increases with the transmitting power and the number of transmit antennas, and decreases with the throughput constraint of NU, and the EST can be improved through injecting AN and concurrent transmission of Bob and NU. Thirdly, physical layer security in a multi-antenna small-cell network is investigated, where the multi-antenna base stations (BSs), cellular users, and Eves are all randomly distributed according to independent Poisson point processes. Stochastic geometry is applied to analyze the connection and secrecy outage probabilities and the average achievable secrecy rate. The impact of different parameters, including power allocation, BS and Eve density, and the adaptive eavesdropping or jamming on the secrecy performance is analyzed. It is shown that the average secrecy rate is a quasi-concave function of the power allocation factor and monotonically decreases with the ratio of the Eve-BS density. Finally, we study the physical layer security in a large-scale heterogeneous network consisting of both sub-6 GHz massive multi-input multi-output (MIMO) macro cells and millimeter wave (mmWave) small cells. By considering pilot spoofing attacks from the Eves, the coverage and secrecy probabilities are derived using stochastic geometry and the conditions under which the millimeter wave tier outperforms the sub-6 GHz counterpart are discussed in terms of both coverage and secrecy.It is shown that the mmWave small cell can provide better coverage performance in the high transmission code-rate region, and the secrecy performance of the mmWave system outperforms the sub-6 GHz counterpart in the low redundant rate region, which reveals the advantage of using mmWave for secure communication.
Wireless networks have experienced rapid evolutions toward sustainability, scalability and interoperability. The digital economy is driven by future networked societies to a more holistic community of intelligent infrastructures and connected services for a more sustainable and smarter society. Furthermore, an enormous amount of sensitive and confidential information, e.g., medical records, electronic media, financial data, and customer files, is transmitted via wireless channels. The implementation of higher layer key distribution and management was challenged by the emergence of these new advanced systems. In order to resist various malicious abuses and security attacks, physical layer security (PLS) has become an appealing alternative. The basic concept behind PLS is to exploit the characteristics of wireless channels for the confidentiality. Its target is to blind the eavesdroppers such that they cannot extract any confidential information from the received signals. This thesis presents solutions and analyses to improve the PLS in wireless networks. \n \nIn the second chapter, we investigate the secrecy capacity performance of an amplify-andforward (AF) dual-hop network for both distributed beamforming (DBF) and opportunistic relaying (OR) techniques. We derive the capacity scaling for two large sets; trustworthy relays and untrustworthy aggressive relays cooperating together with a wire-tapper aiming to intercept the message. We show that the capacity scaling in the DBF is lower bounded by a value which depends on the ratio between the number of the trustworthy and the untrustworthy aggressive relays, whereas the capacity scaling of OR is upper bounded by a value depending on the number of relays as well as the signal to noise ratio (SNR). \n \nIn the third chapter, we propose a new location-based multicasting technique, for dual phase AF large networks, aiming to improve the security in the presence of non-colluding passive eavesdroppers. We analytically demonstrate that the proposed technique increases the security by decreasing the probability of re-choosing a sector that has eavesdroppers, for each transmission time. Moreover, we also show that the secrecy capacity scaling of our technique is the same as for broadcasting. Hereafter, the lower and upper bounds of the secrecy outage probability are calculated, and it is shown that the security performance is remarkably enhanced, compared to the conventional multicasting technique. \n \nIn the fourth chapter, we propose a new cooperative protocol, for dual phase amplify-andforward large wireless sensor networks, aiming to improve the transmission security while taking into account the limited capabilities of the sensor nodes. In such a network, a portion of the K relays can be potential passive eavesdroppers. To reduce the impact of these untrustworthy relays on the network security, we propose a new transmission protocol, where the source agrees to share with the destination a given channel state information (CSI) of source-trusted relay-destination link to encode the message. Then, the source will use this CSI again to map the right message to a certain sector while transmitting fake messages to the other sectors. Adopting such a security protocol is promising because of the availability of a high number of cheap electronic sensors with limited computational capabilities. For the proposed scheme, we derived the secrecy outage probability (SOP) and demonstrated that the probability of receiving the right encoded information by an untrustworthy relay is inversely proportional to the number of sectors. We also show that the aggressive behavior of cooperating untrusted relays is not effective compared to the case where each untrusted relay is trying to intercept the transmitted message individually. \n \nFifth and last, we investigate the physical layer security performance over Rayleigh fading channels in the presence of impulsive noise, as encountered, for instance, in smart grid environments. For this scheme, secrecy performance metrics were considered with and without destination assisted jamming at the eavesdropper’s side. From the obtained results, it is verified that the SOP, without destination assisted jamming, is flooring at high signal-to-noise-ratio values and that it can be significantly improved with the use of jamming.