Peng Wu

Dr. Peng Wu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
6 June 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
PWPeng Wu
Peng Wu
XYXiaopeng Yuan
Xiaopeng Yuan
YHYulin Hu
Yulin Hu
ASAnke Schmeink
Anke Schmeink
In this paper, we study covert communications in an unmanned aerial vehicle (UAV)-enabled network, where a UAV transmits information to multiple ground users (GUs) without being detected by a hidden detector. Considering fairness issue, we aim at maximizing the minimum throughput among GUs by jointly optimizing the UAV’s trajectory, transmit power and power allocation coefficient, under UAV mobility and covertness constraints. On the one hand, according to the covertness constraint, the maximal transmit power is characterized as a close form expression of UAV’s position. On the other hand, the optimal UAV trajectory structure is characterized as a successive-hover-and-fly (SHF) structure. Following the two fundamental characterizations, we first transform the original problem to a joint trajectory and power allocation design one and then it is reformulated to another one addressing only a limited number of hovering points, corresponding hovering durations, turning points and allocation coefficient. Although being still non-convex, the new problem is efficiently solved via applying the sequential convex programming (SCP) method. Namely, by introducing a series of tight concave function in each iteration, we can solve a series of convex problems iteratively to make the trajectory converge to a high-quality solution. Numerical results confirm the convergence of our approach and show the high performance comparing with benchmark.

6 June 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PWPeng Wu
Peng Wu
XYXiaopeng Yuan
Xiaopeng Yuan
YHYulin Hu
Yulin Hu
ASAnke Schmeink
Anke Schmeink
This paper studies an unmanned aerial vehicle (UAV)-enabled downlink data transmission network for ground users in the presence of multiple no-fly zones (NFZs). To improved the efficiency of data transmission under fairness issue, we formulate a joint UAV trajectory and user assignment design problem to maximize the minimum throughput among users. Especially, to strictly fulfill no-fly requirements for certain zones, we treat the trajectory realistically in a continuous manner, which introduces new challenges in handling the highly non-convex problem with the infinite variables and infinite no-fly constraints over the continuous time domain. To facilitate the theoretical analysis on the focused problem, we first adopt the optimal successive-hover-and-fly (SHF) structure to reformulate the problem into a new one with finite variables without loss of optimality which allows tight convex problem approximations at any feasible point with the assistance of our proposed methodology. Then, based on rigorous mathematical analysis on NFZ constraint, problem with infinite NFZ constraints is transformed into solvable one equivalently, enabling an efficient algorithm to obtain a high-quality solution. Finally, numerical results validate necessity of this work on continuous trajectory design.

8 September 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
PWPeng Wu
Peng Wu
XYXiaopeng Yuan
Xiaopeng Yuan
YHYulin Hu
Yulin Hu
ASAnke Schmeink
Anke Schmeink
Unmanned aerial vehicle (UAV)-enabled communication is recognized as a promising technique in Internet of Vehicles (IoV) to address the issue of ineffective transmission of road condition data and driving instructions caused by obstruction and random fading of ground channels. However, the inherently open channel characteristics in UAV to ground links brings new secure and covert problem in vehicular IoV which largely limit the applications of UAV in IoV. To resolve the issue, this work studies a UAV-enabled covert autonomous vehicular communication network where a UAV is deployed as a relay aided by a jammer to assist the data transmission from the base station to an autonomous vehicle without being detected by a warden whose exact location is unknown. For network performance boosting with transmission covertness consideration, an upload throughput maximization problem is formulated by jointly designing UAV trajectory and resource allocation under a more generally joint covertness constraints. To solve the complicated and highly non-convex problem which contains a large number of variables, we first analyze the detection performance and derives the closed-form expressions of the warden’s minimal detection error probability considering the warden’s location uncertainty. Then, the characterizations on the convexity of minimal detection error probability and the optimal transmission rate are provided, which helps in simplifying original problem and developing an efficient iterative algorithm to solve this problem based on a proposed novel convex approximation method. Simulations are offered to demonstrate the superior convergence, throughput, computation time, and covertness performance of proposed scheme in UAV-enabled vehicular network.

16 April 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PWPeng Wu
Peng Wu
KLKaihong Li
Kaihong Li
XYXiaopeng Yuan
Xiaopeng Yuan
YHYulin Hu
Yulin Hu
ASAnke Schmeink
Anke Schmeink
We consider an unmanned aerial vehicle (UAV)- aided covert data collection against detection from a malicious warden with uncertain location and provide the joint UAV trajectory and user scheduling design to minimize task completion time. Particularly, we first derive the closed-form expressions for covert data collection metric and the maximum transmit power follows covertness constraint for warden at any possible location, based on which a joint continuous trajectory and user scheduling design problem is formulated which introduces significant challenges for handling highly complex problems involving infinite variables. Then, based on the optimal successive-hover-and-fly (SHF) structure, we successfully construct the reformulation the problem containing finite variables without loss of optimality. And an efficient iteration algorithm based proposed rigorous convex approximation is developed to solve the reformulation problem efficiently. Numerical results show that the proposed scheme significantly outperforms the conventional benchmark in completion time minimization and computing time reduction.

28 May 2023 in Drones
Verified
Journal Article
Open access
PDF file
XWXinran Wang
Xinran Wang
PWPeng Wu
Peng Wu
YHYulin Hu
Yulin Hu
XCXuan Cai
Xuan Cai
QSQinghua Song
Qinghua Song
HCHu Chen
Hu Chen
In this work, we explore a multi-UAV-assisted wireless power transfer (WPT) network, where multiple UAVs are deployed to provide WPT services to multiple ground devices (GDs) in order to extend their lifespan. To enhance the WPT efficiency while considering fairness, we investigate the joint trajectories and transmit power design. For fairness-aware consideration, our objective is to maximize the harvested energy of the GD with the worst condition, taking into account UAV mobility, anti-collision, and power budget constraints. Unlike previous works that focus on the simplified linear energy harvesting (EH) model, a more accurate multi-source nonlinear EH model is, for the first time, adopted to formulate the problem. Given the highly non-convex nature of the original problem due to the presence of coupled variables, we leverage the convexity of the multi-source nonlinear EH model and introduce a convex approximation method, which enables us to construct a tightly convex problem in each iteration for the original joint design problem, thereby obtaining a high-quality solution. Finally, we present numerical results to showcase the convergence of our algorithm and validate the performance advantages of the proposed multi-UAV WPT scheme with a nonlinear EH model versus benchmarks.

17 December 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
PWPeng Wu
Peng Wu
XYXiaopeng Yuan
Xiaopeng Yuan
YHYulin Hu
Yulin Hu
Chi GuoChi Guo
Chi Guo
ASAnke Schmeink
Anke Schmeink
Unmanned aerial vehicle (UAV)-enabled wireless communication technique has emerged as a promising paradigm in the next generation communication networks. However, due to the security issues arising from the inherently open nature of air to ground (A2G) links, the security of both communication behavior and information faces significant threat. To address this issue, we investigate a UAV-enabled covert and secure communication network against cooperative detection and eavesdropping from multiple illegal eves, which can share the intercepted signals with others. Specifically, from the perspective of secure communication considering channel uncertainty and cooperative eavesdropping, we characterize users' upload secure throughput by an ergodic integral expression, and formulate a max-min throughput optimization problem through joint design of UAV trajectory, user transmit power and segmentation ratio, under mobility, energy consumption and covertness constraints. Then, to address the problem with complicated covertness metric with no closed-form expression under cooperative detection, we derived closed form expressions of the covertness metric, by utilizing the Pinsker inequality along with properties of both Taylor series and the Digamma function. Subsequently, the monotonicity of the derived metric is analyzed and further utilized to simplify the covertness constraint into transmit power constraint equivalently. Afterward, a novel convex approximation method is introduced to construct a convex subproblem for the formulated highly complicated non-convex problem, enabling an efficient algorithm that delivers high-quality solutions for the formulated problem. Finally, the effectiveness and superior performance of proposed design are verified through simulations.