Hangmei Rao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hangmei Rao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jianquan Wang
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Sa Xiao
National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Wanbin Tang
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Mingming Wu
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Shaoqian Li
Shanghai Engineering Center for Microsatellites, Chinese Academy of Sciences
1 shared publication - Shihao Yan
School of Science, Edith Cowan University, Perth, WA, Australia
1 shared publication
Latest Publications
- 23 March 2023
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (8) , 4603-4620
Identification of Discrete Wiener Systems by Using Adaptive Generalized Rational Orthogonal Basis Functions
- 23 March 2023
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (8) , 4603-4620
Identification of Discrete Wiener Systems by Using Adaptive Generalized Rational Orthogonal Basis Functions
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10633-10647
Optimal Geometric Solutions to UAV-Enabled Covert Communications in Line-of-Sight Scenarios
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.
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10633-10647
Optimal Geometric Solutions to UAV-Enabled Covert Communications in Line-of-Sight Scenarios
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.
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (2) , 2331-2341
D2D Covert Communications With Safety Area
In this article, we investigate device-to-device (D2D) relay enabled covert communications. Safety zone is employed to isolate the eavesdroppers from the transmitters and receivers. Different from majority of the existing studies considering fixed relays, dynamic relay selection is first considered for covert communications in this article. Additionally, we formulate dynamic relay selection and power allocation into an infinite-horizon time-average renewal-reward problem subject to the time average constraint on a collection of penalty processes. Furthermore, a novel Lyapunov optimization concepts based drift-plus-penalty algorithm is proposed to solve the problem. The numerical results demonstrate that the validity of the proposed dynamic relay selection by comparing its performance with its benchmarks.
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (2) , 2331-2341
D2D Covert Communications With Safety Area
In this article, we investigate device-to-device (D2D) relay enabled covert communications. Safety zone is employed to isolate the eavesdroppers from the transmitters and receivers. Different from majority of the existing studies considering fixed relays, dynamic relay selection is first considered for covert communications in this article. Additionally, we formulate dynamic relay selection and power allocation into an infinite-horizon time-average renewal-reward problem subject to the time average constraint on a collection of penalty processes. Furthermore, a novel Lyapunov optimization concepts based drift-plus-penalty algorithm is proposed to solve the problem. The numerical results demonstrate that the validity of the proposed dynamic relay selection by comparing its performance with its benchmarks.