Guangchi Zhang

Dr. Guangchi Zhang


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 May 2019 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
MCMiao Cui
Miao Cui
GZGuangchi Zhang
Guangchi Zhang
RZRui Zhang
Rui Zhang
An intelligent reflecting surface (IRS) can adaptively adjust the phase shifts of its reflecting units to strengthen the desired signal and/or suppress the undesired signal. In this letter, we investigate an IRS-aided secure wireless communication system where a multi-antenna access point (AP) sends confidential messages to a single-antenna user in the presence of a single-antenna eavesdropper. In particular, we consider the challenging scenario where the eavesdropping channel is stronger than the legitimate communication channel and they are also highly correlated in space. We maximize the secrecy rate of the legitimate communication link by jointly designing the AP’s transmit beamforming and the IRS’s reflect beamforming. While the resultant optimization problem is difficult to solve, we propose an efficient algorithm to obtain high-quality suboptimal solution for it by applying the alternating optimization and semidefinite relaxation methods. Simulation results show that the proposed design significantly improves the secrecy communication rate for the considered setup over the case without using the IRS, and outperforms a heuristic scheme.

18 January 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
GZGuangchi Zhang
Guangchi Zhang
QWQingqing Wu
Qingqing Wu
MCMiao Cui
Miao Cui
RZRui Zhang
Rui Zhang
Unmanned aerial vehicle (UAV) communication is anticipated to be widely applied in the forthcoming fifthgeneration (5G) wireless networks, due to its many advantages such as low cost, high mobility, and on-demand deployment. However, the broadcast and line-of-sight (LoS) nature of airto- ground wireless channels gives rise to a new challenge on how to realize secure UAV communications with the destined nodes on the ground. This paper aims to tackle this challenge by applying the physical layer security technique. We consider both the downlink and uplink UAV communications with a ground node, namely UAV-to-ground (U2G) and ground-to-UAV (G2U) communications, respectively, subject to a potential eavesdropper on the ground. In contrast to the existing literature on wireless physical layer security only with ground nodes at fixed or quasistatic locations, we exploit the high mobility of the UAV to proactively establish favorable and degraded channels for the legitimate and eavesdropping links, respectively, via its trajectory design. We formulate new problems to maximize the average secrecy rates of the U2G and G2U transmissions, respectively, by jointly optimizing the UAV’s trajectory and the transmit power of the legitimate transmitter over a given flight period of the UAV. Although the formulated problems are non-convex, we propose iterative algorithms to solve them efficiently by applying the block coordinate descent and successive convex optimization methods. Specifically, the transmit power and UAV trajectory are each optimized with the other being fixed in an alternating manner, until the algorithms converge. Simulation results show that the proposed algorithms can improve the secrecy rates for both U2G and G2U communications, as compared to other benchmark schemes without power control and/or trajectory optimization.

21 June 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MCMiao Cui
Miao Cui
GZGuangchi Zhang
Guangchi Zhang
QWQingqing Wu
Qingqing Wu
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem which maximizes the average worst-case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The non-convexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, S-procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst-case secrecy rate significantly, as compared to two other benchmark algorithms without robust design.

3 August 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YGYing Gao
Ying Gao
QWQingqing Wu
Qingqing Wu
GZGuangchi Zhang
Guangchi Zhang
Wen ChenWen Chen
Wen Chen
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
MRMarco Di Renzo
Marco Di Renzo
Active intelligent reflecting surface (IRS) has been recently proposed to alleviate the product path loss attenuation inherent in the IRS-aided cascaded channel. In this paper, we study an active IRS-aided simultaneous wireless information and power transfer (SWIPT) system. Specifically, an active IRS is deployed to assist a multi-antenna access point (AP) to convey information and energy simultaneously to multiple single-antenna information users (IUs) and energy users (EUs). Two joint transmit and reflect beamforming optimization problems are investigated with different practical objectives. The first problem maximizes the weighted sum-power harvested by the EUs subject to individual signal-to-interference-plus-noise ratio (SINR) constraints at the IUs, while the second problem maximizes the weighted sum-rate of the IUs subject to individual energy harvesting (EH) constraints at the EUs. The optimization problems are non-convex and difficult to solve optimally. To tackle these two problems, we first rigorously prove that dedicated energy beams are not required for their corresponding semidefinite relaxation (SDR) reformulations and the SDR is tight for the first problem, thus greatly simplifying the AP precoding design. Then, by capitalizing on the techniques of alternating optimization (AO), SDR, and successive convex approximation (SCA), computationally efficient algorithms are developed to obtain suboptimal solutions of the resulting optimization problems. Simulation results demonstrate that, given the same total system power budget, significant performance gains in terms of operating range of wireless power transfer (WPT), total harvested energy, as well as achievable rate can be obtained by our proposed designs over benchmark schemes (especially the one adopting a passive IRS). Moreover, it is advisable to deploy an active IRS in the proximity of the users for the effective operation of WPT/SWIPT.

26 September 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
GZGuangchi Zhang
Guangchi Zhang
JXJie Xu
Jie Xu
QWQingqing Wu
Qingqing Wu
MCMiao Cui
Miao Cui
XLXueyi Li
Xueyi Li
FLFan Lin
Fan Lin
This paper studies the secrecy communication in an orthogonal frequency division multiplexing (OFDM) system, where a source sends confidential information to a destination in the presence of a potential eavesdropper. We employ wireless powered cooperative jamming to improve the secrecy rate of this system with the assistance of a cooperative jammer, which works in the harvest-then-jam protocol over two time-slots. In the first slot, the source sends dedicated energy signals to power the jammer; in the second slot, the jammer uses the harvested energy to jam the eavesdropper, in order to protect the simultaneous secrecy communication from the source to the destination. In particular, we consider two types of receivers at the destination, namely Type-I and Type-II receivers, which do not have and have the capability of canceling the (a-priori known) jamming signals, respectively. For both types of receivers, we maximize the secrecy rate at the destination by jointly optimizing the transmit power allocation at the source and the jammer over sub-carriers, as well as the time allocation between the two time-slots. First, we present the globally optimal solution to this problem via the Lagrange dual method, which, however, is of high implementation complexity. Next, to balance tradeoff between the algorithm complexity and performance, we propose alternative low-complexity solutions based on minorization maximization and heuristic successive optimization, respectively. Simulation results show that the proposed approaches significantly improve the secrecy rate, as compared to benchmark schemes without joint power and time allocation.

8 June 2021 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
DZDingcai Zhang
Dingcai Zhang
QWQingqing Wu
Qingqing Wu
MCMiao Cui
Miao Cui
GZGuangchi Zhang
Guangchi Zhang
DNDusit Niyato
Dusit Niyato
The high reflect beamforming gain of the intelligent reflecting surface (IRS) makes it appealing not only for wireless information transmission but also for wireless power transfer. In this letter, we consider an IRS-assisted wireless powered communication network, where a base station (BS) transmits energy to multiple users grouped into multiple clusters in the downlink, and the clustered users transmit information to the BS in the manner of hybrid non-orthogonal multiple access and time division multiple access in the uplink. We investigate optimizing the reflect beamforming of the IRS and the time allocation among the BS’s power transfer and different user clusters’ information transmission to maximize the throughput of the network, and we propose an efficient algorithm based on the block coordinate ascent, semidefinite relaxation, and sequential rank-one constraint relaxation techniques to solve the resultant problem. Simulation results have verified the effectiveness of the proposed algorithm and have shown the impact of user clustering setup on the throughput performance of the network.