arXiv subjects

Shihao Yan

Publications and source records attributed to Shihao Yan.

At least 55 records · Page 3Linked to original sources

arXiv2018

Secure Transmission to the Strong User with Optimal Power Allocation in NOMA

With non-orthogonal multiple access(NOMA), we tackle the maximization of the secrecy rate for the strong user subject to a maximum allowable secrecy outage probability, while guaranteeing a constraint on the transmission rate to the weak user. For the first time, the dependence between the eavesdropper's ability to conduct successive interference cancellation and her channel quality is considered. We determine the optimal power allocation and the redundancy rate, based on which the cost of security in terms of the reduction in the strong user's secrecy rate is examined and the benefits of NOMA for secure transmissions are explicitly revealed.

cs.IT↗

arXiv2018

Beamforming Design and Power Allocation for Secure Transmission with NOMA

In this work, we propose a novel beamforming design to enhance physical layer security of a non-orthogonal multiple access (NOMA) system with the aid of artificial noise (AN). The proposed design uses two scalars to balance the useful signal strength and interference at the strong and weak users, which is a generalized version of the existing beamforming designs in the context of physical layer security for NOMA. We determine the optimal power allocation among useful signals and AN together with the two optimal beamforming scalars in order to maximize the secrecy sum rate (SSR). Our asymptotic analysis in the high signal-to-noise ratio regime provides an efficient and near-optimal solution to optimizing the beamforming scalars and power allocation coefficients. Our analysis indicates that it is not optimal to form a beam towards either the strong user or the weak user in NOMA systems for security enhancement. In addition, the asymptotically optimal power allocation informs that, as the transmit power increases, more power should be allocated to the weak user or AN signals, while the power allocated to the strong user keeps constant. Our examination shows that the proposed novel beamforming design can significantly outperform two benchmark schemes.

cs.IT↗

arXiv2018

Covert Wireless Communication with a Poisson Field of Interferers

In this paper, we study covert communication in wireless networks consisting of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a Poisson field of interferers. Bob and Willie are subject to uncertain shot noise due to the ambient signals from interferers in the network. With the aid of stochastic geometry, we analyze the throughput of the covert communication between Alice and Bob subject to given requirements on the covertness against Willie and the reliability of decoding at Bob. We consider non-fading and fading channels. We analytically obtain interesting findings on the impacts of the density and the transmit power of the concurrent interferers on the covert throughput. That is, the density and the transmit power of the interferers have no impact on the covert throughput as long as the network stays in the interference-limited regime, for both the non-fading and the fading cases. When the interference is sufficiently small and comparable with the receiver noise, the covert throughput increases as the density or the transmit power of the concurrent interferers increases.

cs.IT↗

arXiv2018

Joint Beamforming and Power Allocation in Downlink NOMA Multiuser MIMO Networks

In this paper, a novel joint design of beamforming and power allocation is proposed for a multi-cell multiuser multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) network. In this network, base stations (BSs) adopt coordinated multipoint (CoMP) for downlink transmission. We study a new scenario where the users are divided into two groups according to their quality-of-service (QoS) requirements, rather than their channel qualities as investigated in the literature. Our proposed joint design aims to maximize the sum-rate of the users in one group with the best-effort while guaranteeing the minimum required target rates of the users in the other group. The joint design is formulated as a non-convex NP-hard problem. To make the problem tractable, a series of transformations are adopted to simplify the design problem. Then, an iterative suboptimal resource allocation algorithm based on successive convex approximation is proposed. In each iteration, a rank-constrained optimization problem is solved optimally via semidefinite program relaxation. Numerical results reveal that the proposed scheme offers significant sum-rate gains compared to the existing schemes and converges fast to a suboptimal solution.

cs.IT↗

arXiv2018

Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access

This work introduces downlink non-orthogonal multiple access (NOMA) into short-packet communications. NOMA has great potential to improve fairness and spectral efficiency with respect to orthogonal multiple access (OMA) for low-latency downlink transmission, thus making it attractive for the emerging Internet of Things. We consider a two-user downlink NOMA system with finite blocklength constraints, in which the transmission rates and power allocation are optimized. To this end, we investigate the trade-off among the transmission rate, decoding error probability, and the transmission latency measured in blocklength. Then, a one-dimensional search algorithm is proposed to resolve the challenges mainly due to the achievable rate affected by the finite blocklength and the unguaranteed successive interference cancellation. We also analyze the performance of OMA as a benchmark to fully demonstrate the benefit of NOMA. Our simulation results show that NOMA significantly outperforms OMA in terms of achieving a higher effective throughput subject to the same finite blocklength constraint, or incurring a lower latency to achieve the same effective throughput target. Interestingly, we further find that with the finite blocklength, the advantage of NOMA relative to OMA is more prominent when the effective throughput targets at the two users become more comparable.

cs.IT↗

arXiv2018

Location-Aware Pilot Allocation in Multi-Cell Multi-User Massive MIMO Networks

We propose a location-aware pilot allocation algorithm for a massive multiple-input multiple-output (MIMO) network with high-mobility users, where the wireless channels are subject to Rician fading. Pilot allocation in massive MIMO is a hard combinatorial problem and depends on the locations of users. As such, it is highly complex to achieve the optimal pilot allocation in real-time for a network with high-mobility users. Against this background, we propose a low-complexity pilot allocation algorithm, which exploits the behavior of line-of-sight (LOS) interference among the users and allocate the same pilot sequence to the users with small LOS interference. Our examination demonstrates that our proposed algorithm significantly outperforms the existing algorithms, even with localization errors. Specifically, for the system considered in this work, our proposed algorithm provides up to 37.26% improvement in sum spectral efficiency (SE) and improves the sum SE of the worst interference-affected users by up to 2.57 bits/sec/Hz, as compared to the existing algorithms.

cs.IT↗

arXiv2018

Secure Directional Modulation to Enhance Physical Layer Security in IoT Networks

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.

cs.IT↗

arXiv2018

On Channel Reciprocity to Activate Uplink Channel Training for Downlink Wireless Transmission in Tactile Internet Applications

We determine, for the first time, the requirement on channel reciprocity to activate uplink channel training, instead of downlink channel training, to achieve a higher data rate for the downlink transmission from a multi-antenna base station to a single-antenna user. We first derive novel closed-form expressions for the lower bounds on the data rates achieved by the two channel training strategies by considering the impact of finite blocklength. The performance comparison result of these two strategies is determined by the amount of channel reciprocity that is utilized in the uplink channel training. We then derive an approximated expression for the minimum channel reciprocity that enables the uplink channel training to outperform the downlink channel training. Through numerical results, we demonstrate that this minimum channel reciprocity decreases as the blocklength decreases or the number of transmit antennas increases, which shows the necessity and benefits of activating the uplink channel training for short-packet communications with multiple transmit antennas. This work provides pivotal and unprecedented guidelines on choosing channel training strategies and channel reciprocity calibrations, offering valuable insights into latency reduction in the Tactile Internet applications.

cs.IT↗

arXiv2017

Optimal Load Balancing in Millimeter Wave Cellular Heterogeneous Networks

In this paper, we propose a novel and effective approach to optimizing the load balancing in a millimeter wave (mmWave) cellular heterogeneous network (HetNet) with a macro-tier and a micro-tier. The unique characteristics of mmWave transmission are incorporated into the network by adopting the Poisson point process (PPP) for base station (BS) location, the line-of-sight (LoS) ball model for mmWave links, the sectored antenna model for key antenna array characteristics, and Nakagami-$m$ fading for wireless channels. To reduce the load of macro-tier BSs, we consider a bias factor $A_{s}$ in the network for offloading user equipments (UEs) to micro-tier BSs. For this network, we first analyze the loads of macro- and micro-tier BSs. Then we derive a new expression for the rate coverage probability of the network, based on which the optimal $A_{s}$ maximizing the rate coverage probability is found. Through numerical results, we demonstrate the correctness of our analysis and the validity of the optimal $A_{s}$. Importantly, the optimal $A_{s}$ can bring a profound improvement in the rate coverage probability relative to a fixed $A_{s}$. Furthermore, we evaluate the impact of various network parameters, e.g., the densities and the beamwidths of BSs, on the rate coverage probability and the optimal $A_{s}$, offering valuable guidelines into practical mmWave HetNet design.

cs.IT↗

arXiv2017

Covert Communications with A Full-Duplex Receiver over Wireless Fading Channels

In this work, we propose a covert communication scheme where the transmitter attempts to hide its transmission to a full-duplex receiver, from a warden that is to detect this covert transmission using a radiometer. Specifically, we first derive the detection error rate at the warden, based on which the optimal detection threshold for its radiometer is analytically determined and its expected detection error rate over wireless fading channels is achieved in a closed-form expression. Our analysis indicates that the artificial noise deliberately produced by the receiver with a random transmit power, although causes self-interference, offers the capability of achieving a positive effective covert rate for any transmit power (can be infinity) subject to any given covertness requirement on the expected detection error rate. This work is the first study on the use of the full-duplex receiver with controlled artificial noise for achieving covert communications and invites further investigation in this regard.

cs.IT↗

arXiv2017

Active Attack on User Load Achieving Pilot Design in Massive MIMO Networks

In this paper, we propose an active attacking strategy on a massive multiple-input multiple-output (MIMO) network, where the pilot sequences are obtained using the user load-achieving pilot sequence design. The user load-achieving design ensures that the signal-to-interference-plus-noise ratio (SINR) requirements of all the users in the massive MIMO networks are guaranteed even in the presence of pilot contamination. However, this design has some vulnerabilities, such as one known pilot sequence and the correlation among the pilot sequences, that may be exploited by active attackers. In this work, we first identify the potential vulnerabilities in the user load-achieving pilot sequence design and then, accordingly, develop an active attacking strategy on the network. In the proposed attacking strategy, the active attackers transmit known pilot sequences in the uplink training and artificial noise in the downlink data transmission. Our examination demonstrates that the per-cell user load region is significantly reduced by the proposed attacking strategy. As a result of the reduced per-cell user load region, the SINR requirements of all the users are no longer guaranteed in the presence of the active attackers. Specifically, for the worst affected users the SINR requirements may not be ensured even with infinite antennas at the base station.

cs.IT↗

arXiv2017

Short-Packet Communications in Non-Orthogonal Multiple Access Systems

This work introduces, for the first time, non-orthogonal multiple access (NOMA) into short-packet communications to achieve low latency in wireless networks. Specifically, we address the optimization of transmission rates and power allocation to maximize the effective throughput of the user with a higher channel gain while guaranteeing the other user achieving a certain level of effective throughput. To demonstrate the benefits of NOMA, we analyze the performance of orthogonal multiple access (OMA) as a benchmark. Our examination shows that NOMA can significantly outperform OMA by achieving a higher effective throughput with the same latency or incurring a lower latency to achieve the same effective throughput targets. Surprisingly, we find that the performance gap between NOMA and OMA becomes more prominent when the effective throughput targets at the two users become closer to each other. This demonstrates that NOMA can significantly reduce the latency in the context of short-packet communications with practical constraints.

cs.IT↗

arXiv2017

Covert Communication in Wireless Relay Networks

Covert communication aims to shield the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, for the first time we examine the possibility and achievable performance of covert communication in one-way relay networks. Specifically, the relay 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 recourse (e.g., power, spectrum) allocated only for the purpose of forwarding source's information. The necessary condition that the relay can transmit covertly without being detected is identified and the source's detection limit is derived in terms of the false alarm and miss detection rates. Our analysis indicates that boosting the forwarding ability of the relay (e.g., increasing its maximum transmit power) also increases its capacity to perform the covert communication in terms of achieving a higher effective covert rate subject to some specific requirement on the source's detection performance.

cs.IT↗

arXiv2017

Covert Communication in Fading Channels under Channel Uncertainty

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate public communication link while the warden tries to detect this covert communication by using a radiometer. We derive the exact expression for the radiometers optimal threshold which determines the performance limit of the wardens detector. Furthermore for given transmission outage constraints the achievable rates for legitimate and covert users are analyzed while maintaining a specific level of covertness. Our numerical results illustrate how the achievable performance is affected by the channel uncertainty and required level of covertness.

cs.IT↗

arXiv2017

Covert Communication with Finite Blocklength in AWGN Channels

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.

cs.IT↗

arXiv2016

On Covert Communication with Noise Uncertainty

Prior studies on covert communication with noise uncertainty adopted a worst-case approach from the warden's perspective. That is, the worst-case detection performance of the warden is used to assess covertness, which is overly optimistic. Instead of simply considering the worst limit, in this work, we take the distribution of noise uncertainty into account to evaluate the overall covertness in a statistical sense. Specifically, we define new metrics for measuring the covertness, which are then adopted to analyze the maximum achievable rate for a given covertness requirement under both bounded and unbounded noise uncertainty models.

cs.IT↗

arXiv2016

Artificial-Noise-Aided Secure Transmission with Directional Modulation based on Random Frequency Diverse Arrays

In this paper, we propose a novel directional modulation (DM) scheme based on random frequency diverse arrays with artificial noise (RFDA-DM-AN) to enhance physical layer security of wireless communications. Specifically, we first design the RFDA-DM-AN scheme by randomly allocating frequencies to transmit antennas, thereby achieving two-dimensionally (i.e., angle and range) secure transmissions, and outperforming the state-of-the-art one-dimensional (i.e., angle) phase array (PA) based DM scheme. Then we develop the closed-form expression of a lower bound on the ergodic secrecy capacity (ESC) of our RFDA-DM-AN scheme. Based on the theoretical lower bound derived, we further optimize the transmission power allocation between the useful signal and artificial noise (AN) in order to enhance the ESC. Simulation results show that 1) our RFDA-DM-AN scheme achieves a higher secrecy capacity than that of the PA based DM scheme, 2) the lower bound derived is shown to approach the ESC as the number of transmit antennas N increases and precisely matches the ESC when N is sufficiently large, and 3) the proposed optimum power allocation achieves the highest ESC compared with other power allocations in the RFDA-DM-AN.

cs.IT↗

arXiv2016

Artificial-Noise-Aided Secure Transmission in Wiretap Channels with Transmitter-Side Correlation

This work for the first time examines the impact of transmitter-side correlation on the artificial-noise-aided secure transmission, based on which a new power allocation strategy for artificial noise (AN) is devised for physical layer security enhancement. Specifically, we design a correlation-based power allocation (CPA) for AN, of which the optimality in terms of achieving the minimum secrecy outage probability is analytically proved in the large system regime with the number of transmit antennas approaching infinity. In order to fully reveal the benefits of the CPA, we derive easy-to-evaluate expressions for the secrecy outage probability achieved by the CPA. Our study demonstrates that the CPA is nearly optimal and significantly outperforms the widely-used uniform power allocation (UPA) even for a moderately small number of correlated transmit antennas. Furthermore, our numerical results reveal a fundamental difference between the CPA and UPA. That is when the number of correlated transmit antennas increases, the secrecy outage probability of the CPA always reduces while the secrecy outage probability of the UPA suffers from a saturation point.

cs.IT↗