面向低空无线网络的频谱与空域资源联合优化
Joint Spectrum and Airspace Resource Optimization for Low-altitude Wireless Network
AI总结：
针对无人机低空网络的频谱与空域资源耦合优化难题，提出含约束VCG拍卖机制的序列框架，经仿真验证其成本低于基线算法。
AI中文摘要：
低空无线网络已成为支撑无人机（UAV）安全高效作业的有前景平台，但受限于频谱与空域资源有限，高效完成无人机飞行任务且避免碰撞颇具挑战。本文提出一种含两个耦合阶段的序列框架，用于协调频谱分配与空域规划以构建高效低空空中走廊。具体而言，将低空空域离散为一组数字网格，其中障碍物被建模为不可穿透单元；随后构建优化问题以最小化空中走廊总遍历成本，该问题因频谱分配与路径的紧密耦合而难以求解。为此，首先设计一种带约束的维克里-克拉克-格罗夫斯（VCG）升价拍卖机制来分配频谱资源，接着提出一种频谱与空域资源联合分配算法以最小化空中走廊总遍历成本。仿真结果表明，所提算法的总成本低于基线算法。
英文摘要：
Low-altitude wireless networks have emerged as a promising platform for enabling the safe and efficient operation of unmanned aerial vehicles (UAVs). However, due to the limited spectrum and airspace resources, it is challenging to efficiently accomplish UAV flight tasks without collisions. In this paper, we propose a sequential framework with two coupled stages that coordinates spectrum allocation and airspace planning to construct efficient low-altitude air corridors. Specifically, the low-altitude airspace is discretized into a set of digital grids, where obstacles are modeled as impermeable units. Then, we formulate an optimization problem to minimize the total traversal cost of air corridors, which is challenging to solve due to the tight coupling between spectrum allocation and path planning.Therefore, we first design a constrained Vickrey-Clarke-Groves (VCG) ascending auction mechanism to allocate the spectrum resources. Then, we propose a joint spectrum and airspace resource allocation algorithm to minimize the total traversal cost of air corridors. Finally, simulation results show that the proposed algorithms achieve lower total costs than the baseline algorithms.
