JSJang-Ping Sheu

Jang-Ping Sheu

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jang-Ping Sheu has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Joint Optimization of Offloading, Phase-Shift, Trajectory and Resource Allocation in Priority-Aware IRS-Assisted UAV-MEC Systems

    by Liang Zhao, Sinong Zhang, Huan Zhou, Zhiquan Liu, Shaocheng Qu, Jang-Ping Sheu, Victor C. M. Leung

    Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) utilizes low-altitude resources to provide computation services for ground users (GUs). However, the wireless channels connecting UAVs and GUs are often weak, and the priority of heterogeneous tasks is usually ignored, leading to unsatisfactory quality of service (QoS). To overcome this challenge, this paper considers task priority and integrates intelligent reflecting surface (IRS) into traditional UAV-MEC to enhance offloading efficiency. Firstly, we present a priority-aware multi-UAV single IRS-aided MEC system, where GUs can process the tasks with different priorities and tolerable delays locally or offload them to UAV via IRS. Subsequently, we formulate the problem as a joint optimization of task offloading, IRS phase shift, UAV trajectory and resource allocation, with the objective of maximizing the weighted sum of time and energy efficiency. To tackle this complicated Mixed Integer Non-linear Programming (MINLP) problem, we decouple it into three sub-problems and design corresponding algorithms to solve them: 1) we propose a Dynamic Dual-Weighting (DDW)-based Offloading Algorithm (DDWOA) to determine GUs’ offloading strategy; 2) we propose a Genetic Algorithm-based IRS Phase-shift Optimization method (GAIPO) to maximize selected GUs’ uplink channel gain; 3) we devise a Multi-Agent Proximal Policy Optimization (MAPPO)-DDW based UAV Trajectory and Resource Allocation approach (MDUTRA) to maximize system utility. Finally, extensive experimental results indicate that the system utility of our proposed method is dramatically higher than other benchmark schemes under different scenes.

  • Joint Scheduling and Relay Allocation for Semantic and Delay-Sensitive Wireless Communications

    by Wen-Fu Wang, Jang-Ping Sheu, Nguyen Van Cuong

    Semantic communication (SC) has emerged as a novel communication paradigm for enhancing transmission efficiency in wireless networks by prioritizing data semantics over raw bits. Meanwhile, mobile delay-sensitive users demand strict low-latency transmissions for critical tasks such as emergency response. Supporting both user types under limited resources is challenging. This paper proposes a joint resource allocation framework that integrates time-slot allocation and relay assignment to serve semantic- and delay-sensitive users simultaneously. The formulated problem is hard to solve optimally. We develop a Joint Matching, Time Slot, and Relay Allocation Algorithm (JMTRA) that combines stable matching, knapsack-based scheduling, and linear-programming-based relay selection to find a suboptimal solution. Simulation results demonstrate that our approach improves semantic performance while meeting delay constraints.


  • UAV Path Planning for Sustainable Data Collection Over Clustered Smart Pole Systems

    by Yung-Ching Kuo, Y.-W. Peter Hong, Jang-Ping Sheu

    This work examines the path-planning problem for data collection by an unmanned aerial vehicle (UAV) over clusters of smart poles (or streetlights). The smart poles within each cluster are assumed to be interconnected via wired or wireless links, and, thus, the UAV needs to collect data from only one pole in each cluster. A small subset of smart poles is equipped with charging facilities to replenish the UAV’s battery when visited. To minimize the UAV’s total flight distance in a data collection cycle, we first propose the energy-aware minimum distance (EA-MinDist) path-planning algorithm based on the dynamic programming principle. The algorithm takes into consideration the UAV’s need to visit charging poles along the path to sustain its travel over these clusters and can be extended to accommodate an infinite number of data collection cycles while maintaining a constant memory requirement. The sequence of visited smart poles converges to a periodic cycle. Alternatively, to reduce the cost of charging, we also propose the energy-aware minimum charging (EA-MinCharge) algorithm, which aims to minimize the total number of charges needed to traverse these clusters. Simulation results demonstrate the efficacy of the proposed algorithms in comparison to several baseline algorithms.

  • UAV Trajectory Planning for IoT Data Collection and Offloading With Energy Constraints

    by Teng-Wu Chang, Jang-Ping Sheu, Nguyen Van Cuong

    This work studies unmanned aerial vehicles (UAVs) for data collection and offloading. The UAV collects data from different types of Internet of Things (IoT) devices on the ground and offloads the collected data to their corresponding edge servers. Due to limited energy, the UAV must replace its battery at a battery station before the energy is exhausted. We aim to minimize the total completion time by optimizing the UAV trajectory. The formulated problem is an NP-hard problem, which is intractable in finding optimal solutions in large-scale cases. To solve the problem, we propose an efficient solution with a three-stage heuristic time minimization trajectory planning (TMTP) algorithm. In the first stage, we simplify the problem as a traveling salesperson problem (TSP) with precedence constraints and solve it to find the main visiting order. In the second stage, we propose a dynamic programming-based algorithm to insert battery stations in the trajectory to satisfy the energy constraints. In the last stage, we refine sub-trajectories and reinsert battery stations by an iterative algorithm to further reduce the previous time cost. Simulation results demonstrate that our proposed algorithms are more efficient than the baselines while evaluating the objective and the running time.


  • Optimizing Resource Block Allocation for Multicast in Beyond 5G Networks

    by Ru-Jun Wang, Chih-Hang Wang, De-Nian Yang, Guang-Siang Lee, Wen-Tsuen Chen, Jang-Ping Sheu

    New radio (NR) and non-orthogonal multiple access (NOMA) offer scalable and efficient resource allocation in Beyond 5G (B5G) networks. NR implements mixed numerology with flexible frame structures for future compatibility, whereas NOMA allows users with different channel states to share an identical Physical Resource Block (PRB). Multi-connectivity enables a user to connect to multiple networks for reliability, and multicast conveys data to users simultaneously that request the same content. However, resource allocation in the NOMA-based mixed numerology system with multi-connectivity for multicast remains unexplored. The problem is challenging due to 1) the different shapes of PRBs in NR and 2) the shared locations of PRBs in a frame with NOMA. In this paper, we formulate a new optimization problem, named Multicast, Multi-connectivity, and Multi-Dimensional Resource Allocation Problem (M3DRAP), and prove its NP-hardness and inapproximability. We propose an approximation algorithm for general M3DRAP with the ideas of Multicast Inter-Numerology Relation, Layer Dissimilarity, Subgrouping Nonuniformity, and Segmentation Preference. To find the intrinsic properties of PRB allocation for multicast in NOMA-based networks, we consider a single B5G usage scenario (e.g., eMBB, URLLC, or mMTC) and propose another approximation algorithm. Simulations demonstrate our algorithms improve the weighted sum rate by over 50% and increase the user satisfaction ratio by 1.5x.


  • Laser-Powered UAV Trajectory and Charging Optimization for Sustainable Data-Gathering in the Internet of Things

    by Yue-Shiuan Liau, Y.-W. Peter Hong, Jang-Ping Sheu

    This work examines the trajectory design and energy charging strategy of a data-gathering unmanned aerial vehicle (UAV). The UAV utilizes laser charging from high-altitude platforms (HAPs) to replenish its battery, enabling sustained travel across multiple datagathering points. The trajectory is determined by a sequence of hovering positions at which the UAV stays to perform both data collection and energy charging. The UAV's hovering positions affect both the sensors' transmission rates and the laser-charging efficiency. To minimize the total task completion time, it is necessary to choose hovering positions that consider both data upload and energy charging times. In this work, we first propose the Minimum Completion Time Trajectory and Charging Optimization (MinTime-TCO) algorithm, where the hovering positions and charging energies are optimized in turn using a block coordinate descent approach. Given the UAV's hovering positions, we propose the Minimum Charge Rate Search (MCRS) algorithm to optimize the charging energies at these positions. We show that MCRS is optimal in terms of minimizing the total task completion time. Then, given the charging energies, we propose the Hovering Position Optimization (HPO) algorithm, employing successive convex approximation to address the nonconvexity of the optimization problem. We also propose a low-complexity alternative based on dynamic programming to further reduce computational complexity. Simulation results demonstrate the effectiveness of the proposed algorithms against several baseline strategies.


  • UAV-Enabled Image Capture and Wireless Delivery for On-Demand Surveillance Tasks

    by Nguyen Van Cuong, Y.-W. Peter Hong, Jang-Ping Sheu

    This work examines the task assignment, transmission scheduling, and trajectory design of image-surveillance UAVs dispatched to serve on-demand image capture and delivery services to ground users, e.g., from drivers seeking images of traffic jams or security units requesting images of private homes. In each task, the UAVs are required to capture the image of a specified surveillance region and deliver the image to the requesting user before the deadline. The task assignment, transmission scheduling, and trajectory design are jointly determined to maximize the total surveillance area of the completed tasks. We first examine the single-UAV problem and propose an alternating optimization approach that adopts the exact penalty method to promote near-binary solutions and employ successive convex approximation to deal with the nonconvex trajectory optimization. Then, we extend to the multiple-UAV scenario where cross-UAV tasks may require images to be captured and delivered by different UAVs. To enable distributed implementation, we introduce auxiliary deadlines to limit the time available for local tasks and, thus, decouple the joint optimization problem into multiple single-UAV problems that can be solved in parallel following the procedure derived in the previous case. Numerical simulations are provided to demonstrate the effectiveness of the proposed solutions.


  • Completion Time Minimization for UAV-Enabled Surveillance Over Multiple Restricted Regions

    by Hsiang-Chun Tsai, Y.-W. Peter Hong, Jang-Ping Sheu

    This work examines a UAV-enabled surveillance mission over multiple restricted regions and aims to determine the optimal UAV trajectory that minimizes the mission completion time. The UAV is prohibited from entering the restricted regions due to government regulations or adversarial concerns. However, during the surveillance of a region, the UAV can move along the region's boundary to reduce its distance to the next region once the local task is completed. To exploit this advantage, we propose a minimum completion time (MinTime) algorithm that first determines the visiting order of the regions by employing an approximate solution of the traveling salesman problem (TSP) and then optimizes the UAV trajectory over the sequence of restricted regions using dynamic programming. In the presence of obstacles, we further propose an obstacle-aware MinTime (OA-MinTime) algorithm that treats each obstacle as an additional restricted region with zero surveillance duration, allowing the UAV to avoid the obstacles in a more efficient manner. A modified TSP solution is also proposed by taking into consideration the additional distance required to circumvent the obstacles on each inter-POI path. Simulation results show that the proposed MinTime and OA-MinTime algorithms can significantly reduce the total completion time compared to conventional minimum-distance approaches.


  • UAV Trajectory Optimization for Joint Relay Communication and Image Surveillance

    by Nguyen Van Cuong, Y.-W. Peter Hong, Jang-Ping Sheu

    This work examines the use of image surveillance UAVs for relay communication between ground users and a remote base station (BS). UAVs take aerial images of the surveillance region and forward them to the BS while serving the uplink transmission demands of ground users. We first consider the single-UAV scenario and jointly determine the UAV’s trajectory, task assignment, user association, and rate allocation by maximizing the sum-log-throughput of the users subject to constraints on the surveillance coverage, image transmission requirements, and relay capacity. The resulting mixed-integer nonlinear programming problem is solved by an inexact block coordinate descent (BCD) algorithm where we inherit ideas from the exact penalty method for mathematical programming with equilibrium constraints to relax the integer constraints and the successive convex approximation approach to address the non-convexity of the trajectory optimization problem. Then, we extend the proposed framework to the case with multiple UAVs that are dispatched to cover a wide surveillance region. The UAVs may complete both relay and surveillance tasks more efficiently through cooperation and proper task allocation for UAVs. A similar BCD algorithm is adopted to solve the problem. Numerical simulations are provided to demonstrate the effectiveness of the proposed scheme over several baseline methods.


  • UAV Deployment and IoT Device Association for Energy-Efficient Data-Gathering in Fixed-Wing Multi-UAV Networks

    by Yung-Ching Kuo, Jen-Hao Chiu, Jang-Ping Sheu, Y.-W. Peter Hong

    This work studies the deployment of multiple fixed-wing unmanned aerial vehicles (UAVs) for data-gathering from ground IoT devices and the corresponding device association policy. Each UAV is assumed to follow a circular flight trajectory above its responsible network area in order to stay afloat. The device association and the UAVs’ trajectory centers and radii are jointly optimized to maximize the total energy savings of the devices. Given the trajectory centers and radii, the device association problem is modeled as a multiple 0–1 knapsack problem, and solved by a two-stage maximum energy-saving (MES) device association policy. Moreover, given the device association, the UAVs’ trajectory centers and radii are optimized by an iterative load-balancing (ILB) algorithm, where the trajectory centers are chosen as a load-dependent weighted sum of their associated devices’ locations. Furthermore, we also propose a collision-free scheduling policy that minimizes the total phase offset between the actual and ideal transmission phases of all devices, and a modified MES algorithm that provides higher association priority to devices whose data gathered by the UAV is more outdated. Simulation results show that the proposed MES and ILB algorithms outperform candidate schemes in terms of the total energy savings of IoT devices.