Shihao Yan

Shihao Yan, Xiaobo Zhou, Derrick Wing Kwan Ng et al.

Intelligent reflection surface (IRS) is emerging as a promising technique for future wireless communications. Considering its excellent capability in customizing the channel conditions via energy-focusing and energy-nulling, it is an ideal technique for enhancing wireless communication security and privacy, through the theories of physical layer security and covert communications, respectively. In this article, we first present some results on applying IRS to improve the average secrecy rate in wiretap channels, to enable perfect communication covertness, and to deliberately create extra randomness in wireless propagations for hiding active wireless transmissions. Then, we identify multiple challenges for future research to fully unlock the benefits offered by IRS in the context of physical layer security and covert communications. With the aid of extensive numerical studies, we demonstrate the necessity of designing the amplitudes of the IRS elements in wireless communications with the consideration of security and privacy, where the optimal values are not always $1$ as commonly adopted in the literature. Furthermore, we reveal the tradeoff between the achievable secrecy performance and the estimation accuracy of the IRS's channel state information (CSI) at both the legitimate and malicious users, which presents the fundamental resource allocation challenge in the context of IRS-aided physical layer security. Finally, a passive channel estimation methodology exploiting deep neural networks and scene images is discussed as a potential solution to enabling CSI availability without utilizing resource-hungry pilots. This methodology serves as a visible pathway to significantly improving the covert communication rate in IRS-aided wireless networks.

Tingzhen Xu, Linlin Sun, Shihao Yan et al.

In this work, for the first time, we tackle channel estimation design with pilots in the context of covert wireless communication. Specifically, we consider Rayleigh fading for the communication channel from a transmitter to a receiver and additive white Gaussian noise (AWGN) for the detection channel from the transmitter to a warden. Before transmitting information signals, the transmitter has to send pilots to enable channel estimation at the receiver. Using a lower bound on the detection error probability, we first prove that transmitting pilot and information signals with equal power can minimize the detection performance at the warden, which is confirmed by the minimum detection error probability achieved by the optimal detector based on likelihood ratio test. This motivates us to consider the equal transmit power in the channel estimation and then optimize channel use allocation between pilot and information signals in covert wireless communication. Our analysis shows that the optimal number of the channel uses allocated to pilots increases as the covertness constraint becomes tighter. In addition, our examination shows that the optimal percentage of all the available channel uses allocated to channel estimation decreases as the total number of channel uses increases.

Riqing Chen, Chunhui Li, Shihao Yan et al.

Ultra-reliable and low-latency communication (URLLC) is one category of service to be provided by next-generation wireless networks. Motivated by increasing security concerns in such networks, this article focuses on physical layer security (PLS) in the context of URLLC. The PLS technique mainly uses transmission designs based on the intrinsic randomness of the wireless medium to achieve secrecy. As such, PLS is of lower complexity and incurs less latency than traditional cryptography. In this article, we first introduce appropriate performance metrics for evaluating PLS in URLLC, illustrating the tradeoff between latency, reliability, and security. We then identify the key challenging problems for achieving PLS for URLLC, and discuss the role that channel state information can have in providing potential solutions to these problems. Finally, we present our recommendations on future research directions in this emerging area.

Shihao Yan, Xiangyun Zhou, Jinsong Hu et al.

Low probability of detection (LPD) communication has recently emerged as a new transmission technology to address privacy and security in wireless networks. Recent studies have established the fundamental limits of LPD communication in terms of the amount of information bits that can be conveyed from a transmitter to a receiver subject to a constraint on a warden's detection error probability. The established information-theoretic metric enables analytical studies on the design and performance of LPD communication under various channel conditions. In this article, we present the key features of LPD communication and discuss various important design considerations. Firstly, we clarify the differences between LPD communication and the well-known physical-layer security. Then, from an information-theoretic point of view, we discuss the optimal signalling strategies for transmitting the message-carrying signal and artificial-noise signal for LPD communication. Finally, we identify the key challenges in the design of practical LPD communication systems and point out future research directions in this context. This article provides guidelines for designing practical LPD communication strategies in wireless systems and networks.

Ullah Ihsan, Ziqing Wang, Robert Malaney et al.

Location information claimed by devices will play an ever-increasing role in future wireless networks such as 5G, the Internet of Things (IoT). Against this background, the verification of such claimed location information will be an issue of growing importance. A formal information-theoretic Location Verification System (LVS) can address this issue to some extent, but such a system usually operates within the limits of idealistic assumptions on a-priori information on the proportion of genuine users in the field. In this work we address this critical limitation by using a Neural Network (NN) showing how such a NN based LVS is capable of efficiently functioning even when the proportion of genuine users is completely unknown a-priori. We demonstrate the improved performance of this new form of LVS based on Time of Arrival measurements from multiple verifying base stations within the context of vehicular networks, quantifying how our NN-LVS outperforms the stand-alone information-theoretic LVS in a range of anticipated real-world conditions. We also show the efficient performance for the NN-LVS when the users' signals have added Non-Line-of-Site (NLoS) bias in them. This new LVS can be applied to a range of location-centric applications within the domain of the IoT.

Shihao Yan, Yirui Cong, Stephen Hanly et al.

In this work, we examine the optimality of Gaussian signalling for covert communications with an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ or $\mathcal{D}(p_{_0}||p_{_1})$ as the covertness constraint, where $\mathcal{D}(p_{_1}||p_{_0})$ and $\mathcal{D}(p_{_0}||p_{_1})$ are different due to the asymmetry of Kullback-Leibler divergence, $p_{_0}(y)$ and $p_{_1}(y)$ are the likelihood functions of the observation ${y}$ at the warden under the null hypothesis (no covert transmission) and alternative hypothesis (a covert transmission occurs), respectively. Considering additive white Gaussian noise at both the receiver and the warden, we prove that Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ as the constraint. More interestingly, we also prove that Gaussian signalling is not optimal for covert communications with an upper bound on $\mathcal{D}(p_{_0}||p_{_1})$ as the constraint, for which as we explicitly show skew-normal signalling can outperform Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ is a tighter covertness constraint in terms of leading to lower mutual information than the same upper bound on $\mathcal{D}(p_{_0}||p_{_1})$, by proving $\mathcal{D}(p_{_0}||p_{_1}) \leq \mathcal{D}(p_{_1}||p_{_0})$.

Feng Shu, Siming Wan, Shihao Yan et al.

In this work, an adaptive and robust null-space projection (AR-NSP) scheme is proposed for secure transmission with artificial noise (AN)-aided directional modulation (DM) in wireless networks. The proposed scheme is carried out in three steps. Firstly, the directions of arrival (DOAs) of the signals from the desired user and eavesdropper are estimated by the Root Multiple Signal Classificaiton (Root-MUSIC) algorithm and the related signal-to-noise ratios (SNRs) are estimated based on the ratio of the corresponding eigenvalue to the minimum eigenvalue of the covariance matrix of the received signals. In the second step, the value intervals of DOA estimation errors are predicted based on the DOA and SNR estimations. Finally, a robust NSP beamforming DM system is designed according to the afore-obtained estimations and predictions. Our examination shows that the proposed scheme can significantly outperform the conventional non-adaptive robust scheme and non-robust NSP scheme in terms of achieving a much lower bit error rate (BER) at the desired user and a much higher secrecy rate (SR). In addition, the BER and SR performance gains achieved by the proposed scheme relative to other schemes increase with the value range of DOA estimation error.

Shihao Yan, Biao He, Yirui Cong et al.

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available channel uses) should be utilized to maximize the effective throughput of the transmission subject to a predetermined covert requirement. This is a nontrivial result because more channel uses results in more observations at the warden for detecting the transmission. We also determine the maximum allowable transmit power per channel use, which is shown to decrease as the blocklength increases. Despite the decrease in the maximum allowable transmit power per channel use, the maximum allowable total power over the entire block is proved to increase with the blocklength, which leads to the fact that the effective throughput increases with the blocklength.

Shihao Yan, Robert Malaney, Ido Nevat et al.

In this work we propose and examine Location Verification Systems (LVSs) for Vehicular Ad Hoc Networks (VANETs) in the realistic setting of Rician fading channels. In our LVSs, a single authorized Base Station (BS) equipped with multiple antennas aims to detect a malicious vehicle that is spoofing its claimed location. We first determine the optimal attack strategy of the malicious vehicle, which in turn allows us to analyze the optimal LVS performance as a function of the Rician $K$-factor of the channel between the BS and a legitimate vehicle. Our analysis also allows us to formally prove that the LVS performance limit is independent of the properties of the channel between the BS and the malicious vehicle, provided the malicious vehicle's antenna number is above a specified value. We also investigate how tracking information on a vehicle quantitatively improves the detection performance of an LVS, showing how optimal performance is obtained under the assumption of the tracking length being randomly selected. The work presented here can be readily extended to multiple BS scenarios, and therefore forms the foundation for all optimal location authentication schemes within the context of Rician fading channels. Our study closes important gaps in the current understanding of LVS performance within the context of VANETs, and will be of practical value to certificate revocation schemes within IEEE 1609.2.

Shihao Yan, Robert Malaney, Ido Nevat et al.

In this work we examine the performance of a Location Spoofing Detection System (LSDS) for vehicular networks in the realistic setting of Rician fading channels. In the LSDS, an authorized Base Station (BS) equipped with multiple antennas utilizes channel observations to identify a malicious vehicle, also equipped with multiple antennas, that is spoofing its location. After deriving the optimal transmit power and the optimal directional beamformer of a potentially malicious vehicle, robust theoretical analysis and detailed simulations are conducted in order to determine the impact of key system parameters on the LSDS performance. Our analysis shows how LSDS performance increases as the Rician K-factor of the channel between the BS and legitimate vehicles increases, or as the number of antennas at the BS or legitimate vehicle increases. We also obtain the counter-intuitive result that the malicious vehicle's optimal number of antennas conditioned on its optimal directional beamformer is equal to the legitimate vehicle's number of antennas. The results we provide here are important for the verification of location information reported in IEEE 1609.2 safety messages.

Shihao Yan, Robert Malaney

As location-based techniques and applications become ubiquitous in emerging wireless networks, the verification of location information will become of growing importance. This has led in recent years to an explosion of activity related to location verification techniques in wireless networks, with a specific focus on Intelligent Transport Systems (ITS) being evident. Such focus is largely due to the mission-critical nature of vehicle location verification within the ITS scenario. In this work we review recent research in wireless location verification related to the vehicular network scenario. We particularly focus on location verification systems that rely on formal mathematical classification frameworks, showing how many systems are either partially or fully encompassed by such frameworks.

Shihao Yan, Nan Yang, Robert Malaney et al.

This paper proposes a new transmit antenna selection (TAS) scheme which provides enhanced physical layer security in multiple-input multiple-output (MIMO) wiretap channels. The practical passive eavesdropping scenario we consider is where channel state information (CSI) from the eavesdropper is not available at the transmitter. Our new scheme is carried out in two steps. First, the transmitter selects the first two strongest antennas based on the feedback from the receiver, which maximizes the instantaneous signal-to-noise ratio (SNR) of the transmitter-receiver channel. Second, the Alamouti scheme is employed at the selected antennas in order to perform data transmission. At the receiver and the eavesdropper, maximal-ratio combining is applied in order to exploit the multiple antennas.We derive a new closed-form expression for the secrecy outage probability in nonidentical Rayleigh fading, and using this result, we then present the probability of non-zero secrecy capacity in closed form and the ε-outage secrecy capacity in numerical form. We demonstrate that our proposed TAS-Alamouti scheme offers lower secrecy outage probability than a single TAS scheme when the SNR of the transmitter-receiver channel is above a specific value.