Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

Studentized Extreme Eigenvalue Based Double Threshold Spectrum Sensing Under Noise Uncertainty

The eigenvalue based spectrum sensing is a low-cost spectrum sensing method that detects the presence of the licensed user signal in desired frequency. Traditional single-threshold eigenvalue sensing methods, which are widely used in the literature, can exhibit inadequate performance under low SNR and noise uncertainty. Therefore, in this study an eigenvalue-based spectrum sensing method is proposed using a double threshold with the studentized extreme eigenvalue distribution function. The results that threshold values obtained for the proposed method were simulated in Rayleigh fading channels. The results were compared with traditional methods and they were observed to be more accurate

An Innovative Signal Detection Algorithm in Facilitating the Cognitive Radio Functionality for Wireless Regional Area Network Using Singular Value Decomposition

This thesis introduces an innovative signal detector algorithm in facilitating the cognitive radio functionality for the new IEEE 802.22 Wireless Regional Area Networks (WRAN) standard. It is a signal detector based on a Singular Value Decomposition (SVD) technique that utilizes the eigenvalue of a received signal. The research started with a review of the current spectrum sensing methods which the research classifies as the specific, semiblind or blind signal detector. A blind signal detector, which is known as eigenvalue based detection, was found to be the most desired detector for its detection capabilities, time of execution, and zero a-priori knowledge. The detection algorithm was developed analytically by applying the Signal Detection Theory (SDT) and the Random Matrix Theory (RMT). It was then simulated using Matlab® to test its performance and compared with similar eigenvalue based signal detector. There are several techniques in finding eigenvalues. However, this research considered two techniques known as eigenvalue decomposition (EVD) and SVD. The research tested the algorithm with a randomly generated signal, simulated Digital Video Broadcasting-Terrestrial (DVB-T) standard and real captured digital television signals based on the Advanced Television Systems Committee (ATSC) standard. The SVD based signal detector was found to be more efficient in detecting signals without knowing the properties of the transmitted signal. The algorithm is suitable for the blind spectrum sensing where the properties of the signal to be detected are unknown. This is also the advantage of the algorithm since any signal would interfere and subsequently affect the quality of service (QoS) of the IEEE 802.22 connection. Furthermore, the algorithm performed better in the low signal-to-noise ratio (SNR) environment. In order to use the algorithm effectively, users need to balance between detection accuracy and execution time. It was found that a higher number of samples would lead to more accurate detection, but will take longer time. In contrary, fewer numbers of samples used would result in less accuracy, but faster execution time. The contributions of this thesis are expected to assist the IEEE 802.22 Standard Working Group, regulatory bodies, network operators and end-users in bringing broadband access to the rural areas

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 201

Practical Secrecy at the Physical Layer: Key Extraction Methods with Applications in Cognitive Radio

The broadcast nature of wireless communication imposes the risk of information leakage to adversarial or unauthorized receivers. Therefore, information security between intended users remains a challenging issue. Currently, wireless security relies on cryptographic techniques and protocols that lie at the upper layers of the wireless network. One main drawback of these existing techniques is the necessity of a complex key management scheme in the case of symmetric ciphers and high computational complexity in the case of asymmetric ciphers. On the other hand, physical layer security has attracted significant interest from the research community due to its potential to generate information-theoretic secure keys. In addition, since the vast majority of physical layer security techniques exploit the inherent randomness of the communication channel, key exchange is no longer mandatory. However, additive white Gaussian noise, interference, channel estimation errors and the fact that communicating transceivers employ different radio frequency (RF) chains are among the reasons that limit utilization of secret key generation (SKG) algorithms to high signal to noise ratio levels. The scope of this dissertation is to design novel secret key generation algorithms to overcome this main drawback. In particular, we design a channel based SKG algorithm that increases the dynamic range of the key generation system. In addition, we design an algorithm that exploits angle of arrival (AoA) as a common source of randomness to generate the secret key. Existing AoA estimation systems either have high hardware and computation complexities or low performance, which hinder their incorporation within the context of SKG. To overcome this challenge, we design a novel high performance yet simple and efficient AoA estimation system that fits the objective of collecting sequences of AoAs for SKG. Cognitive radio networks (CRNs) are designed to increase spectrum usage efficiency by allowing secondary users (SUs) to exploit spectrum slots that are unused by the spectrum owners, i.e., primary users (PUs). Hence, spectrum sensing (SS) is essential in any CRN. CRNs can work both in opportunistic (interweaved) as well as overlay and/or underlay (limited interference) fashions. CRNs typically operate at low SNR levels, particularly, to support overlay/underlay operations. Similar to other wireless networks, CRNs are susceptible to various physical layer security attacks including spectrum sensing data falsification and eavesdropping. In addition to the generalized SKG methods provided in this thesis and due to the peculiarity of CRNs, we further provide a specific method of SKG for CRNs. After studying, developing and implementing several SS techniques, we design an SKG algorithm that exploits SS data. Our algorithm does not interrupt the SS operation and does not require additional time to generate the secret key. Therefore, it is suitable for CRNs

Game Theory Based Privacy Protection for Context-Aware Services

In the era of context-aware services, users are enjoying remarkable services based on data collected from a multitude of users. To receive services, they are at risk of leaking private information from adversaries possibly eavesdropping on the data and/or the un--trusted service platform selling off its data. Malicious adversaries may use leaked information to violate users\u27 privacy in unpredictable ways. To protect users\u27 privacy, many algorithms are proposed to protect users\u27 sensitive information by adding noise, thus causing context-aware service quality loss. Game theory has been utilized as a powerful tool to balance the tradeoff between privacy protection level and service quality. However, most of the existing schemes fail to depict the mutual relationship between any two parties involved: user, platform, and adversary. There is also an oversight to formulate the interaction occurring between multiple users, as well as the interaction between any two attributes. To solve these issues, this dissertation firstly proposes a three-party game framework to formulate the mutual interaction between three parties and study the optimal privacy protection level for context-aware services, thus optimize the service quality. Next, this dissertation extends the framework to a multi-user scenario and proposes a two-layer three-party game framework. This makes the proposed framework more realistic by further exploring the interaction, not only between different parties, but also between users. Finally, we focus on analyzing the impact of long-term time-serial data and the active actions of the platform and adversary. To achieve this objective, we design a three-party Stackelberg game model to help the user to decide whether to update information and the granularity of updated information