PWPeng Wu

Peng Wu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Peng Wu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Geometric Method to Complete Closed-Form Solutions for UAV-Assisted 3D Coverage

    by Xuan Wen, Peng Wu, Yunfei Gao, Xiaopeng Yuan, Yao Zhu, Yulin Hu

    This letter investigates a UAV-assisted wireless communication coverage network, where a UAV equipped with a directional antenna is dispatched to provide communication coverage service to two ground nodes. To improve communication quality under a fairness consideration, we aim to minimize the maximum UAV-to-node distance (i.e., a min–max fairness objective) while ensuring both nodes lie within the antenna beamwidth cone through jointly optimizing the 3D position and the antenna orientation of UAV. To tackle the formulated highly complicated non-convex problem, we propose a novel geometric approach which rigorously maps the original 3D position design problem to an equivalent 2D position design problem through leveraging the axis-symmetric structure of the problem and applying a bijection-based transformation. Then, via characterizing the monotonicity of the objective function, the closed form expression for the optimal solution is derived which can be equivalently covered to the optimal UAV 3D position of the original problem by inverse mapping. Afterwards, the corresponding optimal antenna orientation is obtained by analyzing the coverage constraints of the original 3D problem. Finally, simulation results demonstrate that our method provides the complete set of globally optimal closed-form solutions compared with benchmark.

  • Toward Performance Analysis and Trajectory Design for UAV-Enabled Covert Communication Under Nakagami- m Channel

    by Peng Wu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink

    In this letter, we focus on performance analysis and UAV trajectory design for UAV-enabled covert communication under Nakagami-m channel which is still an open issue, where a joint segmentation ratio, UAV trajectory and transmit power design problem is formulated to maximize the minimal throughput under covertness constraint. To solve the complicated problem, the covert communication performance under Nakagami-m channel is first analyzed where the monotonicity of the minimal detection error probability is utilized to reformulate the original problem into a simplified one. Then, an efficient iterative algorithm based on a novel convex approximation method is proposed to solve the non-convex problem efficiently. Finally, numerical results are provided to validate the proposed scheme.

  • Pinching Antenna Assisted UAV-Enabled Covert Communication against Cooperative Detection

    by Peng Wu, Xiaopeng Yuan, Wei Gao, Yulin Hu, Anke Schmeink

    In this work, we consider a unmanned aerial vehicle (UAV)-enabled covert communication against cooperative detection. While considering the potential cooperation of wardens interfered by a jammer with pinching antennas (PAs), the first step of this work is to characterize the covert communication performance with PAs under cooperative detection. Following the characterization, a joint design of UAV trajectory, PA positions, user transmit power and user scheduling is provided, aiming at maximizing the throughput. The formulated problem is extremely hard to solve due to the complicated covert constraint involving the expression of covert communication performance, and infinite variables. To solve the problem, the characteristic of optimal transmit power and PA positions is analyzed to transform the original problem with complicated covert constraint into equivalent one only involving trajectory and user scheduling design. Next, the optimal successive-hover-and-fly structure is adopted to reformulate the problem with infinite variables into one with finite variables without loss of optimality, which can be efficiently solved via a proposed novel convex approximation method. Simulations validate the advantages of proposed scheme.


  • Joint Link Adaptation and Device Scheduling Approach for URLLC Industrial IoT Network: A DRL-Based Method With Bayesian Optimization

    by Wei Gao, Paul Zheng, Peng Wu, Yulin Hu, Anke Schmeink

    In this article, we consider an industrial Internet of Things (IIoT) network supporting multi-device dynamic ultra-reliable low-latency communication (URLLC) while the channel state information (CSI) is imperfect. A joint link adaptation (LA) and device scheduling (including the order) design is provided, aiming at maximizing the total transmission rate under strict block error rate (BLER) constraints. In particular, a Bayesian optimization (BO) driven Twin Delayed Deep Deterministic Policy Gradient (TD3) method is proposed, which determines the device served order sequence and the corresponding modulation and coding scheme (MCS) adaptively based on the imperfect CSI. Note that the imperfection of CSI, error sample imbalance in URLLC networks, as well as the parameter sensitivity nature of the TD3 algorithm likely diminish the algorithm's convergence speed and reliability. To address such an issue, we proposed a BO based training mechanism for the convergence speed improvement, which provides a more reliable learning direction and sample selection method to track the imbalance sample problem. Via extensive simulations, we show that the proposed algorithm achieves faster convergence and higher sum-rate performance compared to existing solutions.


  • UAV-Enabled Covert Communication With Movable Antenna Against Cooperative Detection

    by Peng Wu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink

    In this work, we focus on an uncrewed aerial vehicle (UAV)-enabled covert communication with movable antenna against cooperative detection, which is still an unexplored issue. The covertness performance is first analyzed with the consideration of cooperative detection mechanism among wardens. Then, a joint design problem of segmentation ratio, transmit beamforming, trajectory and antenna position is formulated to maximize the minimal throughput among users while adhering the covertness constraint, which is extremely hard to be tackled due to the coupled variables and non-convex format. To address the problem, we develop an efficient iterative algorithm based on block coordinate descent (BCD) scheme and a novel convex approximation method, which converges to a high-quality solution efficiently. Finally, numerical results validate the benefits of our proposed scheme with respect to benchmarks.


  • Top Cited Papers

    Age of Information for UAV-Enabled Covert and Secure Communication

    by Peng Wu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink

    In this letter, we investigate the timeliness of an unmanned aerial vehicle (UAV)-enabled covert and secure communication network, where a novel metric, i.e., covert and secure age of information (C&S AoI), is proposed to capture the relationship between the information freshness and communication security. We first analyze the covert and secure communication performance on account of location uncertainty of warden, which leads to characterization on the expression of C&S AoI. Then, we formulate a joint UAV position, transmit power and blocklength design problem to minimize the C&S AoI. To solve the complicated problem, an efficient iterative algorithm based on optimal solution analysis and a novel convex approximation is developed for obtaining a high-quality solution. Simulations demonstrate the superior performance of proposed algorithm in improving C&S AoI performance of delay sensitive networks compared with benchmark.


  • UAV-Enabled Covert and Secure Communication Against Cooperative Detection and Eavesdropping

    by Peng Wu, Xiaopeng Yuan, Yulin Hu, Chi Guo, 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.


  • UAV-Enabled Covert Autonomous Vehicular Communication: Joint Trajectory and Resource Allocation Design

    by Peng Wu, Xiaopeng Yuan, Yulin Hu, 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.