天基自组织网络分布式抗毁路由算法设计与研究

天基自组织网络是一种大时空尺度的复杂网络，具有节点数量庞大、组成复杂、星间拓扑结构高动态变化等特点。为保证网络信息传输的连续性，亟需设计一种能够尽量减少重路由的出现，并对网络故障情况及时给出准确响应的天基自组织网络路由协议。针对现有卫星路由算法使用的源端重路由方法中存在的时延大、丢包率高的问题，提出一种天基自组织网络分布式抗毁路由算法，以最小化端到端时延为约束求解最优路径，并通过断点续传的方法可以在失效节点处重新探测一条到达目的节点的路径。仿真结果表明，在节点可能失效的场景中，该算法以少量控制开销为代价，可以获得较好的数据传输率和时延性能，保证了路由的可靠性和抗毁性。

Design of Distributed Destruction-Resistant Routing Algorithm for Space-Based Self-Organizing Network

The space-based self-organizing network is a complex network with large space-time scale, which has the characteristics of numerous nodes, complex composition, and high dynamic change of inter-satellite topology. To ensure the continuity of network information transmission, it is urgent to design a space-based ad hoc network routing protocol that can minimize the occurrence of rerouting and respond timely and accurately to network failures, thus minimizing the resulting losses. To deal with the problems of large delay and high packet loss rate in the source-end rerouting method used by the existing satellite routing algorithms, this paper proposes a distributed destruction-resistant routing algorithm for the space-based self-organizing network to minimize the end-to-end time. The optimal path is solved for the constraints, and a path to the destination node can be re-detected at the failed node by the break-point continuingly transferring method. The simulation results show that in the scenario where the node may fail, the algorithm can obtain better data transfer rate and delay performance at the cost of a small amount of control overhead, ensuring the reliability and invulnerability of routing.