21 June 2022 in IEEE Transactions on Wireless Communications
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.
14 May 2024 in IEEE Transactions on Wireless Communications
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.
24 July 2025 in IEEE Transactions on Green Communications and Networking
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.
23 December 2025 in IEEE Transactions on Green Communications and Networking
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.
28 October 2014 in ICT Research
Cryptographic solution for protecting data which pass through an insecure public network is widely applied. To ensure the data confidentiality and availability, the secret key must be exchanged securely between parties before beginning a transaction session. This paper presents a protocol to enhance the flexibility and secrecy of symmetric key exchange over the Internet. Our approach uses an asymmetric encryption algorithm to protect symmetric encryption keys from thefts and tampers over a transmission line. In addition, this paper presents a protocol to ensure the integrity, confidentiality of the symmetric key, and the freshness of a transaction session. Experimental results from a prototype system based on FPGA are also revealed.