基于链路权重的分布式星群网络路由算法

Routing Algorithm of Distributed Constellation Network Based on Link Weight

针对分布式卫星群间网络传输时延长、链路连接不稳定的问题,提出一种基于链路权重的改进AODV路由算法。利用链路时延和连接时间定义链路权重,调整蚁群算法的信息素大小,使数据包在传输过程中能够选择权重较小的链路,避开拥塞路径并均衡网络负载。采用蚁群算法改进AODV协议的路由表,达到优化分布式星群网络路由选择的目的。仿真结果表明,该算法在路由选择过程中能够选择低负载的路径,且当数据包发送速率高于600 Kb/s时,与位置辅助路由算法、AODV算法相比,具有较低的平均端到端时延和丢包率,以及较高的网络吞吐量。

Aiming at the problems of long transmission delay and instable link-connection in distributed satellite intergroup network,this paper proposes an improved Ad Hoc On-demand Distance Vector（AODV） routing algorithm based on link weight. It defines the link weight by using link delay and connection time, adjusts the size of pheromone by using ant colony algorithm and chooses the light weight in the transmission process to avoid congestion and trade-off network load. It uses the improved ant algorithm to optimize routing table of AODV protocol to achieve the purpose of optimizing distributed satellite network routing selection. Simulation results show that this algorithm can choose low load path in the routing selection when the data package transmission rate is over 600 Kb/s. Compared with the position auxiliary routing algorithm and AODV algorithm,it can shorten the end-to-end delay,reduce the package loss and improve the throughout.