arXiv subjects

Shihao Yan

Publications and source records attributed to Shihao Yan.

At least 19 recordsLinked to original sources

arXiv2025

Sensing-Then-Beamforming: Robust Transmission Design for RIS-Empowered Integrated Sensing and Covert Communication

Traditional covert communication often relies on the knowledge of the warden's channel state information, which is inherently challenging to obtain due to the non-cooperative nature and potential mobility of the warden. The integration of sensing and communication technology provides a promising solution by enabling the legitimate transmitter to sense and track the warden, thereby enhancing transmission covertness. In this paper, we develop a framework for sensing-then-beamforming in reconfigurable intelligent surface (RIS)-empowered integrated sensing and covert communication (ISACC) systems, where the transmitter (Alice) estimates and tracks the mobile aerial warden's channel using sensing echo signals while simultaneously sending covert information to multiple legitimate users (Bobs) with the assistance of RIS, under the surveillance of the warden (Willie). Considering channel estimation errors, we formulate a robust non-convex optimization problem that jointly designs the communication beamformers, the sensing signal covariance matrix at Alice, and the phase shifts at the RIS to maximize the covert sum rate of Bobs while satisfying the constraints related to covert communication, sensing, transmitter power, and the unit modulus of the RIS elements. To solve this complex problem, we develop an efficient algorithm using alternating optimization, successive convex approximation, S-procedure, sequential rank-one constraint relaxation, and semidefinite relaxation techniques. Numerical results confirm the convergence of the proposed algorithm and demonstrate its effectiveness in tracking the warden's channel while ensuring robust covert transmission. Furthermore, the results highlight the advantages of using RIS to enhance the covert transmission rate compared to baseline schemes, and also illustrate the intricate trade-off between communication and sensing in ISACC systems.

cs.IT↗

arXiv2024

Designing Unimodular Waveforms for MIMO Radar Based on Manifold Optimization Method

In this paper, we design unimodular waveforms with good correlation properties for multi-input multi-output (MIMO) radar systems. Specifically, first, we analyze the geometric properties of the unimodular constraint in the fourth-order polynomial minimization problem using Riemannian geometry theory. By embedding it into the search space, we transform the original non-convex optimization problem into an unconstrained problem on a Riemannian manifold. Then, we construct the manifold corresponding to the search space and the operators required for the customized optimization algorithm. Second, we develop a customized low-complexity unimodular manifold gradient descent (UM-GD) algorithm on the constructed manifold to solve the optimization problem in the normal-scale case, and propose its acceleration version unimodular manifold accelerated gradient descent (UM-AGD) algorithm, to speed up the convergence. In the large-scale case, we transform the objective function into the form of a summation of a large but finite number of loss functions and develop a customized unimodular manifold stochastic variance reduced gradient (UM-SVRG) algorithm to solve this problem. Compared to the existing bechmark method, which has a computational complexity of roughly $\mathcal{O}(M^4+3M^2N+3|\mathcal{D}| |\hat{\Theta}|^2MN)$, UM-SVRG algorithm effectively reduces the computational complexity of each iteration to roughly $\mathcal{O}(|\mathcal{D}||\hat{\Theta}|^2MN)$. Thirdly, we provide theoretical guarantees of convergence for both the UM-GD and UM-SVRG algorithms through appropriate parameter selection, and prove that the proposed algorithms can converge to a stationary point. Finally, numerical examples demonstrate the effectiveness of the proposed UM-GD and UM-SVRG algorithms.

eess.SP↗

arXiv2023

Achieving Covert Communication With A Probabilistic Jamming Strategy

In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden's detection. The transmission status and power of the jammer are random and follow some priori probabilities. We first analyze the warden's detection performance as a function of the jammer's transmission probability, transmit power distribution, and Alice's transmit power. We then maximize the covert throughput from Alice to Bob subject to a covertness constraint, by designing the covert communication strategies from three different perspectives: Alice's perspective, the jammer's perspective, and the global perspective. Our analysis reveals that the minimum jamming power should not always be zero in the probabilistic jamming strategy, which is different from that in the continuous jamming strategy presented in the literature. In addition, we prove that the minimum jamming power should be the same as Alice's covert transmit power, depending on the covertness and average jamming power constraints. Furthermore, our results show that the probabilistic jamming can outperform the continuous jamming in terms of achieving a higher covert throughput under the same covertness and average jamming power constraints.

eess.SP↗

arXiv2023

Beamforming Design for IRS-and-UAV-Aided Two-Way Amplify-and-Forward Relay Networks in Maritime IoT

In this paper, an intelligent reflecting surface (IRS)-and-unmanned aerial vehicle (UAV)-assisted two-way amplify-and-forward (AF) relay network in maritime Internet of Things (IoT) is proposed, where ship1 ($\text{S}_1$) and ship2 ($\text{S}_2$) can be viewed as data collecting centers. To enhance the message exchange rate between $\text{S}_1$ and $\text{S}_2$, a problem of maximizing minimum rate is cast, where the variables, namely AF relay beamforming matrix and IRS phase shifts of two time slots, need to be optimized. To achieve a maximum rate, a low-complexity alternately iterative (AI) scheme based on zero forcing and successive convex approximation (LC-ZF-SCA) algorithm is presented. To obtain a significant rate enhancement, a high-performance AI method based on one step, semidefinite programming and penalty SCA (ONS-SDP-PSCA) is proposed. Simulation results show that by the proposed LC-ZF-SCA and ONS-SDP-PSCA methods, the rate of the IRS-and-UAV-assisted AF relay network surpass those of with random phase and only AF relay networks. Moreover, ONS-SDP-PSCA perform better than LC-ZF-SCA in aspect of rate.

cs.IT↗

arXiv2023

STAR-RIS-UAV Aided Coordinated Multipoint Cellular System for Multi-user Networks

Different with conventional reconfigurable intelligent surface (RIS), simultaneous transmitting and reflecting RIS (STAR-RIS) can reflect and transmit the signals to the receiver. In this paper, to serve more ground users and increase the deployment flexibility, we investigate an unmanned aerial vehicle equipped with a STAR-RIS (STAR-RIS-UAV) aided wireless communications for multi-user networks. Energy splitting (ES) and mode switching (MS) protocols are considered to control the reflection and transmission coefficients of STAR-RIS elements. To maximize the sum rate of the STAR-RIS-UAV aided coordinated multipoint cellular system for multi-user networks, the corresponding beamforming vectors as well as transmitted and reflected coefficients matrices are optimized. Specifically, instead of adopting the alternating optimization, we design an iteration method to optimize all variables for both ES and MS protocols at the same time. Simulation results reveal that STAR-RIS-UAV aided wireless communication system has a much higher sum rate than the system with conventional RIS or without RIS. Furthermore, the proposed structure is more flexible than a fixed STAR-RIS and could greatly promote the sum rate.

cs.IT↗

arXiv2023

Joint Beamforming and Phase Shift Design for Hybrid-IRS-and-UAV-aided Directional Modulation Network

Recently, intelligent reflecting surface (IRS) and unmanned aerial vehicle (UAV) have been introduced into wireless communication systems to enhance the performance of air-ground transmission. To make a good balance between performance, cost, and power consumption, a hybrid-IRS-and-UAV-assisted directional modulation (DM) network is investigated in this paper, where the hybrid IRS consists of passive and active reflecting elements. To maximize the achievable rate, three optimization algorithms, called maximum signal-to-noise ratio (SNR)-fractional programming (FP) (Max-SNR-FP), maximum SNR-equal amplitude reflecting (EAR) (Max-SNR-EAR), and maximum SNR-majorization-minimization (MM) (Max-SNR-MM), are proposed to jointly design the beamforming vector and phase shift matrix (PSM) of hybrid IRS by alternately optimizing one and giving another. The Max-SNR-FP method employs the successive convex approximation and FP methods to derive the beamforming vector and hybrid IRS PSM. The Max-SNR-EAR method adopts the maximum signal-to-leakage-noise ratio method and the criteria of phase alignment and EAR to design them. In addition, the Max-SNR-MM method utilizes the MM criterion to derive the IRS PSM. Simulation results show that the rates harvested by the proposed three methods are slightly lower than those of active IRS with higher power consumption, which are 35 percent higher than those of no IRS and random phase IRS, while passive IRS achieves only about 17 percent rate gain over the latter. Moreover, compared to Max-SNR-FP, the proposed Max-SNR-EAR and Max-SNR-MM methods make an obvious complexity degradation at the price of a slight performance loss.

cs.IT↗

arXiv2023

Low-Complexity Three-Dimensional AOA-Cross Geometric Center Localization Methods via Multi-UAV network

Angle of arrival (AOA) is widely used to locate a wireless signal emitter in unmanned aerial vehicle (UAV) localization. Compared with received signal strength (RSS) and time of arrival (TOA), it has higher accuracy and is not sensitive to time synchronization of the distributed sensors. However, there are few works focused on three-dimensional (3-D) scenario. Furthermore, although maximum likelihood estimator (MLE) has a relatively high performance, its computational complexity is ultra high. It is hard to employ it in practical applications. This paper proposed two multiplane geometric center based methods for 3-D AOA in UAV positioning. The first method could estimate the source position and angle measurement noise at the same time by seeking a center of the inscribed sphere, called CIS. Firstly, every sensor could measure two angles, azimuth angle and elevation angle. Based on that, two planes are constructed. Then, the estimated values of source position and angle noise are achieved by seeking the center and radius of the corresponding inscribed sphere. Deleting the estimation of the radius, the second algorithm, called MSD-LS, is born. It is not able to estimate angle noise but has lower computational complexity. Theoretical analysis and simulation results show that proposed methods could approach the Cramer-Rao lower bound (CRLB) and have lower complexity than MLE.

eess.SP↗

arXiv2022

Two Rapid Power Iterative DOA Estimators for UAV Emitter Using Massive/Ultra-massive Receive Array

To provide rapid direction finding (DF) for unmanned aerial vehicle (UAV) emitter in future wireless networks, a low-complexity direction of arrival (DOA) estimation architecture for massive multiple input multiple output (MIMO) receiver arrays is constructed. In this paper, we propose two strategies to address the extremely high complexity caused by eigenvalue decomposition of the received signal covariance matrix. Firstly, a rapid power-iterative rotational invariance (RPI-RI) method is proposed, which adopts the signal subspace generated by power iteration to gets the final direction estimation through rotational invariance between subarrays. RPI-RI makes a significant complexity reduction at the cost of a substantial performance loss. In order to further reduce the complexity and provide a good directional measurement result, a rapid power-iterative Polynomial rooting (RPI-PR) method is proposed, which utilizes the noise subspace combined with polynomial solution method to get the optimal direction estimation. In addition, the influence of initial vector selection on convergence in the power iteration is analyzed, especially when the initial vector is orthogonal to the incident wave. Simulation results show that the two proposed methods outperform the conventional DOA estimation methods in terms of computational complexity. In particular, the RPIPR method achieves more than two orders of magnitude lower complexity than conventional methods and achieves performance close to CRLB. Moreover, it is verified that the initial vector and the relative error have a significant impact on the performance of the computational complexity.

cs.IT↗

arXiv2022

Machine Learning Methods for Inferring the Number of UAV Emitters via Massive MIMO Receive Array

To provide important prior knowledge for the DOA estimation of UAV emitters in future wireless networks, we present a complete DOA preprocessing system for inferring the number of emitters via massive MIMO receive array. Firstly, in order to eliminate the noise signals, two high-precision signal detectors, square root of maximum eigenvalue times minimum eigenvalue (SR-MME) and geometric mean (GM), are proposed. Compared to other detectors, SR-MME and GM can achieve a high detection probability while maintaining extremely low false alarm probability. Secondly, if the existence of emitters is determined by detectors, we need to further confirm their number. Therefore, we perform feature extraction on the the eigenvalue sequence of sample covariance matrix to construct feature vector and innovatively propose a multi-layer neural network (ML-NN). Additionally, the support vector machine (SVM), and naive Bayesian classifier (NBC) are also designed. The simulation results show that the machine learning-based methods can achieve good results in signal classification, especially neural networks, which can always maintain the classification accuracy above 70\% with massive MIMO receive array. Finally, we analyze the classical signal classification methods, Akaike (AIC) and Minimum description length (MDL). It is concluded that the two methods are not suitable for scenarios with massive MIMO arrays, and they also have much worse performance than machine learning-based classifiers.

eess.SP↗

arXiv2021

DOA Estimation for Hybrid Massive MIMO Systems using Mixed-ADCs: Performance Loss and Energy Efficiency

Due to the power consumption and high circuit cost in antenna arrays, the practical application of massive multiple-input multiple-output (MIMO) in the sixth generation (6G) and future wireless networks is still challenging. Employing low-resolution analog-to-digital converters (ADCs) and hybrid analog and digital (HAD) structure is two low-cost choice with acceptable performance loss.In this paper, the combination of the mixed-ADC architecture and HAD structure employed at receiver is proposed for direction of arrival (DOA) estimation, which will be applied to the beamforming tracking and alignment in 6G. By adopting the additive quantization noise model, the exact closed-form expression of the Cram\'{e}r-Rao lower bound (CRLB) for the HAD architecture with mixed-ADCs is derived. Moreover, the closed-form expression of the performance loss factor is derived as a benchmark. In addition, to take power consumption into account, energy efficiency is also investigated in our paper. The numerical results reveal that the HAD structure with mixed-ADCs can significantly reduce the power consumption and hardware cost. Furthermore, that architecture is able to achieve a better trade-off between the performance loss and the power consumption. Finally, adopting 2-4 bits of resolution may be a good choice in practical massive MIMO systems.

cs.IT↗

arXiv2021

Probabilistic Accumulate-then-Transmit in Wireless-Powered Covert Communications

In this paper, we investigate the optimal design of a wireless-powered covert communication (WP-CC) system, in which a probabilistic accumulate-then-transmit (ATT) protocol is proposed to maximize the communication covertness subject to a quality-of-service (QoS) requirement on communication. Specifically, in the considered WP-CC system, a full-duplex (FD) receiver transmits artificial noise (AN) to simultaneously charge an energy-constrained transmitter and to confuse a warden's detection on the transmitter's communication activity. With the probabilistic ATT protocol, the transmitter sends its information with a prior probability, i.e., $p$, conditioned on the available energy being sufficient. Our analysis shows that the probabilistic ATT protocol can achieve higher covertness than the traditional ATT protocol with $p=1$. In order to facilitate the optimal design of the WP-CC system, we also derive the warden's minimum detection error probability and characterize the effective covert rate from the transmitter to the receiver to quantify the communication covertness and quality, respectively. The derived analytical results facilitate the joint optimization of the probability $p$ and the information transmit power. We further present the optimal design of a cable-powered covert communication (CP-CC) system as a benchmark for comparison. Our simulation shows that the proposed probabilistic ATT protocol (with a varying $p$) can achieve the covertness upper bound determined by the CP-CC system, while the traditional ATT protocol (with $p=1$) cannot, which again confirms the benefits brought by the proposed probabilistic ATT in covert communications.

cs.IT↗

arXiv2021

Intelligent Reflecting Surface for Wireless Communication Security and Privacy

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.

cs.IT↗

arXiv2021

UAV-Enabled Cooperative Jamming for Covert Communications

This work employs an unmanned aerial vehicle (UAV) as a jammer to aid a covert communication from a transmitter Alice to a receiver Bob, where the UAV transmits artificial noise (AN) with random power to deliberately create interference to a warden Willie. In the considered system, the UAV's trajectory is critical to the covert communication performance, since the AN transmitted by the UAV also generates interference to Bob. To maximize the system performance, we formulate an optimization problem to jointly design the UAV's trajectory and Alice's transmit power. The formulated optimization problem is non-convex and is normally solved by a conventional iterative (CI) method, which requires multiple approximations based on Taylor expansions and an initialization on the UAV's trajectory. In order to eliminate these requirements, this work, for the first time, develops a geometric (GM) method to solve the optimization problem. By analyzing the covertness constraint, the GM method decouples the joint optimization into optimizing the UAV's trajectory and Alice's transmit power separately. Our examination shows that the GM method can significantly outperform the CI method in terms of achieving a higher average covert rate and the complexity of the GM method is lower than that of the CI method.

cs.IT↗

arXiv2020

Intelligent Reflecting Surface (IRS)-Aided Covert Wireless Communications with Delay Constraint

This work examines the performance gain achieved by deploying an intelligent reflecting surface (IRS) in covert communications. To this end, we formulate the joint design of the transmit power and the IRS reflection coefficients by taking into account the communication covertness for the cases with global channel state information (CSI) and without a warden's instantaneous CSI. For the case of global CSI, we first prove that perfect covertness is achievable with the aid of the IRS even for a single-antenna transmitter, which is impossible without an IRS. Then, we develop a penalty successive convex approximation (PSCA) algorithm to tackle the design problem. Considering the high complexity of the PSCA algorithm, we further propose a low-complexity two-stage algorithm, where analytical expressions for the transmit power and the IRS's reflection coefficients are derived. For the case without the warden's instantaneous CSI, we first derive the covertness constraint analytically facilitating the optimal phase shift design. Then, we consider three hardware-related constraints on the IRS's reflection amplitudes and determine their optimal designs together with the optimal transmit power. Our examination shows that significant performance gain can be achieved by deploying an IRS into covert communications.

cs.IT↗

arXiv2020

Neural Network Architectures for Location Estimation in the Internet of Things

Artificial Intelligence (AI) solutions for wireless location estimation are likely to prevail in many real-world scenarios. In this work, we demonstrate for the first time how the Cramer-Rao upper bound on localization accuracy can facilitate efficient neural-network solutions for wireless location estimation. In particular, we demonstrate how the number of neurons for the network can be intelligently chosen, leading to AI location solutions that are not time-consuming to run and less likely to be plagued by over-fitting. Experimental verification of our approach is provided. Our new algorithms are directly applicable to location estimates in many scenarios including the Internet of Things, and vehicular networks where vehicular GPS coordinates are unreliable or need verifying. Our work represents the first successful AI solution for a communication problem whose neural-network design is based on fundamental information-theoretic constructs. We anticipate our approach will be useful for a wide range of communication problems beyond location estimation.

eess.SP↗

arXiv2020

Optimal Transmit Power and Flying Location for UAV Covert Wireless Communications

This paper jointly optimizes the flying location and wireless communication transmit power for an unmanned aerial vehicle (UAV) conducting covert operations. This is motivated by application scenarios such as military ground surveillance from airborne platforms, where it is vital for a UAV's signal transmission to be undetectable by those within the surveillance region. Specifically, we maximize the communication quality to a legitimate ground receiver outside the surveillance region, subject to: a covertness constraint, a maximum transmit power constraint, and a physical location constraint determined by the required surveillance quality. We provide an explicit solution to the optimization problem for one of the most practical constraint combinations. For other constraint combinations, we determine feasible regions for flight, that can then be searched to establish the UAV's optimal location. In many cases, the 2-dimensional optimal location is achieved by a 1-dimensional search. We discuss two heuristic approaches to UAV placement, and show that in some cases they are able to achieve close to optimal, but that in other cases significant gains can be achieved by employing our developed solutions.

cs.IT↗

arXiv2020

Covert Communications with Constrained Age of Information

In this letter, we consider the requirement of information freshness in covert communications for the first time. With artificial noise (AN) generated from a full-duplex (FD) receiver, we formulate a covertness maximization problem under the average age of information (AoI) constraint to optimize the transmit probability of information signal. In particular, the transmit probability not only represents the generation rate of information signal but also represents the prior probability of the alternative hypothesis in covert communications, which builds up a bridge between information freshness and communication covertness. Our analysis shows that the best transmit probability is not always 0.5, which differs from the equal prior probabilities assumption in most related works on covert communications. Furthermore, the limitation of average AoI enlarges the transmit probability at the cost of the covertness reduction and leads to a positive lower bound on the information transmit power for non-zero covertness.

cs.IT↗

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↗