地月空间信息网络链路分配算法研究

在设计拓扑时,如何分配每颗卫星上有限的通信终端建立通信链路,构建一个性能良好的网络拓扑,成为了一个重要的研究问题。以平均月球中继卫星到地面站路径距离最小为优化目标,以卫星携带的通信终端数目、月球中继卫星与地面站的连通性为约束条件,提出了基于竞争决策思想的链路分配算法(Link Assignment Algorithm based on Competitive Decision, LAA-CD)和基于模拟退火法的链路分配算法(Link Assignment Algorithm based on Simulated Annealing,LAA-SA),并与贪婪算法进行对比。仿真结果表明,LAA-CD和LAA-SA算法下所得拓扑的平均月球中继卫星到地面站距离均小于贪婪算法,且LAA-CD算法能够有效降低算法的时间复杂度。进一步对比了两种星座,发现相比拉格朗日轨道卫星星座,在月球极轨道卫星星座下所得拓扑具有更小的平均距离,为空间信息网络分配提供技术支撑。

Link Assignment Algorithm Research on Earth-Moon Spatial Information Network

When we design the topology,how to assign the numerable communication terminals on each satellite to build communication links,and then construct a well performing network topology,becomes a significant research problem. With the object of minimizing the average distance between lunar relay satellites to ground station, and subject to the communication terminal quantity on satellites as well as the connectivity between lunar relay satellites and ground station,we proposed the link assignment algorithm based on competitive decision(LAA-CD)and the link assignment algorithm based on simulated annealing (LAA-SA),and then compared the performances of those two algorithms with the greedy algorithm. The simulation result shows that both resulted topologies of LAA-CD and LAA-SA have shorter average distance than the greedy algorithm,and LAA-SA can greatly reduce the time complexity. This paper further compares two different constellations and finds out the network topology based on the lunar polar orbit satellite constellation always has a shorter average distance than the Earth-Moon Lagrange satellite constellation. It will provide technology support for the future satellite networks assignments.