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

Diversity analysis, code design, and tight error rate lower bound for binary joint network-channel coding

Joint network-channel codes (JNCC) can improve the performance of communication in wireless networks, by combining, at the physical layer, the channel codes and the network code as an overall error-correcting code. JNCC is increasingly proposed as an alternative to a standard layered construction, such as the OSI-model. The main performance metrics for JNCCs are scalability to larger networks and error rate. The diversity order is one of the most important parameters determining the error rate. The literature on JNCC is growing, but a rigorous diversity analysis is lacking, mainly because of the many degrees of freedom in wireless networks, which makes it very hard to prove general statements on the diversity order. In this article, we consider a network with slowly varying fading point-to-point links, where all sources also act as relay and additional non-source relays may be present. We propose a general structure for JNCCs to be applied in such network. In the relay phase, each relay transmits a linear transform of a set of source codewords. Our main contributions are the proposition of an upper and lower bound on the diversity order, a scalable code design and a new lower bound on the word error rate to assess the performance of the network code. The lower bound on the diversity order is only valid for JNCCs where the relays transform only two source codewords. We then validate this analysis with an example which compares the JNCC performance to that of a standard layered construction. Our numerical results suggest that as networks grow, it is difficult to perform significantly better than a standard layered construction, both on a fundamental level, expressed by the outage probability, as on a practical level, expressed by the word error rate

A survey of machine learning techniques applied to self organizing cellular networks

In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

Outage probability based on telecommunication range for multi-hop HALE UAVs

Cooperative relaying increases telecommunication range, improves the connectivity, and increases the reliability of data transmission; however, the transmitted power does not change. This paper analyzes the extended telecommunication range of a multi-hop cascaded network comprising N–cooperative relaying high-altitude long endurance (HALE) unmanned aerial vehicles (UAVs) under ambient conditions. A notable ambient condition is rain, which causes signals to scatter in different directions; hence, one should model the communication channel for HALE UAV as a Rayleigh channel. This paper proposes a statistical model that is based on the effect of the telecommunication range on the outage probability in an N-Rayleigh fading channel. The simulation results show that as the telecommunication range increases, the outage probability (Poutage) also increases, whereas when both the telecommunication range and the number of relays increase, Poutage decreases. An issue that has been highlighted in this paper is that, by increasing number of relays from N=1 to N=5 the telecommunication range increases and Poutage about 40% decreases. Moreover, in rainy conditions and with a fixed number of relays, when both the intensity of rainfall and telecommunication range increases, Poutage increases. For example by increasing rate of rain (Rr) from 1mm/h to 100 mm/h, Poutage increases around 30% in 100 Km with two relays

Cooperative diversity for the cellular uplink: Sharing strategies, performance analysis, and receiver design

In this thesis, we propose data sharing schemes for the cooperative diversity in a cellular uplink to exploit diversity and enhance throughput performance of the system. Particularly, we consider new two and three-or-more user decode and forward (DF) protocols using space time block codes. We discuss two-user and three-user amplify and forward (AF) protocols and evaluate the performance of the above mentioned data sharing protocols in terms of the bit error rate and the throughput in an asynchronous code division multiple access (CDMA) cellular uplink. We develop a linear receiver for joint space-time decoding and multiuser detection that provides full diversity and near maximum-likelihood performance.;We also focus on a practical situation where inter-user channel is noisy and cooperating users can not successfully estimate other user\u27s data. We further design our system model such that, users decide not to forward anything in case of symbol errors. Channel estimation plays an important role here, since cooperating users make random estimation errors and the base station can not have the knowledge of the errors or the inter-user channels. We consider a training-based approach for channel estimation. We provide an information outage probability analysis for the proposed multi-user sharing schemes. (Abstract shortened by UMI.)

Outage probability analysis of EH relay-assisted non-orthogonal multiple access (NOMA) systems over Block Rayleigh Fading Channel

Non-orthogonal multiple access (NOMA) has been identified as a promising multiple access technique for the fifth generation (5G) mobile networks due to its superior spectral efficiency. In this paper, we propose and investigate a Non-Orthogonal Multiple Access (NOMA) of energy harvesting (EH) relay assisted system over Block Rayleigh Fading Channel. In order to evaluate the performance of the proposed system, the integral expression of the outage probability is analyzed and derived. Numerical results confirm that our derived analytical results match well with the Monte Carlo simulations in connection with all possible system parameter

Device-to-device communications: a performance analysis in the context of social comparison-based relaying

Device-to-device (D2D) communications are recognized as a key enabler of future cellular networks which will help to drive improvements in spectral efficiency and assist with the offload of network traffic. Among the transmission modes of D2D communications are single-hop and relay assisted multi-hop transmission. Relay-assisted D2D communications will be essential when there is an extended distance between the source and destination or when the transmit power of D2D user equipments (UEs) is constrained below a certain level. Although a number of works on relay-assisted D2D communications have been presented in the literature, most of those assume that relay nodes cooperate unequivocally. In reality, this cannot be assumed since there is little incentive to cooperate without a guarantee of future reciprocal behavior. Cooperation is a social behavior that depends on various factors, such as peer comparison, incentives, the cost to the donor and the benefit to the recipient. To incorporate the social behavior of D2D relay nodes, we consider the decision to relay using the donation game based on social comparison and characterize the probability of cooperation in an evolutionary context. We then apply this within a stochastic geometric framework to evaluate the outage probability and transmission capacity of relay assisted D2D communications. Through numerical evaluations, we investigate the performance gap between the ideal case of 100% cooperation and practical scenarios with a lower cooperation probability. It shows that practical scenarios achieve lower transmission capacity and higher outage probability than idealistic network views which assume full cooperation. After a sufficient number of generations, however, the cooperation probability follows the natural rules of evolution and the transmission performance of practical scenarios approach that of the full cooperation case, indicating that all D2D relay nodes adopt the same dominant cooperative strategy based on social comparison, without the need for enforcement by an external authority