An enhanced OFDM light weight physical layer encryption scheme

The broadcast nature of wireless networks makes them susceptible to attacks by eavesdroppers than wired networks. Any untrusted node can eavesdrop on the medium, listen to transmissions and obtain sensitive information within the wireless network. In this paper, we propose a new mechanism which combines the advantages of two techniques namely iJam and OFDM phase encryption. Our modified mechanism makes iJam more bandwidth efficient by using Alamouti scheme to take advantage of the repetition inherent in its implementation. The adversary model is extended to the active adversary case, which has not been done in the original work of iJam and OFDM phase encryption. We propose, through a max min optimization model, a framework that maximizes the secrecy rate by means of a friendly jammer. We formulate a Zero-Sum game that captures the strategic decision making between the transmitter receiver pair and the adversary. We apply the fictitious play (FP) algorithm to reach the Nash equilibria (NE) of the game. Our simulation results show a significant improvement in terms of the ability of the eavesdropper to benefit from the received information over the traditional schemes, i.e. iJam or OFDM phase encryption

Permutation-Based Transmissions in Ultra-Reliable and Low-Latency Communications

In this paper, a novel permutation-based transmission strategy is proposed to improve the goodput in wireless networks for achieving ultra-reliable and low-latency communications. The proposed scheme divides the application-layer data into two portions: the first one is conveyed by the permutation with repetition of various lengths in a group of packets rather than encapsulated into the packets, whilst the second portion is encapsulated into these packets to be physically delivered through network interface in the conventional way. The lengths of the packets used to deliver the second portion are determined by the first one. Thanks to the goodput gain attained by the permutation-conveyed application-layer data, the network congestion is alleviated, which leads to lower latency and/or less dropped packets. The validity of this transmission strategy is substantiated by the analysis in the metrics of goodput, latency, physical-layer throughput and secrecy rate within a design paradigm of short-packet communications

Physical layer security for machine type communication networks

Abstract. We examine the physical layer security for machine type communication networks and highlight a secure communication scenario that consists of a transmitter Alice, which employs Transmit Antenna Selection, while a legitimate receiver Bob that uses Maximum Ratio Combining, as well as an eavesdropper Eve. We provide a solution to avoid eavesdropping and provide ways to quantify security and reliability. We obtain closed-form expressions for Multiple-Input Multiple-Output and Multi-antenna Eavesdropper (MIMOME) scenario. The closed{-}form expressions for three useful variations of MIMOME scenario, i.e., MISOME, MIMOSE, and MISOSE are also provided. A low cost and less complex system for utilizing the spatial diversity in multiple antennas system, while guaranteeing secrecy and reliability. Similarly, it is also assumed that Alice, Bob, and Eve can estimate their channel state information, and then we evaluate the performance of closed-form expressions in terms of secrecy outage probability and provide Monte Carlo simulations to corroborate the proposed analytical framework

LGTBIDS: Layer-wise Graph Theory Based Intrusion Detection System in Beyond 5G

The advancement in wireless communication technologies is becoming more demanding and pervasive. One of the fundamental parameters that limit the efficiency of the network are the security challenges. The communication network is vulnerable to security attacks such as spoofing attacks and signal strength attacks. Intrusion detection signifies a central approach to ensuring the security of the communication network. In this paper, an Intrusion Detection System based on the framework of graph theory is proposed. A Layerwise Graph Theory-Based Intrusion Detection System (LGTBIDS) algorithm is designed to detect the attacked node. The algorithm performs the layer-wise analysis to extract the vulnerable nodes and ultimately the attacked node(s). For each layer, every node is scanned for the possibility of susceptible node(s). The strategy of the IDS is based on the analysis of energy efficiency and secrecy rate. The nodes with the energy efficiency and secrecy rate beyond the range of upper and lower thresholds are detected as the nodes under attack. Further, detected node(s) are transmitted with a random sequence of bits followed by the process of re-authentication. The obtained results validate the better performance, low time computations, and low complexity. Finally, the proposed approach is compared with the conventional solution of intrusion detection.Comment: in IEEE Transactions on Network and Service Management, 202

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

RIS-assisted Scheduling for High-Speed Railway Secure Communications

With the rapid development of high-speed railway systems and railway wireless communication, the application of ultra-wideband millimeter wave band is an inevitable trend. However, the millimeter wave channel has large propagation loss and is easy to be blocked. Moreover, there are many problems such as eavesdropping between the base station (BS) and the train. As an emerging technology, reconfigurable intelligent surface (RIS) can achieve the effect of passive beamforming by controlling the propagation of the incident electromagnetic wave in the desired direction.We propose a RIS-assisted scheduling scheme for scheduling interrupted transmission and improving quality of service (QoS).In the propsed scheme, an RIS is deployed between the BS and multiple mobile relays (MRs). By jointly optimizing the beamforming vector and the discrete phase shift of the RIS, the constructive interference between direct link signals and indirect link signals can be achieved, and the channel capacity of eavesdroppers is guaranteed to be within a controllable range. Finally, the purpose of maximizing the number of successfully scheduled tasks and satisfying their QoS requirements can be practically realized. Extensive simulations demonstrate that the proposed scheme has superior performance regarding the number of completed tasks and the system secrecy capacity over four baseline schemes in literature.Comment: 15 pages, 10 figures, to appear in IEEE Transactions on Vehicular Technolog

Secure short-range communications

Analysts predict billions of everyday objects will soon become ``smart’\u27 after designers add wireless communication capabilities. Collectively known as the Internet of Things (IoT), these newly communication-enabled devices are envisioned to collect and share data among themselves, with new devices entering and exiting a particular environment frequently. People and the devices they wear or carry may soon encounter dozens, possibly hundreds, of devices each day. Many of these devices will be encountered for the first time. Additionally, some of the information the devices share may have privacy or security implications. Furthermore, many of these devices will have limited or non-existent user interfaces, making manual configuration cumbersome. This situation suggests that devices that have never met, nor shared a secret, but that are in the same physical area, must have a way to securely communicate that requires minimal manual intervention. In this dissertation we present novel approaches to solve these short-range communication issues. Our techniques are simple to use, secure, and consistent with user intent. We first present a technique called Wanda that uses radio strength as a communication channel to securely impart information onto nearby devices. We focus on using Wanda to introduce new devices into an environment, but Wanda could be used to impart any type of information onto wireless devices, regardless of device type or manufacturer. Next we describe SNAP, a method for a single-antenna wireless device to determine when it is in close physical proximity to another wireless device. Because radio waves are invisible, a user may believe transmissions are coming from a nearby device when in fact the transmissions are coming from a distant adversary attempting to trick the user into accepting a malicious payload. Our approach significantly raises the bar for an adversary attempting such a trick. Finally, we present a solution called JamFi that exploits MIMO antennas and the Inverse-Square Law to securely transfer data between nearby devices while denying more distant adversaries the ability to recover the data. We find JamFi is able to facilitate reliable and secure communication between two devices in close physical proximity, even though they have never met nor shared a key