基于混合虚拟力算法的卫星跳波束波位优化策略

Beam-Position Optimization Strategy for Satellite Beam Hopping Based on a Hybrid Virtual Force Algorithm

摘要:

跳波束技术使卫星通信资源的分配更加灵活,但现有的跳波束资源分配策略研究重点多为星上资源的分配,未考虑地面波位划分的优化问题,针对该问题提出一种基于混合虚拟力算法的卫星跳波束波位优化策略；基于Voronoi图进行跳波束波位划分,根据用户优先级和业务优先级计算加权业务量,以负载均衡为目标建立优化问题；将传统虚拟力算法中固定的移动步长改为随迭代次数变化的自适应移动步长,并在迭代后期采用果蝇优化算法寻找最优解；仿真结果表明,所提算法实现了负载均衡的效果,避免了优先级较高的用户和业务集中于单个波位的情况；相比传统虚拟力算法,混合虚拟力算法的收敛速度快,全局寻优能力更强。

Abstract:

Beam-hopping technology enables more flexible allocation of satellite communication resources. However, most existing studies on beam-hopping resource allocation focus on onboard resources and do not consider optimizing the partitioning of ground beam positions. To address this issue, we propose a beam-position optimization strategy for satellite beam hopping based on a hybrid virtual force algorithm. Beam positions are partitioned using Voronoi diagrams, and a weighted traffic demand is computed according to user and service priorities. An optimization problem is formulated with load balancing as the objective. The fixed movement step size in the conventional virtual force algorithm is replaced by an adaptive step size that varies with the iteration count, and a fruit fly optimization algorithm is applied in the later iterations to search for the optimal solution. Simulation results show that the proposed algorithm achieves load balancing and avoids the concentration of high-priority users and services within a single beam position. Compared with the traditional virtual force algorithm, the hybrid virtual force algorithm converges faster and exhibits stronger global optimization capability.