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

A Hierarchical Spectrum Access Scheme for TV White Space Coexistence in Hetergeneous Networks

Among current techniques for dynamic access to television (TV) white space (TVWS), geolocation database-based access provides a promising performance in protecting the TV-band incumbents from interference that cannot be efficiently achieved in other license-exempt models. However, in heterogeneous wireless networks, most portable devices do not have such access and may cause interference to TV incumbents. We propose a hierarchical model for spectrum sharing in TVWS that includes a wide range of fixed and portable devices. In the first tier, the TV broadcaster can lease the spectrum bands to local fixed users based on a soft license agreement. The fixed users are allowed to share access to this spectrum with some mobile users in their proximity in exchange for cooperative relaying. We consider a practical scenario, where only partial channel state information (CSI) is available at the users\u27 transmitters, and we propose a robust algorithm against such uncertainties in CSI values. We also propose a reputation-based relay selection mechanism to identify selfish portable users. The proposed spectrum sharing framework can provide a practical model for TVWS-coexistence that prevents undesired interference to the incumbents while restricting interference among the unlicensed devices. The simulation results show the enhancement of fixed users\u27 rate compared with alternative relay selection methods

Censor-based cooperative Multi-Antenna Spectrum Sensing with Imperfect Reporting Channels

The present contribution proposes a spectrally efficient censor-based cooperative spectrum sensing (C-CSS) approach in a sustainable cognitive radio network that consists of multiple antenna nodes and experiences imperfect sensing and reporting channels. In this context, exact analytic expressions are first derived for the corre- sponding probability of detection, probability of false alarm and sec- ondary throughput, assuming that each secondary user (SU) sends its detection outcome to a fusion center only when it has detected a primary signal. Capitalizing on the findings of the analysis, the effects of critical measures, such as the detection threshold, the number of SUs and the number of employed antennas, on the overall system performance are also quantified. In addition, the optimal detection threshold for each antenna based on the Neyman-Pearson criterion is derived and useful insights are developed on how to maximize the system throughput with a reduced number of SUs. It is shown that the C-CSS approach provides two distinct benefits compared with the conventional sensing approach, i.e., without censoring: i) the sensing tail problem, which exists in imperfect sensing environments, can be mitigated; ii) less SUs are ultimately required to obtain higher secondary throughput, rendering the system more sustainable

Low Complexity Energy-Efficient Collaborative Spectrum Sensing for Cognitive Radio Networks

Clustering approach is considered a management technology that arranged the distributed cognitive radio users into logical groups to improve the sensing performance of the network. A lot of works in this area showed that cluster-based spectrum sensing (CBSS) technique efficiently tackled the trade-off between performance and overhead issue. By employing the tree structure of the cluster, a multilevel hierarchical cluster-based spectrum sensing (MH-CBSS) algorithm was proposed to compromise between the gained performance and incurred overhead. However, the MH-CBSS iterative algorithm incurs high computational requirements. In this thesis, an energy-efficient low computational hierarchical cluster-based algorithm is proposed which reduces the incurred computational burden. This is achieved by predetermining the number of cognitive radios (CRs) in the cluster, which provides an advantage of reducing the number of iterations of the MH-CBSS algorithm. Furthermore, for a comprehensive study, the modified algorithm is investigated over both Rayleigh and Nakagami fading channels. Simulation results show that the detection performance of the modified algorithm outperforms the MH-CBSS algorithm over Rayleigh and Nakagami fading channels. In addition, a conventional energy detection algorithm is a fixed threshold based algorithm. Therefore, the threshold should be selected properly since it significantly affects the sensing performance of energy detector. For this reason, an energy-efficient hierarchical cluster-based cooperative spectrum sensing algorithm with an adaptive threshold is proposed which enables the CR dynamically adapts its threshold to achieve the minimum total cluster error. Besides, the optimal threshold level for minimizing the overall cluster detection error rate is numerically determined. The detection performance of the proposed algorithm is presented and evaluated through simulation results

Energy-efficient spectrum sensing approaches for cognitive radio systems

Designing an energy efficient cooperative spectrum sensing for cognitive radio network is our main research objective in this dissertation. Two different approaches are employed to achieve the goal, clustering and minimizing the number of participating cognitive radio users in the cooperative process. First, using clustering technique, a multilevel hierarchical cluster-based structure spectrum sensing algorithm has been proposed to tackle the balance between cooperation gain and cost by combining two different fusion rules and exploiting the tree structure of the cluster. The algorithm considerably minimizes the reporting overhead while satisfying the detection requirements. Second, based on reducing the number of participating cognitive radio users, primary user protection is considered to develop an energy efficient algorithm for cluster-based cooperative spectrum sensing system. An iterative algorithm with low complexity has been proposed to design energy efficient spectrum sensing for cluster-based cooperative systems. Simulation results show that the proposed algorithm can significantly minimize the number of contributing of cognitive radio users in the collaboration process and can compromise the performance gain and the incurred overhead. Moreover, a variable sensing window size is also considered to propose three novel strategies for energy efficient centralized cooperative spectrum sensing system using the three hard decision fusion rules. The results show that strategies remarkably increase the energy efficiency of the cooperative system; furthermore, it is shown optimality of k out of N rule over other two hard decision fusion rules. Finally, joint optimization of transmission power and sensing time for a single cognitive radio is considered. An iterative algorithm with low computational requirements has been proposed to jointly optimize power and sensing time to maximize the energy efficiency metric. Computer results have shown that the proposed algorithm outperforms those existing works in the literature

Narrowband Cooperative Spectrum Sensing in Cognitive Networks

With the increase of different types of wireless devices, the radio frequency (RF) spectrum will not longer large enough to accommodate these increased devices for communication in the future under the traditional fixed spectrum access (FSA) policy. Therefore, cognitive radio (CR), which provides devices flexible spectrum access, has been proposed to solve this scarcity problem in RF spectrum. The ability of CR depends largely on its spectrum sensing since it provides device access to one spectrum band while avoiding interference to other devices. However, the results from single spectrum sensing is not reliable in real communication condition due to various fading effects. Thus, designing an efficient cooperative spectrum sensing scheme a significant task. In this thesis, two cooperative narrowed spectrum sensing schemes, multi-selective cooperation and selective cooperation, will be proposed. Multi-selective cooperation, an improved version from selection combining (SC), is based on ordered statistics of the reporting links between the cooperative nodes and fusion center where the links with high signal-to-noise ratios (SNRs) are selected as reliable reporting links. Furthermore, we examine the optimum N-out-of-K rule of our scheme under different detection threshold and SNR. Another new scheme, selective-cooperation, is proposed based on multi-selective cooperation and it selects the links, whose SNRs are larger than fusion center's, as reliable reporting links. The performance of both new schemes are compared to other existing schemes in-terms of the probability of detection and probability of false alarm over independent identity distributed (i.i.d) and independent non-identical distributed (i.n.d) Rayleigh fading channels. Both simulations and analytical results show that the multi-selective scheme outperforms some traditional schemes, i.e. selection combining, general N-out-of-K rule and square-law selection (SLS) under different system parameters. Simulations and analytical results also show that the performance of the selective-cooperation scheme gets further improvement compared with multi-selective scheme and it outperforms some traditional schemes, i.e. square-law combining (SLC), under different communication environments

Spectrum Sensing and Multiple Access Schemes for Cognitive Radio Networks

Increasing demands on the radio spectrum have driven wireless engineers to rethink approaches by which devices should access this natural, and arguably scarce, re- source. Cognitive Radio (CR) has arisen as a new wireless communication paradigm aimed at solving the spectrum underutilization problem. In this thesis, we explore a novel variety of techniques aimed at spectrum sensing which serves as a fundamental mechanism to find unused portions of the electromagnetic spectrum. We present several spectrum sensing methods based on multiple antennas and evaluate their receiving operating characteristics. We study a cyclostationary feature detection technique by means of multiple cyclic frequencies. We make use of a spec- trum sensing method called sequential analysis that allows us to significantly decrease the time needed for detecting the presence of a licensed user. We extend this scheme allowing each CR user to perform the sequential analysis algorithm and send their local decision to a fusion centre. This enables for an average faster and more accurate detection. We present an original technique for accounting for spatial and temporal cor- relation influence in spectrum sensing. This reflects on the impact of the scattering environment on detection methods using multiple antennas. The approach is based on the scattering geometry and resulting correlation properties of the received signal at each CR device. Finally, the problem of spectrum sharing for CR networks is addressed in or- der to take advantage of the detected unused frequency bands. We proposed a new multiple access scheme based on the Game Theory. We examine the scenario where a random number of CR users (considered as players) compete to access the radio spec- trum. We calculate the optimal probability of transmission which maximizes the CR throughput along with the minimum harm caused to the licensed users’ performance

TOWARDS RELIABLE CIRCUMVENTION OF INTERNET CENSORSHIP

The Internet plays a crucial role in today\u27s social and political movements by facilitating the free circulation of speech, information, and ideas; democracy and human rights throughout the world critically depend on preserving and bolstering the Internet\u27s openness. Consequently, repressive regimes, totalitarian governments, and corrupt corporations regulate, monitor, and restrict the access to the Internet, which is broadly known as Internet \emph{censorship}. Most countries are improving the internet infrastructures, as a result they can implement more advanced censoring techniques. Also with the advancements in the application of machine learning techniques for network traffic analysis have enabled the more sophisticated Internet censorship. In this thesis, We take a close look at the main pillars of internet censorship, we will introduce new defense and attacks in the internet censorship literature. Internet censorship techniques investigate users’ communications and they can decide to interrupt a connection to prevent a user from communicating with a specific entity. Traffic analysis is one of the main techniques used to infer information from internet communications. One of the major challenges to traffic analysis mechanisms is scaling the techniques to today\u27s exploding volumes of network traffic, i.e., they impose high storage, communications, and computation overheads. We aim at addressing this scalability issue by introducing a new direction for traffic analysis, which we call \emph{compressive traffic analysis}. Moreover, we show that, unfortunately, traffic analysis attacks can be conducted on Anonymity systems with drastically higher accuracies than before by leveraging emerging learning mechanisms. We particularly design a system, called \deepcorr, that outperforms the state-of-the-art by significant margins in correlating network connections. \deepcorr leverages an advanced deep learning architecture to \emph{learn} a flow correlation function tailored to complex networks. Also to be able to analyze the weakness of such approaches we show that an adversary can defeat deep neural network based traffic analysis techniques by applying statistically undetectable \emph{adversarial perturbations} on the patterns of live network traffic. We also design techniques to circumvent internet censorship. Decoy routing is an emerging approach for censorship circumvention in which circumvention is implemented with help from a number of volunteer Internet autonomous systems, called decoy ASes. We propose a new architecture for decoy routing that, by design, is significantly stronger to rerouting attacks compared to \emph{all} previous designs. Unlike previous designs, our new architecture operates decoy routers only on the downstream traffic of the censored users; therefore we call it \emph{downstream-only} decoy routing. As we demonstrate through Internet-scale BGP simulations, downstream-only decoy routing offers significantly stronger resistance to rerouting attacks, which is intuitively because a (censoring) ISP has much less control on the downstream BGP routes of its traffic. Then, we propose to use game theoretic approaches to model the arms races between the censors and the censorship circumvention tools. This will allow us to analyze the effect of different parameters or censoring behaviors on the performance of censorship circumvention tools. We apply our methods on two fundamental problems in internet censorship. Finally, to bring our ideas to practice, we designed a new censorship circumvention tool called \name. \name aims at increasing the collateral damage of censorship by employing a ``mass\u27\u27 of normal Internet users, from both censored and uncensored areas, to serve as circumvention proxies