arXiv subjects

Shihao Yan

Publications and source records attributed to Shihao Yan.

At least 37 records · Page 2Linked to original sources

arXiv2020

Joint Beam Training and Data Transmission Design for Covert Millimeter-Wave Communication

Covert communication prevents legitimate transmission from being detected by a warden while maintaining certain covert rate at the intended user. Prior works have considered the design of covert communication over conventional low-frequency bands, but few works so far have explored the higher-frequency millimeter-wave (mmWave) spectrum. The directional nature of mmWave communication makes it attractive for covert transmission. However, how to establish such directional link in a covert manner in the first place remains as a significant challenge. In this paper, we consider a covert mmWave communication system, where legitimate parties Alice and Bob adopt beam training approach for directional link establishment. Accounting for the training overhead, we develop a new design framework that jointly optimizes beam training duration, training power and data transmission power to maximize the effective throughput of Alice-Bob link while ensuring the covertness constraint at warden Willie is met. We further propose a dual-decomposition successive convex approximation algorithm to solve the problem efficiently. Numerical studies demonstrate interesting tradeoff among the key design parameters considered and also the necessity of joint design of beam training and data transmission for covert mmWave communication.

cs.IT↗

arXiv2020

On the Pilot Contamination Attack in Multi-Cell Multiuser Massive MIMO Networks

In this paper, we analyze pilot contamination (PC) attacks on a multi-cell massive multiple-input multiple-output (MIMO) network with correlated pilots. We obtain correlated pilots using a user capacity-achieving pilot sequence design. This design relies on an algorithm which designs correlated pilot sequences based on signal-to-interference-plus-noise ratio (SINR) requirements for all the legitimate users. The pilot design is capable of achieving the SINR requirements for all users even in the presence of PC. However, this design has some intrinsic limitations and vulnerabilities, such as a known pilot sequence and the non-zero cross-correlation among different pilot sequences. We reveal that such vulnerabilities may be exploited by an active attacker to increase PC in the network. Motivated by this, we analyze the correlated pilot design for vulnerabilities that can be exploited by an active attacker. Based on this analysis, we develop an effective active attack strategy in the massive MIMO network with correlated pilot sequences. Our examinations reveal that the user capacity region of the network is significantly reduced in the presence of the active attack. Importantly, the SINR requirements for the worst-affected users may not be satisfied even with an infinite number of antennas at the base station.

cs.IT↗

arXiv2020

UAV-Enabled Confidential Data Collection in Wireless Networks

This work, for the first time, considers confidential data collection in the context of unmanned aerial vehicle (UAV) wireless networks, where the scheduled ground sensor node (SN) intends to transmit confidential information to the UAV without being intercepted by other unscheduled ground SNs. Specifically, a full-duplex (FD) UAV collects data from each scheduled SN on the ground and generates artificial noise (AN) to prevent the scheduled SN's confidential information from being wiretapped by other unscheduled SNs. We first derive the reliability outage probability (ROP) and secrecy outage probability (SOP) of a considered fixed-rate transmission, based on which we formulate an optimization problem that maximizes the minimum average secrecy rate (ASR) subject to some specific constraints. We then transform the formulated optimization problem into a convex problem with the aid of first-order restrictive approximation technique and penalty method. The resultant problem is a generalized nonlinear convex programming (GNCP) and solving it directly still leads to a high complexity, which motivates us to further approximate this problem as a second-order cone program (SOCP) in order to reduce the computational complexity. Finally, we develop an iteration procedure based on penalty successive convex approximation (P-SCA) algorithm to pursue the solution to the formulated optimization problem. Our examination shows that the developed joint design achieves a significant performance gain compared to a benchmark scheme.

eess.SP↗

arXiv2019

Covert Wireless Communication in Presence of a Multi-Antenna Adversary and Delay Constraints

Covert communication hides the transmission of a message from a watchful adversary while ensuring reliable information decoding at the receiver, providing enhanced security in wireless communications. In this letter, covert communication in the presence of a multi-antenna adversary and under delay constraints is considered. Under the assumption of quasi-static wireless fading channels, we analyze the effect of increasing the number of antennas employed at the adversary on the achievable throughput of covert communication. It is shown that in contrast to a single-antenna adversary, a slight increase in the number of adversary's antennas drastically reduces the covert throughput, even for relaxed covertness requirements.

cs.IT↗

arXiv2019

One-Way URLLC with Truncated Channel Inversion Power Control

In this work, we consider one-way ultra-reliable and low-latency communication (URLLC), where only the transmission in one direction requires URLLC and the transmission in the opposite direction does not. In order to meet the low-latency requirement of the one-way URLLC, we propose to use a truncated channel inversion power control (CIPC) to eliminate the requirement and the associated overhead of the training-based channel estimation at the receiver, while utilizing the multi-antenna technique at the transmitter to enhance the communication reliability. We first derive the transmission outage probability achieved by the truncated CIPC by considering the impact of a finite blocklength and a maximum transmit power constraint. Then, we determine the optimal constant power of the received signals in the truncated CIPC, which minimizes the transmission outage probability. Our examination shows that the proposed truncated CIPC is an effective means to achieve the one-way URLLC, where the tradeoff among reliability, latency, and required resources (e.g., the required number of transmit antennas, or the required maximum transmit power) is revealed.

cs.IT↗

arXiv2019

Pilot-Based Channel Estimation Design in Covert Wireless Communication

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.

cs.IT↗

arXiv2019

Joint Optimization of a UAV's Trajectory and Transmit Power for Covert Communications

This work considers covert communications in the context of unmanned aerial vehicle (UAV) networks, aiming to hide a UAV for transmitting critical information out of a scenario that is monitored and where communication is not allowed. Specifically, the UAV as a transmitter intends to transmit information to a legitimate receiver (Bob) covertly in order to avoid being detected by a warden (Willie) with location uncertainties at Bob and/or Willie. In order to enhance the considered covert communication performance, we prefer to jointly optimize the UAV's trajectory and transmit power in terms of maximizing the average covert transmission rate from the UAV to Bob subject to transmission outage constraint and covertness constraint. The formulated optimization problem is difficult to tackle directly due to the intractable constraints. As such, we first employ conservative approximation to transform a constraint into a deterministic form and then apply the first-order restrictive approximation to transform the optimization problem into a convex form. By applying the successive convex approximation (SCA) technique, an efficient iterative algorithm is developed to solve the optimization problem. Our examination shows that the developed joint trajectory and transmit power optimization scheme achieves significantly better covert communication performance as compared to a benchmark scheme.

cs.IT↗

arXiv2019

Low Probability of Detection Communication: Opportunities and Challenges

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.

cs.IT↗

arXiv2019

UAV-Enabled Covert Wireless Data Collection

This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex UAV intends to gather critical information from a scheduled user (SU) through wireless communication and generate artificial noise (AN) with random transmit power in order to ensure a negligible probability of the SU's transmission being detected by the unscheduled users (USUs). To enhance the system performance, we jointly design the UAV's trajectory and its maximum AN transmit power together with the user scheduling strategy subject to practical constraints, e.g., a covertness constraint, which is explicitly determined by analyzing each USU's detection performance, and a binary constraint induced by user scheduling. The formulated design problem is a mixed-integer non-convex optimization problem, which is challenging to solve directly, but tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the Successive Hover-and-Fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV.

eess.SP↗

arXiv2019

Physical Layer Security for Ultra-Reliable and Low-Latency Communications

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.

cs.IT↗

arXiv2019

Covert Transmission with a Self-sustained Relay

This work examines the possibility, performance limits, and associated costs for a self-sustained relay to transmit its own covert information to a destination on top of forwarding the source's information. Since the source provides energy to the relay for forwarding its information, the source does not allow the relay's covert transmission and is to detect it. Considering the time switching (TS) and power splitting (PS) schemes for energy harvesting, where all the harvested energy is used for transmission at the self-sustained relay, we derive the minimum detection error probability $ξ^{\ast}$ at the source, based on which we determine the maximum effective covert rate $Ψ^{\ast}$ subject to a given covertness constraint on $ξ^{\ast}$. Our analysis shows that $ξ^{\ast}$ is the same for the TS and PS schemes, which leads to the fact that the cost of achieving $Ψ^{\ast}$ in both the two schemes in terms of the required increase in the energy conversion efficiency at the relay is the same, although the values of $Ψ^{\ast}$ in these two schemes can be different in specific scenarios. For example, the TS scheme outperforms the PS scheme in terms of achieving a higher $Ψ^{\ast}$ when the transmit power at the source is relatively low. If the covertness constraint is tighter than a specific value, it is the covertness constraint that limits $Ψ^{\ast}$, and otherwise it is upper bound on the energy conversion efficiency that limits $Ψ^{\ast}$.

cs.IT↗

arXiv2019

Gaussian Signalling for Covert Communications

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})$.

cs.IT↗

arXiv2019

Artificial Intelligence and Location Verification in Vehicular Networks

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.

eess.SP↗

arXiv2019

Machine Learning and Location Verification in Vehicular Networks

Location information will play a very important role in emerging wireless networks such as Intelligent Transportation Systems, 5G, and the Internet of Things. However, wrong location information can result in poor network outcomes. It is therefore critical to verify all location information before further utilization in any network operation. In recent years, a number of information-theoretic Location Verification Systems (LVSs) have been formulated in attempts to optimally verify the location information supplied by network users. Such LVSs, however, are somewhat limited since they rely on knowledge of a number of channel parameters for their operation. To overcome such limitations, in this work we introduce a Machine Learning based LVS (ML-LVS). This new form of LVS can adapt itself to changing environments without knowing the channel parameters. Here, for the first time, we use real-world data to show how our ML-LVS can outperform information-theoretic LVSs. We demonstrate this improved performance within the context of vehicular networks using Received Signal Strength (RSS) measurements at multiple verifying base stations. We also demonstrate the validity of the ML-LVS even in scenarios where a sophisticated adversary optimizes her attack location.

eess.SP↗

arXiv2019

Delay-Constrained Covert Communications with A Full-Duplex Receiver

In this work, we consider delay-constrained covert communications with the aid of a full-duplex (FD) receiver. Without delay constraints, it has been shown that the transmit power of artificial noise (AN) at the FD receiver should be random in order to enhance covert communications. In this work, we show that transmitting AN with a fixed power indeed improve covert communications with delay constraints, since in a limited time period the warden cannot exactly learn its received power. This explicitly shows one benefit of considering practical delay constraints in the context of covert communications. We analyze the optimal transmit power of AN for either fixed or globally optimized transmit power of covert information, based on which we also determine the specific condition under which transmitting AN by the FD receiver can aid covert communications and a larger transmit power of AN always leads to better covert communication performance.

eess.SP↗

arXiv2018

Covert Wireless Communications with Channel Inversion Power Control in Rayleigh Fading

In this work, we adopt channel inversion power control (CIPC) to achieve covert communications aided by a full-duplex receiver. Specifically, the transmitter varies the power and phase of transmitted signals as per the channel to the receiver, such that the receiver can decode these signals without knowing the channel state information. This eliminates the required feedback from the transmitter to the receiver, which aids hiding the transmitter from a warden. The truncated CIPC and conventional CIPC schemes are proposed and examined, where for truncated CIPC covert transmission ceases when the channel quality from the transmitter to the receiver is low, while for conventional CIPC covert transmission always occurs regardless of this channel quality. We examine their performance in terms of the achieved effective covert throughput (ECT), which quantifies the amount of information that the transmitter can reliably convey to the receiver, subject to the constraint that the warden's detection error probability is no less than some specific value. Our examination shows that the truncated CIPC scheme can outperform the conventional CIPC scheme due to this constraint.

cs.IT↗

arXiv2018

Achieving Covert Wireless Communications Using a Full-Duplex Receiver

Covert communications hide the transmission of a message from a watchful adversary while ensuring a certain decoding performance at the receiver. In this work, a wireless communication system under fading channels is considered where covertness is achieved by using a full-duplex (FD) receiver. More precisely, the receiver of covert information generates artificial noise with a varying power causing uncertainty at the adversary, Willie, regarding the statistics of the received signals. Given that Willie's optimal detector is a threshold test on the received power, we derive a closed-form expression for the optimal detection performance of Willie averaged over the fading channel realizations. Furthermore, we provide guidelines for the optimal choice of artificial noise power range, and the optimal transmission probability of covert information to maximize the detection errors at Willie. Our analysis shows that the transmission of artificial noise, although causes self-interference, provides the opportunity of achieving covertness but its transmit power levels need to be managed carefully. We also demonstrate that the prior transmission probability of 0.5 is not always the best choice for achieving the maximum possible covertness, when the covert transmission probability and artificial noise power can be jointly optimized.

cs.IT↗

arXiv2018

Covert Communication Achieved by A Greedy Relay in Wireless Networks

Covert communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, we examine the possibility and achievable performance of covert communication in one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding the source's message, while the source tries to detect this covert transmission to discover the illegitimate usage of the resource (e.g., power, spectrum) allocated only for the purpose of forwarding source's information. We propose two strategies for the relay to transmit its covert information, namely fixed-rate and fixed-power transmission schemes, for which the source's detection limits are analysed in terms of the false alarm and miss detection rates and the achievable effective covert rates from the relay to destination are derived. Our examination determines the conditions under which the fixed-rate transmission scheme outperforms the fixed-power transmission scheme, and vice versa, which enables the relay to achieve the maximum effective covert rate. Our analysis indicates that the relay has to forward the source's message to shield its covert transmission and the effective covert rate increases with its forwarding ability (e.g., its maximum transmit power).

cs.IT↗