SearcharxivSearch

arXiv subjects

Jiangbo Si

Publications and source records attributed to Jiangbo Si.

At least 19 recordsLinked to original sources

DRL-Based Robust Multi-Timescale Anti-Jamming Approaches under State Uncertainty

Owing to the openness of wireless channels, wireless communication systems are highly susceptible to malicious jamming. Most existing anti-jamming methods rely on the assumption of accurate sensing and optimize parameters on a single timescale. However, such methods overlook two practical issues: mismatched execution latencies across heterogeneous actions and measurement errors caused by sensor imperfections. Especially for deep reinforcement learning (DRL)-based methods, the inherent sensitivity of neural networks implies that even minor perturbations in the input can mislead the agent into choosing suboptimal actions, with potentially severe consequences. To ensure reliable wireless transmission, we establish a multi-timescale decision model that incorporates state uncertainty. Subsequently, we propose two robust schemes that sustain performance under bounded sensing errors. First, a Projected Gradient Descent-assisted Double Deep Q-Network (PGD-DDQN) algorithm is designed, which derives worst-case perturbations under a norm-bounded error model and applies PGD during training for robust optimization. Second, a Nonlinear Q-Compression DDQN (NQC-DDQN) algorithm introduces a nonlinear compression mechanism that adaptively contracts Q-value ranges to eliminate action aliasing. Simulation results indicate that, compared with the perfect-sensing baseline, the proposed algorithms show only minor degradation in anti-jamming performance while maintaining robustness under various perturbations, thereby validating their practicality in imperfect sensing conditions.

cs.IT

Outage-Aware Sum Rate Maximization in Movable Antennas-Enabled Systems

In this paper, we investigate the movable antennas (MAs)-enabled multiple-input-single-output (MISO) systems, where the base station (BS) equipped with multiple MAs serves multiple single-antenna user. The delay-sensitive scenario is considered, where users refrain from periodically sending training signals to the BS for channel estimations to avoid additional latency. As a result, the BS relies solely on the statistical channel state information (CSI) to transmit data with a fixed rate. Under this setup, we aim to maximize the outage-aware sum rate of all users, by jointly optimizing antenna positions and the transmit beamforming at the BS, while satisfying the given target outage probability requirement at each user. The problem is highly non-convex, primarily because the exact cumulative distribution function (CDF) of the received signal-to-interference-plus-noise ratio (SINR) of each user is difficult to derive. To simplify analysis and without comprising performance, we adopt the statistical CSI based zero-forcing beamforming design. We then introduce one important lemma to derive the tight mean and variance of the SINR. Leveraging these results, we further exploit the Laguerre series approximation to successfully derive the closedform and tight CDF of the SINR. Subsequently, the outageaware sum rate expression is presented but still includes complex structure with respect to antenna positions. Facing this challenge, the projected gradient ascent (PGA) method is developed to iteratively update antenna positions until convergence. Numerical results demonstrate the effectiveness of our proposed schemes compared to conventional fixed-position antenna (FPA) and other competitive benchmarks.

cs.IT

Subverting Flexible Multiuser Communications via Movable Antenna-Enabled Jammer

Movable antenna (MA) is an emerging technology which can reconfigure wireless channels via adaptive antenna position adjustments at transceivers, thereby bringing additional spatial degrees of freedom for improving system performance. In this paper, from a security perspective, we exploit the MAenabled legitimate jammer (MAJ) to subvert suspicious multiuser downlink communications consisting of one suspicious transmitter (ST) and multiple suspicious receivers (SRs). Specifically, our objective is to minimize the benefit (the sum rate of all SRs or the minimum rate among all SRs) of such suspicious communications, by jointly optimizing antenna positions and the jamming beamforming at the MAJ. However, the key challenge lies in that given the MAJ's actions, the ST can reactively adjust its power allocations to instead maximize its benefit for mitigating the unfavorable interference. Such flexible behavior of the ST confuses the optimization design of the MAJ to a certain extent. Facing this difficulty, corresponding to the above two different benefits: i) we respectively determine the optimal behavior of the ST given the MAJ's actions; ii) armed with these, we arrive at two simplified problems and then develop effective alternating optimization based algorithms to iteratively solve them. In addition to these, we also focus on the special case of two SRs, and reveal insightful conclusions about the deployment rule of antenna positions at the MAJ. Furthermore, we analyze the ideal antenna deployment scheme at the MAJ for achieving the globally performance lower bound. Numerical results demonstrate the effectiveness of our proposed schemes compared to conventional fixed-position antenna (FPA) and other competitive benchmarks.

cs.IT

Movable Frequency Diverse Array-Assisted Covert Communication With Multiple Wardens

The frequency diverse array (FDA) is highly promising for improving covert communication performance by adjusting the frequency of each antenna at the transmitter. However, when faced with the cases of multiple wardens and highly correlated channels, FDA is limited by the frequency constraint and cannot provide satisfactory covert performance. In this paper, we propose a novel movable FDA (MFDA) antenna technology where positions of the antennas can be dynamically adjusted in a given finite region. Specifically, we aim to maximize the covert rate by jointly optimizing the antenna beamforming vector, antenna frequency vector and antenna position vector. To solve this non-convex optimization problem with coupled variables, we develop a two-stage alternating optimization (AO) algorithm based on the block successive upper-bound minimization (BSUM) method. Moreover, considering the challenge of obtaining perfect channel state information (CSI) at multiple wardens, we study the case of imperfect CSI. Simulation results demonstrate that MFDA can significantly enhance covert performance compared to the conventional FDA. In particular, when the frequency constraint is strict, MFDA can further increase the covert rate by adjusting the positions of antennas instead of the frequencies.

eess.SP

Movable Frequency Diverse Array for Wireless Communication Security

Frequency diverse array (FDA) is a promising antenna technology to achieve physical layer security by varying the frequency of each antenna at the transmitter. However, when the channels of the legitimate user and eavesdropper are highly correlated, FDA is limited by the frequency constraint and cannot provide satisfactory security performance. In this paper, we propose a novel movable FDA (MFDA) antenna technology where the positions of antennas can be dynamically adjusted in a given finite region. Specifically, we aim to maximize the secrecy capacity by jointly optimizing the antenna beamforming vector, antenna frequency vector and antenna position vector. To solve this non-convex optimization problem with coupled variables, we develop a two-stage alternating optimization (AO) algorithm based on block successive upper-bound minimization (BSUM) method. Moreover, to evaluate the security performance provided by MFDA, we introduce two benchmark schemes, i.e., phased array (PA) and FDA. Simulation results demonstrate that MFDA can significantly enhance security performance compared to PA and FDA. In particular, when the frequency constraint is strict, MFDA can further increase the secrecy capacity by adjusting the positions of antennas instead of the frequencies.

eess.SP

Two-Timescale Design for Movable Antenna Array-Enabled Multiuser Uplink Communications

Movable antenna (MA) technology can flexibly reconfigure wireless channels by adjusting antenna positions in a local region, thus owing great potential for enhancing communication performance. This letter investigates MA technology enabled multiuser uplink communications over general Rician fading channels, which consist of a base station (BS) equipped with the MA array and multiple single-antenna users. Since it is practically challenging to collect all instantaneous channel state information (CSI) by traversing all possible antenna positions at the BS, we instead propose a two-timescale scheme for maximizing the ergodic sum rate. Specifically, antenna positions at the BS are first optimized using only the statistical CSI. Subsequently, the receiving beamforming at the BS (for which we consider the three typical zero-forcing (ZF), minimum mean-square error (MMSE) and MMSE with successive interference cancellation (MMSE-SIC) receivers) is designed based on the instantaneous CSI with optimized antenna positions, thus significantly reducing practical implementation complexities. The formulated problems are highly non-convex and we develop projected gradient ascent (PGA) algorithms to effectively handle them. Simulation results illustrate that compared to conventional fixed-position antenna (FPA) array, the MA array can achieve significant performance gains by reaping an additional spatial degree of freedom.

cs.IT

Movable Antennas-Enabled Two-User Multicasting: Do We Really Need Alternating Optimization for Minimum Rate Maximization?

Movable antenna (MA) technology, which can reconfigure wireless channels by flexibly moving antenna positions in a specified region, has great potential for improving communication performance. In this paper, we consider a new setup of MAs-enabled multicasting, where we adopt a simple setting in which a linear MA array-enabled source (${\rm{S}}$) transmits a common message to two single-antenna users ${\rm{U}}_1$ and ${\rm{U}}_2$. We aim to maximize the minimum rate among these two users, by jointly optimizing the transmit beamforming and antenna positions at ${\rm{S}}$. Instead of utilizing the widely-used alternating optimization (AO) approach, we reveal, with rigorous proof, that the above two variables can be optimized separately: i) the optimal antenna positions can be firstly determined via the successive convex approximation technique, based on the rule of maximizing the correlation between ${\rm{S}}$-${\rm{U}}_1$ and ${\rm{S}}$-${\rm{U}}_2$ channels; ii) afterwards, the optimal closed-form transmit beamforming can be derived via simple arguments. Compared to AO, this new approach yields the same performance but reduces the computational complexities significantly. Moreover, it can provide insightful conclusions which are not possible with AO.

cs.IT

Movable Antennas-Assisted Secure Transmission Without Eavesdroppers' Instantaneous CSI

Movable antenna (MA) technology is highly promising for improving communication performance, due to its advantage of flexibly adjusting positions of antennas to reconfigure channel conditions. In this paper, we investigate MAs-assisted secure transmission under a legitimate transmitter Alice, a legitimate receiver Bob and multiple eavesdroppers. Specifically, we consider a practical scenario where Alice has no any knowledge about the instantaneous non-line-of-sight component of the wiretap channel. Under this setup, we evaluate the secrecy performance by adopting the secrecy outage probability metric, the tight approximation of which is first derived by interpreting the Rician fading as a special case of Nakagami fading and concurrently exploiting the Laguerre series approximation. Then, we minimize the secrecy outage probability by jointly optimizing the transmit beamforming and positions of antennas at Alice. However, the problem is highly non-convex because the objective includes the complex incomplete gamma function. To tackle this challenge, we, for the first time, effectively approximate the inverse of the incomplete gamma function as a simple linear model. Based on this approximation, we arrive at a simplified problem with a clear structure, which can be solved via the developed alternating projected gradient ascent (APGA) algorithm. Considering the high complexity of the APGA, we further design another scheme where the zero-forcing based beamforming is adopted by Alice, and then we transform the problem into minimizing a simple function which is only related to positions of antennas at Alice.As demonstrated by simulations, our proposed schemes achieve significant performance gains compared to conventional schemes based on fixed-position antennas.

cs.IT

Fluid Antennas-Enabled Multiuser Uplink: A Low-Complexity Gradient Descent for Total Transmit Power Minimization

We investigate multiuser uplink communication from multiple single-antenna users to a base station (BS), which is equipped with a movable-antenna (MA) array and adopts zero-forcing receivers to decode multiple signals. We aim to optimize the MAs' positions at the BS, to minimize the total transmit power of all users subject to the minimum rate requirement. After applying transformations, we show that the problem is equivalent to minimizing the sum of each eigenvalue's reciprocal of a matrix, which is a function of all MAs' positions. Subsequently, the projected gradient descent (PGD) method is utilized to find a locally optimal solution. In particular, different from the latest related work, we exploit the eigenvalue decomposition to successfully derive a closed-form gradient for the PGD, which facilitates the practical implementation greatly. We demonstrate by simulations that via careful optimization for all MAs' positions in our proposed design, the total transmit power of all users can be decreased significantly as compared to competitive benchmarks.

cs.IT

Secure Wireless Communication via Movable-Antenna Array

Movable antenna (MA) array is a novel technology recently developed where positions of transmit/receive antennas can be flexibly adjusted in the specified region to reconfigure the wireless channel and achieve a higher capacity. In this letter, we, for the first time, investigate the MA array-assisted physical-layer security where the confidential information is transmitted from a MA array-enabled Alice to a single-antenna Bob, in the presence of multiple single-antenna and colluding eavesdroppers. We aim to maximize the achievable secrecy rate by jointly designing the transmit beamforming and positions of all antennas at Alice subject to the transmit power budget and specified regions for positions of all transmit antennas. The resulting problem is highly non-convex, for which the projected gradient ascent (PGA) and the alternating optimization methods are utilized to obtain a high-quality suboptimal solution. Simulation results demonstrate that since the additional spatial degree of freedom (DoF) can be fully exploited, the MA array significantly enhances the secrecy rate compared to the conventional fixed-position antenna (FPA) array.

cs.IT

Intelligent Reflecting Surface-Aided Wireless Communication with Movable Elements

Intelligent reflecting surface (IRS) has been recognized as a powerful technology for boosting communication performance. To reduce manufacturing and control costs, it is preferable to consider discrete phase shifts (DPSs) for IRS, which are set by default as uniformly distributed in the range of $[ - π,π)$ in the literature. Such setting, however, cannot achieve a desirable performance over the general Rician fading where the channel phase concentrates in a narrow range with a higher probability. Motivated by this drawback, we in this paper design optimal non-uniform DPSs for IRS to achieve a desirable performance level. The fundamental challenge is the \textit{possible offset in phase distribution across different cascaded source-element-destination channels}, if adopting conventional IRS where the position of each element is fixed. Such phenomenon leads to different patterns of optimal non-uniform DPSs for each IRS element and thus causes huge manufacturing costs especially when the number of IRS elements is large. Driven by the recently emerging fluid antenna system (or movable antenna technology), we demonstrate that if the position of each IRS element can be flexibly adjusted, the above phase distribution offset can be surprisingly eliminated, leading to the same pattern of DPSs for each IRS element. Armed with this, we then determine the form of unified non-uniform DPSs based on a low-complexity iterative algorithm. Simulations show that our proposed design significantly improves the system performance compared to competitive benchmarks.

cs.IT

A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-antenna Adversary

Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary's reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to Kullback-Leibler (KL) divergence constraint. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer's power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. In addition, the transmission strategy without jammer deception is studied as a benchmark. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in face of imperfect CSI.

eess.SP

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

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

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

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