🤖 AI Summary
This paper investigates an unmanned aerial vehicle (UAV)-assisted integrated sensing, communication, and computation (ISCC) system, jointly optimizing physical-layer security, target sensing, and computation offloading. The UAV emits radar signals to localize eavesdroppers and perform active jamming while concurrently supporting task offloading for ground users. Under coupled constraints—including UAV velocity, transmit power, propulsion energy consumption, and task latency—the objective is to minimize the total user energy consumption. To this end, we formulate a strongly coupled, non-convex optimization problem that jointly designs the offloading ratio, user scheduling, secure beamforming, and three-dimensional UAV trajectory—constituting the first such integrated optimization in the literature. A two-stage iterative algorithm is proposed, combining successive convex approximation (SCA) and block coordinate descent (BCD). Numerical results validate convergence and demonstrate significant gains in both security performance and energy efficiency.
📝 Abstract
Integrated communication and sensing, which can make full use of the limited spectrum resources to perform communication and sensing tasks simultaneously, is an up-and-coming technology in wireless communication networks. In this work, we investigate the secrecy performance of an uncrewed aerial vehicle (UAV)-assisted secure integrated communication, sensing, and computing system, where the UAV sends radar signals to locate and disrupt potential eavesdroppers while providing offload services to ground users (GUs). Considering the constraints of UAV maximum speed, transmit power, and propulsion energy, as well as secure offloading, data transmission, and computation time, the total energy consumption of GUs is minimized by jointly optimizing user offloading ratio, user scheduling strategy, transmit beamforming, and UAV trajectory. An efficient iterative optimization algorithm is proposed to solve the non-convex optimization problem caused by tightly coupled dependent variables. In particular, the original optimization problem is decomposed into four sub-optimization problems, and the non-convex sub-problems are transformed into approximately convex forms via successive convex approximation. Then, all sub-problems are solved successively by using the block coordinate descent technique. Numerical results demonstrate the convergence and validate the effectiveness of the proposed algorithm.