Searcharxiv⌕ Search

arXiv subjects

Zan Li

Publications and source records attributed to Zan Li.

54 records · Page 3Linked to original sources

Generative Adversarial Network for Probabilistic Forecast of Random Dynamical System

We present a deep learning model for data-driven simulations of random dynamical systems without a distributional assumption. The deep learning model consists of a recurrent neural network, which aims to learn the time marching structure, and a generative adversarial network (GAN) to learn and sample from the probability distribution of the random dynamical system. Although GANs provide a powerful tool to model a complex probability distribution, the training often fails without a proper regularization. Here, we propose a regularization strategy for a GAN based on consistency conditions for the sequential inference problems. First, the maximum mean discrepancy (MMD) is used to enforce the consistency between conditional and marginal distributions of a stochastic process. Then, the marginal distributions of the multiple-step predictions are regularized by using MMD or from multiple discriminators. The behavior of the proposed model is studied by using three stochastic processes with complex noise structures.

cs.LG↗

Optimal Grouping Strategy for Reconfigurable Intelligent Surface Assisted Wireless Communications

The channel estimation overhead of reconfigurable intelligent surface (RIS) assisted communication systems can be prohibitive. Prior works have demonstrated via simulations that grouping neighbouring RIS elements can help to reduce the pilot overhead and improve achievable rate. In this paper, we present an analytical study of RIS element grouping. We derive a tight closed-form upper bound for the achievable rate and then maximize it with respect to the group size. Our analysis reveals that more coarse-grained grouping is important-when the channel coherence time is low (high mobility scenarios) or the transmit power is large. We also demonstrate that optimal grouping can yield significant performance improvements over simple `On-Off' RIS element switching schemes that have been recently considered.

cs.IT↗

Wireless Covert Communications Aided by Distributed Cooperative Jamming over Slow Fading Channels

In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication from being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.

cs.IT↗

Covert Transmission Assisted by Intelligent Reflecting Surface

Covert transmission is studied for an intelligent reflecting surface (IRS) aided communication system, where Alice aims to transmit messages to Bob without being detected by the warden Willie. Specifically, an IRS is used to increase the data rate at Bob under a covert constraint. For the considered model, when Alice is equipped with a single antenna, the transmission power at Alice and phase shifts at the IRS are jointly optimized to maximize the covert transmission rate with either instantaneous or partial channel state information (CSI) of Willie's link. In addition, when multiple antennas are deployed at Alice, we formulate a joint transmit beamforming and IRS phase shift optimization problem to maximize the covert transmission rate. One optimal algorithm and two low-complexity suboptimal algorithms are proposed to solve the problem. Furthermore, for the case of imperfect CSI of Willie's link, the optimization problem is reformulated by using the triangle and the Cauchy-Schwarz inequalities. The reformulated optimization problems are solved using an alterative algorithm, semidefinite relaxation (SDR) and Gaussian randomization techniques. Finally, simulations are performed to verify our analysis. The simulation results show that an IRS can degrade the covert transmission rate when Willie is closer to the IRS than Bob.

cs.IT↗

Covert Communication in Intelligent Reflecting Surface-Assisted NOMA Systems: Design, Analysis, and Optimization

In this paper, we investigate covert communication in an intelligent reflecting surface (IRS)-assisted non-orthogonal multiple access (NOMA) system, where a legitimate transmitter (Alice) applies NOMA for downlink and uplink transmissions with a covert user (Bob) and a public user (Roy) aided by an IRS. Specifically, we propose new IRS-assisted downlink and uplink NOMA schemes to hide the existence of Bob's covert transmission from a warden (Willie), which cost-effectively exploit the phase-shift uncertainty of the IRS and the non-orthogonal signal transmission of Roy as the cover medium without requiring additional uncertainty sources. Assuming the worst-case covert communication scenario where Willie can optimally adjust the detection threshold for his detector, we derive an analytical expression for the minimum average detection error probability of Willie achieved by each of the proposed schemes. To further enhance the covert communication performance, we propose to maximize the covert rates of Bob by jointly optimizing the transmit power and the IRS reflect beamforming, subject to given requirements on the covertness against Willie and the quality-of-service (QoS) at Roy. Simulation results demonstrate the covertness advantage of the proposed schemes and confirm the accuracy of the derived analytical results. Interestingly, it is found that covert communication is impossible without using IRS or NOMA for the considered setup while the proposed schemes can always guarantee positive covert rates.

cs.IT↗

Secure Two-Way Communications via Intelligent Reflecting Surfaces

In this letter, we propose to exploit an intelligent reflecting surface (IRS) to secure multiuser two-way communications. Specifically, two end users simultaneously transmit their signals, where the signal of one user is exploited as information jamming to disrupt the reception of the other user's signal at an eavesdropper. A simple user scheduling scheme is developed to improve the secrecy rate. Analytical results in terms of a lower bound on the average secrecy rate and its scaling laws are derived to evaluate the secrecy performance and obtain valuable design insights. Simulation results are provided to confirm the accuracy of the theoretical analysis and validate the secrecy improvement of the proposed scheme over other baseline schemes.

cs.IT↗

Physical Layer Security Enhancement Using Artificial Noise in Cellular Vehicle-to-Everything (C-V2X) Networks

The secure transmission of confidential information in cellular vehicle-to-everything (C-V2X) communication networks is vitally important for user's personal safety. However, for C-V2X there have not been much studies on the physical layer security (PLS). Since artificial noise (AN) and secure beamforming are popular PLS techniques for cellular communications, in this paper we investigate the potential of these PLS techniques for enhancing the security of C-V2X networks. In particular, leveraging stochastic geometry, we study the PLS of an AN assisted C-V2X network, where the locations of legitimate vehicular nodes, malicious vehicular nodes and road side units (RSUs) are modeled by Cox processes driven by a common Poisson line process (PLP), and the locations of cellular base stations (BSs) are modeled by a two-dimensional (2D) Poisson point process (PPP). Based on the maximum signal-to-interference-ratio (SIR) association scheme, we calculate the coverage probability of the network. We also derive bounds on the secrecy probability, which are validated by simulation results. Moreover, we obtain an analytical result of the effective secrecy throughput for characterizing the reliability and security of wiretap channels. Simulation results are given to validate the analytical result, and provide interesting insights into the impact of network parameters on the achievable secrecy performance. Simulation results show that a larger array antenna can provide a better robustness of the secure transmission strategy, and the optimal power allocation ratio between confidential information and AN remains almost unchanged for different numbers of antennas.

cs.IT↗

Covert Surveillance via Proactive Eavesdropping Under Channel Uncertainty

Surveillance performance is studied for a wireless eavesdropping system, where a full-duplex legitimate monitor eavesdrops a suspicious link efficiently with the artificial noise (AN) assistance. Different from the existing work in the literature, the suspicious receiver in this paper is assumed to be capable of detecting the presence of AN. Once such receiver detects the AN, the suspicious user will stop transmission, which is harmful for the surveillance performance. Hence, to improve the surveillance performance, AN should be transmitted covertly with a low detection probability by the suspicious receiver. Under these assumptions, an optimization problem is formulated to maximize the eavesdropping non-outage probability under a covert constraint. Based on the detection ability at the suspicious receiver, a novel scheme is proposed to solve the optimization problem by iterative search. Moreover, we investigate the impact of both the suspicious link uncertainty and the jamming link uncertainty on the covert surveillance performance. Simulations are performed to verify the analyses. We show that the suspicious link uncertainty benefits the surveillance performance, while the jamming link uncertainty can degrade the surveillance performance.

eess.SP↗

Cooperative Jamming for Secure Transmission With Both Active and Passive Eavesdroppers

Secrecy transmission is investigated for a cooperative jamming scheme, where a multi-antenna jam-mer generates artificial noise (AN) to confuse eavesdroppers. Two kinds of eavesdroppers are considered: passive eavesdroppers who only overhear the legitimate information, and active eavesdroppers who not only overhear the legitimate information but also jam the legitimate signal. Existing works only treat the passive and active eavesdroppers separately. Different from the existing works, we investigate the achievable secrecy rate in presence of both active and passive eavesdroppers. For the considered system model, we assume that the instantaneous channel state information (CSI) of the active eavesdroppers is available at the jammer, while only partial CSI of the passive eavesdroppers is available at the jammer. A new zero-forcing beamforming scheme is proposed in the presence of both active and passive eavesdroppers. For both the perfect and imperfect CSI cases, the total transmission power allocation between the information and AN signals is optimized to maximize the achievable secrecy rate. Numerical results show that imperfect CSI between the jammer and the legitimate receiver will do more harm to the achievable secrecy rate than imperfect CSI between the jammer and the active eavesdropper.

eess.SP↗

Mobile Edge Computing in Unmanned Aerial Vehicle Networks

Unmanned aerial vehicle (UAV)-enabled communication networks are promising in the fifth and beyond wireless communication systems. In this paper, we shed light on three UAV-enabled mobile edge computing (MEC) architectures. Those architectures have been receiving ever increasing research attention for improving computation performance and decreasing execution latency by integrating UAV into MEC networks. We present a comprehensive survey for the state-of-the-art research in this domain. Important implementation issues are clarified. Moreover, in order to provide an enlightening guidance for future research directions, key challenges and open issues are discussed.

eess.SP↗

Energy-Efficient Hybrid Precoding for Massive MIMO mmWave Systems With a Fully-Adaptive-Connected Structure

This paper investigates the hybrid precoding design in millimeter-wave (mmWave) systems with a fully-adaptive-connected precoding structure, where a switch-controlled connection is deployed between every antenna and every radio frequency (RF) chain. To maximally enhance the energy efficiency (EE) of hybrid precoding under this structure, the joint optimization of switch-controlled connections and the hybrid precoders is formulated as a large-scale mixed-integer non-convex problem with high-dimensional power constraints. To efficiently solve such a challenging problem, we first decouple it into a continuous hybrid precoding (CHP) subproblem. Then, with the hybrid precoder obtained from the CHP subproblem, the original problem can be equivalently reformulated as a discrete connection-state (DCS) problem with only 0-1 integer variables. For the CHP subproblem, we propose an alternating hybrid precoding (AHP) algorithm. Then, with the hybrid precoder provided by the AHP algorithm, we develop a matching assisted fully-adaptive hybrid precoding (MA-FAHP) algorithm to solve the DCS problem. It is theoretically shown that the proposed MA-FAHP algorithm always converges to a stable solution with the polynomial complexity. Finally, simulation results demonstrate that the superior performance of the proposed MA-FAHP algorithm in terms of EE and beampattern.

eess.SP↗

Mode Hopping for Anti-Jamming in Cognitive Radio Networks

Frequency hopping (FH) is an effective anti-jamming technology in cognitive radio networks (CRNs). However, it is difficult to significantly increase the anti-jamming results because of the growing crowded spectrum in wireless communications. Orbital momentum angular (OAM) provides a new mode dimension for anti-jamming without consuming extra power and frequency resources in CRNs. In this paper, we propose the mode-frequency hopping (MFH) scheme, which jointly uses the mode hopping and the traditional FH scheme for anti-jamming to significantly increase the capacity of secondary users (SUs). We derive the false alarm probability and transmission outage probability for CRNs under our proposed MFH scheme. Then, based on the two derived probabilities, we calculate the capacity of SUs under the MFH scheme. Numerical results show that our developed MFH scheme can achieve better anti-jamming results as compared with the traditional FH scheme in CRNs.

eess.SP↗

Secrecy Outage Performance of Multi-antenna Wiretap Channels With Diversity Combinings Over Correlated Rayleigh Fading Channels

This paper presents a detailed secrecy outage performance analysis of correlated multi-antenna wiretap channels with three popular diversity combining schemes, namely maximal ratio combining, selection combining, and equal gain combining at the legitimate receiver. For single input multiple output wiretap channels, both exact and asymptotic expressions are derived for the secrecy outage probability (SOP) of these systems. The findings suggest that, compared with the scenario where all the channels are independent, correlation of the main channels alone increases the SOP by a factor of 1/ det(U), where det(U) is the determinant of correlation matrix U. In contrast, in the high signal-to-noise ratio regime at the legitimate receiver, correlation between the main channels and the eavesdropper channels has a positive effect on SOP. Moreover, for multiple input and multiple output wiretap channels, the SOP of two transmit antenna selection (TAS) schemes are analyzed for the considered correlated channel model. The SOP relationship of the both TAS schemes is quantified by the secrecy array gain. Finally, numerical simulations are conducted to corroborate the analytical results.

cs.IT↗

State of the Art, Taxonomy, and Open Issues on Cognitive Radio Networks with NOMA

The explosive growth of mobile devices and the rapid increase of wideband wireless services call for advanced communication techniques that can achieve high spectral efficiency and meet the massive connectivity requirement. Cognitive radio (CR) and non-orthogonal multiple access (NOMA) are envisioned to be important solutions for the fifth generation wireless networks. Integrating NOMA techniques into CR networks (CRNs) has the tremendous potential to improve spectral efficiency and increase the system capacity. However, there are many technical challenges due to the severe interference caused by using NOMA. Many efforts have been made to facilitate the application of NOMA into CRNs and to investigate the performance of CRNs with NOMA. This article aims to survey the latest research results along this direction. A taxonomy is devised to categorize the literature based on operation paradigms, enabling techniques, design objectives and optimization characteristics. Moreover, the key challenges are outlined to provide guidelines for the domain researchers and designers to realize CRNs with NOMA. Finally, the open issues are discussed.

cs.NI↗

Ultra-Dense HetNets Meet Big Data: Green Frameworks, Techniques, and Approaches

Ultra-dense heterogeneous networks (Ud-HetNets) have been put forward to improve the network capacity for next-generation wireless networks. However, counter to the 5G vision, ultra-dense deployment of networks would significantly increase energy consumption and thus decrease network energy efficiency suffering from the conventional worst-case network design philosophy. This problem becomes particularly severe when Ud-HetNets meet big data because of the traditional reactive request-transmit service mode. In view of these, this article first develops a big-data-aware artificial intelligent based framework for energy-efficient operations of Ud-HetNets. Based on the framework, we then identify four promising techniques, namely big data analysis, adaptive base station operation, proactive caching, and interference-aware resource allocation, to reduce energy cost on both large and small scales. We further develop a load-aware stochastic optimization approach to show the potential of our proposed framework and techniques in energy conservation. In a nutshell, we devote to constructing green Ud-HetNets of big data with the abilities of learning and inferring by improving the flexibility of control from worst-case to adaptive design and shifting the manner of services from reactive to proactive modes.

cs.IT↗

Robust Max-Min Fairness Energy Harvesting in Secure MISO Cognitive Radio With SWIPT

A multiple-input single-output cognitive radio downlink network is studied with simultaneous wireless information and power transfer. In this network, a secondary user coexists with multiple primary users and multiple energy harvesting receivers. In order to guarantee secure communication and energy harvesting, the problem of robust secure artificial noise-aided beamforming and power splitting design is investigated under imperfect channel state information. Specifically, the max-min fairness energy harvesting problem is formulated under the bounded channel state information error model. A one-dimensional search algorithm based on ${\cal S}\text{-Procedure} $ is proposed to solve the problem. It is shown that the optimal robust secure beamforming can be achieved. A tradeoff is elucidated between the secrecy rate of the secondary user receiver and the energy harvested by the energy harvesting receivers under a max-min fairness criterion.

cs.IT↗

Robust AN-Aided Beamforming and Power Splitting Design for Secure MISO Cognitive Radio With SWIPT

A multiple-input single-output cognitive radio downlink network is studied with simultaneous wireless information and power transfer. In this network, a secondary user coexists with multiple primary users and multiple energy harvesting receivers. In order to guarantee secure communication and energy harvesting, the problem of robust secure artificial noise-aided beamforming and power splitting design is investigated under imperfect channel state information (CSI). Specifically, the transmit power minimization problem and the max-min fairness energy harvesting problem are formulated for both the bounded CSI error model and the probabilistic CSI error model. These problems are non-convex and challenging to solve. A one-dimensional search algorithm is proposed to solve these problems based on ${\cal S}\text{-Procedure} $ under the bounded CSI error model and based on Bernstein-type inequalities under the probabilistic CSI error model. It is shown that the optimal robust secure beamforming can be achieved under the bounded CSI error model, whereas a suboptimal beamforming solution can be obtained under the probabilistic CSI error model. A tradeoff is elucidated between the secrecy rate of the secondary user receiver and the energy harvested by the energy harvesting receivers under a max-min fairness criterion.

cs.IT↗

On the Performance of Cooperative Spectrum Sensing under Quantization

In cognitive radio, the cooperative spectrum sensing (CSS) plays a key role in determining the performance of secondary networks. However, there have not been feasible approaches that can analytically calculate the performance of CSS with regard to the multi-level quantization. In this paper, we not only show the cooperative false alarm probability and cooperative detection probability impacted by quantization, but also formulate them by two closed form expressions. These two expressions enable the calculation of cooperative false alarm probability and cooperative detection probability tractable efficiently, and provide a feasible approach for optimization of sensing performance. Additionally, to facilitate this calculation, we derive Normal approximation for evaluating the sensing performance conveniently. Furthermore, two optimization methods are proposed to achieve the high sensing performance under quantization.

cs.IT↗