A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead

Physical layer security which safeguards data confidentiality based on the information-theoretic approaches has received significant research interest recently. The key idea behind physical layer security is to utilize the intrinsic randomness of the transmission channel to guarantee the security in physical layer. The evolution towards 5G wireless communications poses new challenges for physical layer security research. This paper provides a latest survey of the physical layer security research on various promising 5G technologies, including physical layer security coding, massive multiple-input multiple-output, millimeter wave communications, heterogeneous networks, non-orthogonal multiple access, full duplex technology, etc. Technical challenges which remain unresolved at the time of writing are summarized and the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication

Radar-Aware Transmission and Scheduling for Cognitive Radio Dynamic Spectrum Access in the CBRS Radio Band

Use of the wireless spectrum is increasing. In order to meet the throughput requirements, Dynamic Spectrum Access is a popular technique to maximize spectrum usage. This can be applied to the Citizen Broadband Radio Service (3550-3700MHz), a band recently opened by the Federal Communications Commission for opportunistic access. This radio band can be accessed as long as no higher priority users are interfered with. The top priority users are called incumbents, which are commonly naval radar. Naval radars transmit a focused beam that can be modelled as a periodic function. Lower tier users are prohibited from transmitting when their transmissions coincide and interfere with the radar beam. The second and third tier users are called Priority Access Licensees and General Authorized Access, respectively. Lower tier users must account for the transmission outage due to the presence of the radar in their scheduling algorithms. In addition, the scheduling algorithms should take Quality of Service constraints, more specifically delay constraints into account. The contribution of this thesis is the design of a scheduling algorithm for CBRS opportunistic access in the presence of radar that provides Quality of Service for users, consider different traffic needs. This was implemented using the ns-3 discrete-event network simulator to simulate an environment with a radar and randomly placed radios using LTE-U to opportunistically transmit data. The proposed algorithm was compared against the Proportional Fair algorithm and a Proportional Fair algorithm with delay awareness. Performance was measured with and without fading models present. The proposed algorithm better balanced Quality of Service requirements and minimized the effect of transmission outage due to presence of the radar

Stochastic geometry approach towards interference management and control in cognitive radio network : a survey

Interference management and control in the cognitive radio network (CRN) is a necessity if the activities of primary users must be protected from excessive interference resulting from the activities of neighboring users. Hence, interference experienced in wireless communication networks has earlier been characterized using the traditional grid model. Such models, however, lead to non-tractable analyses, which often require unrealistic assumptions, leading to inaccurate results. These limitations of the traditional grid models mean that the adoption of stochastic geometry (SG) continues to receive a lot of attention owing to its ability to capture the distribution of users properly, while producing scalable and tractable analyses for various performance metrics of interest. Despite the importance of CRN to next-generation networks, no survey of the existing literature has been done when it comes to SG-based interference management and control in the domain of CRN. Such a survey is, however, necessary to provide the current state of the art as well as future directions. This paper hence presents a comprehensive survey related to the use of SG to effect interference management and control in CRN. We show that most of the existing approaches in CRN failed to capture the relationship between the spatial location of users and temporal traffic dynamics and are only restricted to interference modeling among non-mobile users with full buffers. This survey hence encourages further research in this area. Finally, this paper provides open problems and future directions to aid in finding more solutions to achieve efficient and effective usage of the scarce spectral resources for wireless communications.The SENTECH Chair in Broadband Wireless Multimedia Communications (BWMC), Department of Electrical, Electronic and Computer Engineering, University of Pretoria, South Africa.http://www.elsevier.com/locate/comcomhj2022Electrical, Electronic and Computer Engineerin

Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence

Simulations of Large-scale WiFi-based Wireless Networks: Interdisciplinary Challenges and Applications

Wireless Fidelity (WiFi) is the fastest growing wireless technology to date. In addition to providing wire-free connectivity to the Internet WiFi technology also enables mobile devices to connect directly to each other and form highly dynamic wireless adhoc networks. Such distributed networks can be used to perform cooperative communication tasks such ad data routing and information dissemination in the absence of a fixed infrastructure. Furthermore, adhoc grids composed of wirelessly networked portable devices are emerging as a new paradigm in grid computing. In this paper we review computational and algorithmic challenges of high-fidelity simulations of such WiFi-based wireless communication and computing networks, including scalable topology maintenance, mobility modelling, parallelisation and synchronisation. We explore similarities and differences between the simulations of these networks and simulations of interacting many-particle systems, such as molecular dynamics (MD) simulations. We show how the cell linked-list algorithm which we have adapted from our MD simulations can be used to greatly improve the computational performance of wireless network simulators in the presence of mobility, and illustrate with an example from our simulation studies of worm attacks on mobile wireless adhoc networks.Comment: Future Generation Computer Systems, Article in Pres