Xin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xin Chen has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Tong-Xing Zheng
School of Information and Communications Engineering, Xian Jiaotong University, Xian, China
6 shared publications - Derrick Wing Kwan Ng
University of New South Wales
2 shared publications - Jinhong Yuan
University of New South Wales
2 shared publications - Xinji Wang
Huawei Technologies Company Ltd., Shanghai, China
2 shared publications - Ying Ju
School of Telecommunications Engineering, Xidian University, Xi’an 710071, China
2 shared publications - Chao Wang
Integrated Service Networks Laboratory, Xidian University, Xian, China
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 5477-5481
Sensing-Assisted Secure Communication via Reconfigurable Intelligent Surface
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 5477-5481
Sensing-Assisted Secure Communication via Reconfigurable Intelligent Surface
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (19) , 40822-40836
Reconfigurable-Intelligent-Surface-Enabled Green and Secure Offloading for Mobile Edge Computing Networks
This article investigates a multiuser uplink mobile edge computing (MEC) network, where the users offload partial tasks securely to an access point (AP) under the nonorthogonal multiple access policy with the aid of a reconfigurable intelligent surface (RIS) against a multiantenna eavesdropper. We formulate a nonconvex optimization problem of minimizing the total energy consumption subject to secure offloading requirement, and we build an efficient block coordinate descent framework to iteratively optimize the number of local computation bits and transmit power at the users, the RIS phase shifts, and the multiuser detection matrix at the AP. Specifically, we successively adopt successive convex approximation, semi-definite programming, and semidefinite relaxation to solve the problem with perfect eavesdropper’s channel state information (CSI), and we then employ S-procedure and penalty convex-concave to achieve robust design for the imperfect CSI case. We provide extensive numerical results to validate the convergence and effectiveness of the proposed algorithms. We demonstrate that RIS plays a significant role in realizing a secure and energy-efficient MEC network, and deploying a well-designed RIS can save energy consumption by up to 60% compared to that without RIS. We further reveal impacts of various key factors on the secrecy energy efficiency, including RIS element number and deployment position, user number, task scale and duration, and CSI imperfection.
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (19) , 40822-40836
Reconfigurable-Intelligent-Surface-Enabled Green and Secure Offloading for Mobile Edge Computing Networks
This article investigates a multiuser uplink mobile edge computing (MEC) network, where the users offload partial tasks securely to an access point (AP) under the nonorthogonal multiple access policy with the aid of a reconfigurable intelligent surface (RIS) against a multiantenna eavesdropper. We formulate a nonconvex optimization problem of minimizing the total energy consumption subject to secure offloading requirement, and we build an efficient block coordinate descent framework to iteratively optimize the number of local computation bits and transmit power at the users, the RIS phase shifts, and the multiuser detection matrix at the AP. Specifically, we successively adopt successive convex approximation, semi-definite programming, and semidefinite relaxation to solve the problem with perfect eavesdropper’s channel state information (CSI), and we then employ S-procedure and penalty convex-concave to achieve robust design for the imperfect CSI case. We provide extensive numerical results to validate the convergence and effectiveness of the proposed algorithms. We demonstrate that RIS plays a significant role in realizing a secure and energy-efficient MEC network, and deploying a well-designed RIS can save energy consumption by up to 60% compared to that without RIS. We further reveal impacts of various key factors on the secrecy energy efficiency, including RIS element number and deployment position, user number, task scale and duration, and CSI imperfection.
- 18 July 2025
- Published by Springer Nature
- p. 399-412
SkyChain: Secure Federated Learning with Model Validation in LEO Satellite Constellations
- 18 July 2025
- Published by Springer Nature
- p. 399-412
SkyChain: Secure Federated Learning with Model Validation in LEO Satellite Constellations
- 17 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 1934-1948
Reconfigurable Intelligent Surface-Aided Secure Integrated Radar and Communication Systems
Despite the enhanced spectral efficiency brought by the integrated radar and communication technique, it poses significant risks to communication security when confronted with malicious radar targets. To address this issue, a reconfigurable intelligent surface (RIS)-aided transmission scheme is proposed to improve secure communication in two systems, i.e., the radar and communication co-existing (RCCE) system, where a single transmitter is utilized for both radar sensing and communication, and the dual-functional radar and communication (DFRC) system. At the design stage, optimization problems are formulated to maximize the secrecy rate while satisfying the radar detection constraint via joint active beamforming at the base station and passive beamforming of RIS in both systems. Particularly, a zero-forcing-based block coordinate descent (BCD) algorithm is developed for the RCCE system. Besides, the Dinkelbach method combined with semidefinite relaxation is employed for the DFRC system, and to further reduce the computational complexity, a Riemannian conjugate gradient-based alternating optimization algorithm is proposed. Moreover, the RIS-aided robust secure communication in the DFRC system is investigated by considering the eavesdropper’s imperfect channel state information (CSI), where a bounded uncertainty model is adopted to capture the angle error and fading channel error of the eavesdropper, and a tractable bound for their joint uncertainty is derived. Simulation results confirm the effectiveness of the developed RIS-aided transmission scheme to improve the secrecy rate even with the eavesdropper’s imperfect CSI, and comparisons between both systems reveal that the RCCE system can provide a higher secrecy rate than the DFRC system.
- 17 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 1934-1948
Reconfigurable Intelligent Surface-Aided Secure Integrated Radar and Communication Systems
Despite the enhanced spectral efficiency brought by the integrated radar and communication technique, it poses significant risks to communication security when confronted with malicious radar targets. To address this issue, a reconfigurable intelligent surface (RIS)-aided transmission scheme is proposed to improve secure communication in two systems, i.e., the radar and communication co-existing (RCCE) system, where a single transmitter is utilized for both radar sensing and communication, and the dual-functional radar and communication (DFRC) system. At the design stage, optimization problems are formulated to maximize the secrecy rate while satisfying the radar detection constraint via joint active beamforming at the base station and passive beamforming of RIS in both systems. Particularly, a zero-forcing-based block coordinate descent (BCD) algorithm is developed for the RCCE system. Besides, the Dinkelbach method combined with semidefinite relaxation is employed for the DFRC system, and to further reduce the computational complexity, a Riemannian conjugate gradient-based alternating optimization algorithm is proposed. Moreover, the RIS-aided robust secure communication in the DFRC system is investigated by considering the eavesdropper’s imperfect channel state information (CSI), where a bounded uncertainty model is adopted to capture the angle error and fading channel error of the eavesdropper, and a tractable bound for their joint uncertainty is derived. Simulation results confirm the effectiveness of the developed RIS-aided transmission scheme to improve the secrecy rate even with the eavesdropper’s imperfect CSI, and comparisons between both systems reveal that the RCCE system can provide a higher secrecy rate than the DFRC system.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (4) , 2152-2165
Secure Offloading in NOMA-Enabled Multi-Access Edge Computing Networks
Multi-access edge computing (MEC) has been recognized as a promising technology for enhancing the computation capability for next generation wireless networks. This paper studies physical layer security for an MEC network, where multiple users desire to securely offload part of their computation tasks to a base station (BS) simultaneously using non-orthogonal multiple access (NOMA) subject to the potential overhearing of a malicious eavesdropper. The secrecy outage probability (SOP) is adopted as a secrecy performance metric of the computation offloading against eavesdropping attacks. We aim to minimize the total energy consumption of the MEC system subject to an individual SOP constraint for each user. To this end, we jointly design each user’s local computing bits, the transmit power, the secrecy code rates, as well as the successive interference cancellation decoding order at the BS side. As the formulated problem is highly non-convex and challenging to solve, we propose an efficient algorithm based on penalty dual decomposition (PDD) and sequential convex approximation methods to obtain an efficient suboptimal solution. To reduce the computational complexity, we further propose a reverse recursion (RR) algorithm and derive semi-closed-form solutions to the design problem. Numerical results are presented to validate the convergence and the effectiveness of our proposed algorithms. We show that the minimal total energy consumption obtained via either the PDD or RR method approaches the optimal performance of exhaustive search as the task duration increases. It is also demonstrated that the RR algorithm can achieve a comparable performance to that of the PDD algorithm while enjoying a much lower computational complexity.
- 15 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (4) , 2152-2165
Secure Offloading in NOMA-Enabled Multi-Access Edge Computing Networks
Multi-access edge computing (MEC) has been recognized as a promising technology for enhancing the computation capability for next generation wireless networks. This paper studies physical layer security for an MEC network, where multiple users desire to securely offload part of their computation tasks to a base station (BS) simultaneously using non-orthogonal multiple access (NOMA) subject to the potential overhearing of a malicious eavesdropper. The secrecy outage probability (SOP) is adopted as a secrecy performance metric of the computation offloading against eavesdropping attacks. We aim to minimize the total energy consumption of the MEC system subject to an individual SOP constraint for each user. To this end, we jointly design each user’s local computing bits, the transmit power, the secrecy code rates, as well as the successive interference cancellation decoding order at the BS side. As the formulated problem is highly non-convex and challenging to solve, we propose an efficient algorithm based on penalty dual decomposition (PDD) and sequential convex approximation methods to obtain an efficient suboptimal solution. To reduce the computational complexity, we further propose a reverse recursion (RR) algorithm and derive semi-closed-form solutions to the design problem. Numerical results are presented to validate the convergence and the effectiveness of our proposed algorithms. We show that the minimal total energy consumption obtained via either the PDD or RR method approaches the optimal performance of exhaustive search as the task duration increases. It is also demonstrated that the RR algorithm can achieve a comparable performance to that of the PDD algorithm while enjoying a much lower computational complexity.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 4038-4051
Physical Layer Security in Large-Scale Random Multiple Access Wireless Sensor Networks: A Stochastic Geometry Approach
This paper investigates physical layer security for a large-scale WSN with random multiple access, where each fusion center in the network randomly schedules a number of sensors to upload their sensed data subject to the overhearing of randomly distributed eavesdroppers. We propose an uncoordinated random jamming scheme in which those unscheduled sensors send jamming signals with a certain probability to defeat the eavesdroppers. With the aid of stochastic geometry theory and order statistics, we derive analytical expressions for the connection outage probability and secrecy outage probability to characterize transmission reliability and secrecy, respectively. Based on the obtained analytical results, we formulate an optimization problem for maximizing the sum secrecy throughput subject to both reliability and secrecy constraints, considering a joint design of the wiretap code rates for each scheduled sensor and the jamming probability for the unscheduled sensors. We provide both optimal and low-complexity sub-optimal algorithms to tackle the above problem, and further reveal various properties on the optimal parameters which are useful to guide practical designs. In particular, we demonstrate that the proposed random jamming scheme is beneficial for improving the sum secrecy throughput, and the optimal jamming probability is the result of trade-off between secrecy and throughput. We also show that the throughput performance of the sub-optimal scheme approaches that of the optimal one when facing a stringent reliability constraint or a loose secrecy constraint.
- 13 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (6) , 4038-4051
Physical Layer Security in Large-Scale Random Multiple Access Wireless Sensor Networks: A Stochastic Geometry Approach
This paper investigates physical layer security for a large-scale WSN with random multiple access, where each fusion center in the network randomly schedules a number of sensors to upload their sensed data subject to the overhearing of randomly distributed eavesdroppers. We propose an uncoordinated random jamming scheme in which those unscheduled sensors send jamming signals with a certain probability to defeat the eavesdroppers. With the aid of stochastic geometry theory and order statistics, we derive analytical expressions for the connection outage probability and secrecy outage probability to characterize transmission reliability and secrecy, respectively. Based on the obtained analytical results, we formulate an optimization problem for maximizing the sum secrecy throughput subject to both reliability and secrecy constraints, considering a joint design of the wiretap code rates for each scheduled sensor and the jamming probability for the unscheduled sensors. We provide both optimal and low-complexity sub-optimal algorithms to tackle the above problem, and further reveal various properties on the optimal parameters which are useful to guide practical designs. In particular, we demonstrate that the proposed random jamming scheme is beneficial for improving the sum secrecy throughput, and the optimal jamming probability is the result of trade-off between secrecy and throughput. We also show that the throughput performance of the sub-optimal scheme approaches that of the optimal one when facing a stringent reliability constraint or a loose secrecy constraint.
- 13 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (1) , 33-37
Enhancing MIMO Covert Communications via Intelligent Reflecting Surface
This letter investigates the multi-input multi-output (MIMO) covert communication aided by intelligent reflecting surface (IRS) against a multi-antenna warden. We establish a design framework for IRS-assisted MIMO covert communication system, which aims to maximize covert rate by jointly optimizing the transmit covariance matrix $\textbf {R}$ at transmitter and phase shift matrix $\textbf {Q}$ at IRS. Due to the unit modulus constraint of $\textbf {Q}$ and the highly coupling of $\textbf {R}$ and $\textbf {Q}$ , we propose an alternating optimization algorithm to solve it. Specifically, the sub-problem of optimizing $\textbf {R}$ for given $\textbf {Q}$ is convex, and we can derive a closed-form solution. Then, we propose a minorization-maximization algorithm to tackle the sub-problem of optimizing $\textbf {Q}$ for fixed $\textbf {R}$ , where we translate the problem to the maximization of a proper lower bound of the objective function which is then solved by the sequential rank-one constraint relaxation algorithm. Simulation results demonstrate the effectiveness and superiority of the proposed algorithm in terms of boosting covert rate under the surveillance of a multi-antenna warden.
- 13 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (1) , 33-37
Enhancing MIMO Covert Communications via Intelligent Reflecting Surface
This letter investigates the multi-input multi-output (MIMO) covert communication aided by intelligent reflecting surface (IRS) against a multi-antenna warden. We establish a design framework for IRS-assisted MIMO covert communication system, which aims to maximize covert rate by jointly optimizing the transmit covariance matrix $\textbf {R}$ at transmitter and phase shift matrix $\textbf {Q}$ at IRS. Due to the unit modulus constraint of $\textbf {Q}$ and the highly coupling of $\textbf {R}$ and $\textbf {Q}$ , we propose an alternating optimization algorithm to solve it. Specifically, the sub-problem of optimizing $\textbf {R}$ for given $\textbf {Q}$ is convex, and we can derive a closed-form solution. Then, we propose a minorization-maximization algorithm to tackle the sub-problem of optimizing $\textbf {Q}$ for fixed $\textbf {R}$ , where we translate the problem to the maximization of a proper lower bound of the objective function which is then solved by the sequential rank-one constraint relaxation algorithm. Simulation results demonstrate the effectiveness and superiority of the proposed algorithm in terms of boosting covert rate under the surveillance of a multi-antenna warden.