Pengpeng Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pengpeng Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jiangbo Si
Xidian University
3 shared publications - Zan Li
Xidian University
3 shared publications - Naofal Al-Dhahir
The University of Texas at Dallas
2 shared publications - Yang Gao
College of Information and Navigation, Air Force Engineering University, Xian, China
2 shared publications - Hang Hu
Air Force Engineering University
1 shared publication - Zihao Cheng
State Key Laboratory of Integrated Services Networks, Xidian University, Xian, China
1 shared publication
Latest Publications
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (2) , 280-284
Movable-Antenna Enabled Covert Communication
Conventional multi-antenna technology with fixed position antenna (FPA) array cannot make full use of the spatial degree of freedom offered by wireless channels. This paper proposes a novel covert communication system empowered by movable-antenna (MA) array, in which a transmitter equipped with a linear MA array sends covert information to a legitimate user while being monitored by multiple single and FPA wardens. With the aim of maximizing the covert rate, we jointly design the transmit beamforming and antenna position considering the constraints of covertness, transmitter’s power as well as antenna position. Despite the non-convexity of the optimization problem, we solve two subproblems in an iterative manner by means of the block coordinate descent algorithm. Numerical results indicate that the proposed MA array scheme can provide superior covertness performance in comparison with the conventional FPA array especially when a small number of antennas is adopted at the transmitter.
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (2) , 280-284
Movable-Antenna Enabled Covert Communication
Conventional multi-antenna technology with fixed position antenna (FPA) array cannot make full use of the spatial degree of freedom offered by wireless channels. This paper proposes a novel covert communication system empowered by movable-antenna (MA) array, in which a transmitter equipped with a linear MA array sends covert information to a legitimate user while being monitored by multiple single and FPA wardens. With the aim of maximizing the covert rate, we jointly design the transmit beamforming and antenna position considering the constraints of covertness, transmitter’s power as well as antenna position. Despite the non-convexity of the optimization problem, we solve two subproblems in an iterative manner by means of the block coordinate descent algorithm. Numerical results indicate that the proposed MA array scheme can provide superior covertness performance in comparison with the conventional FPA array especially when a small number of antennas is adopted at the transmitter.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 17388-17401
Joint 3-D Trajectory and Power Optimization for Dual-UAV-Assisted Short-Packet Covert Communications
This paper investigates a dual-unmanned aerial vehicle (UAV) assisted short packet covert communication system in the presence of a warden. Specifically, one flying UAV serves as the base station to transmit covert information to a legitimate ground user, and the other flying UAV is deployed as a cooperative jammer to transmit artificial noise against detection by a warden. Considering a more practical scenario, where only imperfect location information of the warden is known at both UAVs, we jointly optimize both UAVs’ transmit powers and three-dimensional (3D) trajectories to maximize the average covert transmission rate under the constraints of both UAVs’ mobility, transmit powers and warden’s detection error probability (DEP). On the one hand, the incomplete Gamma function involved in warden’s DEP makes the covertness constraint intractable for further analysis. To facilitate the design, warden’s DEP is lower bounded by Pinsker’s inequality. On the other hand, the formulated optimization problem is intractable to solve directly owing to the multiple highly coupled variables and the uncertainty of the warden’s location. The alternating optimization algorithm combined with the successive convex approximation and S-procedure techniques is leveraged to solve three optimization subproblems iteratively. Numerical results reveal that superior performance can be achieved by employing the proposed joint optimization of both UAVs’ transmit powers and 3D trajectories algorithm compared with the traditional two-dimensional trajectory optimization algorithm and the scheme without the assistance of the cooperative UAV.
- 23 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 17388-17401
Joint 3-D Trajectory and Power Optimization for Dual-UAV-Assisted Short-Packet Covert Communications
This paper investigates a dual-unmanned aerial vehicle (UAV) assisted short packet covert communication system in the presence of a warden. Specifically, one flying UAV serves as the base station to transmit covert information to a legitimate ground user, and the other flying UAV is deployed as a cooperative jammer to transmit artificial noise against detection by a warden. Considering a more practical scenario, where only imperfect location information of the warden is known at both UAVs, we jointly optimize both UAVs’ transmit powers and three-dimensional (3D) trajectories to maximize the average covert transmission rate under the constraints of both UAVs’ mobility, transmit powers and warden’s detection error probability (DEP). On the one hand, the incomplete Gamma function involved in warden’s DEP makes the covertness constraint intractable for further analysis. To facilitate the design, warden’s DEP is lower bounded by Pinsker’s inequality. On the other hand, the formulated optimization problem is intractable to solve directly owing to the multiple highly coupled variables and the uncertainty of the warden’s location. The alternating optimization algorithm combined with the successive convex approximation and S-procedure techniques is leveraged to solve three optimization subproblems iteratively. Numerical results reveal that superior performance can be achieved by employing the proposed joint optimization of both UAVs’ transmit powers and 3D trajectories algorithm compared with the traditional two-dimensional trajectory optimization algorithm and the scheme without the assistance of the cooperative UAV.
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10187-10199
Joint Information-Theoretic Secrecy and Covertness for UAV-Assisted Wireless Transmission With Finite Blocklength
In this paper, we study a novel joint information-theoretic secrecy and covertness model for an unmanned aerial vehicle (UAV)-assisted finite blocklength transmission system, in which an UAV delivers classified information to a ground user (Bob) in the presence of two unauthorized users (Eve and Willie). Specifically, Eve tries to decode the legitimate information while Willie tries to detect if the UAV's transmission is present or not. Firstly, we assume that the perfect location knowledge of both Eve and Willie is known at the UAV. In this scenario, to guarantee security and covertness, the average secrecy rate maximization problem is formulated via joint design of the UAV's transmit power and three dimensional (3D) trajectory under Willie's covertness constraint. Technically speaking, the optimization problem is non-convex and mathematically intractable to tackle owing to the coupling of multiple variables. To address this non-convex problem, an iterative alternating optimization (AO) algorithm is developed with the assistance of the successive convex approximation (SCA) technique. After that, we extend the system model to both Eve's and Willie's imperfect location knowledge case, which is more sophisticated compared to the perfect location knowledge case due to the uncertain location constraints. We still utilize the iterative AO algorithm combined with SCA and $\mathcal {S}$ -procedure techniques to cope with the nonconvex problem. Numerical results indicate that our proposed 3D optimization algorithm performs better than the conventional two dimensional (2D) scheme and the benchmark scheme for both perfect and imperfect location knowledge cases.
- 10 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 10187-10199
Joint Information-Theoretic Secrecy and Covertness for UAV-Assisted Wireless Transmission With Finite Blocklength
In this paper, we study a novel joint information-theoretic secrecy and covertness model for an unmanned aerial vehicle (UAV)-assisted finite blocklength transmission system, in which an UAV delivers classified information to a ground user (Bob) in the presence of two unauthorized users (Eve and Willie). Specifically, Eve tries to decode the legitimate information while Willie tries to detect if the UAV's transmission is present or not. Firstly, we assume that the perfect location knowledge of both Eve and Willie is known at the UAV. In this scenario, to guarantee security and covertness, the average secrecy rate maximization problem is formulated via joint design of the UAV's transmit power and three dimensional (3D) trajectory under Willie's covertness constraint. Technically speaking, the optimization problem is non-convex and mathematically intractable to tackle owing to the coupling of multiple variables. To address this non-convex problem, an iterative alternating optimization (AO) algorithm is developed with the assistance of the successive convex approximation (SCA) technique. After that, we extend the system model to both Eve's and Willie's imperfect location knowledge case, which is more sophisticated compared to the perfect location knowledge case due to the uncertain location constraints. We still utilize the iterative AO algorithm combined with SCA and $\mathcal {S}$ -procedure techniques to cope with the nonconvex problem. Numerical results indicate that our proposed 3D optimization algorithm performs better than the conventional two dimensional (2D) scheme and the benchmark scheme for both perfect and imperfect location knowledge cases.