18 February 2019 in IEEE Transactions on Vehicular Technology
This paper studies the physical layer security of an unmanned aerial vehicle (UAV) network, where a UAV base station (UAV-B) transmits confidential information to multiple information receivers (IRs) with the aid of a UAV jammer (UAVJ) in the presence of multiple eavesdroppers. We formulate an optimization problem to jointly design the trajectories and transmit power of UAV-B and UAV-J in order to maximize the minimum average secrecy rate over all IRs. The optimization problem is non-convex and the optimization variables are coupled, which leads to the optimization problem being mathematically intractable. As such, we decompose the optimization problem into two subproblems and then solve it by employing an alternating iterative algorithm and the successive convex approximation technique. Our results show that the average secrecy rate performance of the proposed scheme provides about 20% and 150% performance gains over the joint trajectory and transmit power optimization without UAV-J scheme and the transmit power optimization with fixed trajectory scheme at flight period T = 150 s, respectively.
16 July 2019 in IEEE Transactions on Signal Processing
This paper considers covert communications in the context of unmanned aerial vehicle (UAV) networks, aiming to hide a UAV for transmitting critical information out of an area that is monitored and where communication is not allowed. Specifically, the UAV as a transmitter intends to transmit information to a legitimate receiver (Bob) covertly while avoiding being detected by a warden (Willie), where location uncertainty exists at Bob and/or Willie. In order to enhance the considered covert communication performance, we jointly optimize the UAV's trajectory and transmit power in terms of maximizing the average covert transmission rate from the UAV to Bob subject to transmission outage constraint and covertness constraint. The formulated optimization problem is difficult to tackle directly due to the intractable constraints. As such, we first employ conservative approximation to transform a constraint into a deterministic form and then apply the first-order restrictive approximation to transform the optimization problem into a convex form. By applying the successive convex approximation technique, an efficient iterative algorithm is developed to solve the optimization problem. Our examination shows that the developed joint trajectory and transmit power optimization scheme achieves significantly better covert communication performance as compared to a benchmark scheme.
26 July 2021 in IEEE Transactions on Wireless Communications
This work examines the performance gain achieved by deploying an intelligent reflecting surface (IRS) in covert communications. To this end, we formulate the joint design of the transmit power and the IRS reflection coefficients by taking into account the communication covertness for the cases with global channel state information (CSI) and without a warden’s instantaneous CSI. For the case of global CSI, we first prove that perfect covertness is achievable with the aid of the IRS even for a single-antenna transmitter, which is impossible without an IRS. Then, we develop a penalty successive convex approximation (PSCA) algorithm to tackle the design problem. Considering the high complexity of the PSCA algorithm, we further propose a low-complexity two-stage algorithm, where analytical expressions for the transmit power and the IRS’s reflection coefficients are derived. For the case without the warden’s instantaneous CSI, we first derive the covertness constraint analytically facilitating the optimal phase shift design. Then, we consider three hardware-related constraints on the IRS’s reflection amplitudes and determine their optimal designs together with the optimal transmit power. Our examination shows that significant performance gain can be achieved by deploying an IRS into covert communications.
13 December 2021 in IEEE Transactions on Wireless Communications
In this paper, we propose a new dynamic IRS beamforming framework to boost the sum throughput of an intelligent reflecting surface (IRS) aided wireless powered communication network (WPCN). Specifically, the IRS phase-shift vectors across time and resource allocation are jointly optimized to enhance the efficiencies of both downlink wireless power transfer (DL WPT) and uplink wireless information transmission (UL WIT) between a hybrid access point (HAP) and multiple wirelessly powered devices. To this end, we first study three special cases of the dynamic IRS beamforming, namely user-adaptive IRS beamforming, UL-adaptive IRS beamforming, and static IRS beamforming, by characterizing their optimal performance relationships and proposing corresponding algorithms. Interestingly, it is rigorously proved that the latter two cases achieve the same throughput, thus helping halve the number of IRS phase shifts to be optimized and signalling overhead practically required for UL-adaptive IRS beamforming. Then, we propose a general optimization framework for dynamic IRS beamforming, which is applicable for any given number of IRS phase-shift vectors available. Despite of the non-convexity of the general problem with highly coupled optimization variables, we propose two algorithms to solve it and particularly, the low-complexity algorithm exploits the intrinsic structure of the optimal solution as well as the solutions to the cases with user-adaptive and static IRS beamforming. Simulation results validate our theoretical findings, illustrate the practical significance of IRS with dynamic beamforming for spectral and energy efficient WPCNs, and demonstrate the effectiveness of our proposed designs over various benchmark schemes.
12 April 2021 in IEEE Wireless Communications Letters
Intelligent reflecting surface (IRS) is a promising technology to improve the performance of wireless powered communication networks (WPCNs) due to its capability to reconfigure signal propagation environments via smart reflection. In particular, the high passive beamforming gain promised by IRS can significantly enhance the efficiency of both downlink wireless power transfer (DL WPT) and uplink wireless information transmission (UL WIT) in WPCNs. Although adopting different IRS phase shifts for DL WPT and UL WIT, i.e., dynamic IRS beamforming, is in principle possible but incurs additional signaling overhead and computational complexity, it is an open problem whether it is actually beneficial. To answer this question, we consider an IRS-assisted WPCN where multiple devices employ a hybrid access point (HAP) to first harvest energy and then transmit information using non-orthogonal multiple access (NOMA). Specifically, we aim to maximize the sum throughput of all devices by jointly optimizing the IRS phase shifts and the resource allocation. To this end, we first prove that dynamic IRS beamforming is not needed for the considered system, which helps reduce the number of IRS phase shifts to be optimized. Then, we propose both joint and alternating optimization based algorithms to solve the resulting problem. Simulation results demonstrate the effectiveness of our proposed designs over benchmark schemes and also provide useful insights into the importance of IRS for realizing spectrum and energy efficient WPCNs.
14 June 2021 in IEEE Journal on Selected Areas in Communications
This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex (FD) UAV intends to gather critical information from a scheduled user (SU) through wireless communication and generate artificial noise (AN) with random transmit power in order to ensure a negligible probability of the SU’s transmission being detected by the unscheduled users (USUs). To enhance the system performance, we jointly design the UAV’s trajectory and its maximum AN transmit power together with the user scheduling strategy subject to practical constraints, e.g., a covertness constraint, which is explicitly determined by analyzing each USU’s detection performance, and a binary constraint induced by user scheduling. The formulated design problem is a mixed-integer non-convex optimization problem, which is challenging to solve directly, but tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the successive hover-and-fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate (ATR) from all the SUs to the UAV.