为了研究直升机编队飞行在链路中断或节点中断情况下的路径恢复, 基于紫外光非直视通信的路径损耗, 采用Dijkstra算法寻找网络连通性的前提下直升机编队飞行通信网络的最优路径, 通过节点移动来实现链路中断或节点中断时的路径恢复。通过理论以及仿真分析, 得到了最优路径在不同链路断开时的路径恢复情况。结果表明, 采用所提出的算法虽然在节点移动时需要花费2s~3s的时间, 但是与路径重寻方法相比, 3跳和4跳节点的链路收敛时间能够有效减小0.2ms和0.4ms, 路径权值同样能够减小20dB和45dB, 因此该算法具有可行性。这一结果对机群间路径快速恢复的研究有一定的应用价值。

In order to study the path recovery of helicopter formation flying in the two cases of link expiration or node outage, based on the analysis of the path loss in ultraviolet (UV) non-line-of-sight (NLOS) communication. Dijkstra algorithm was adopted to find the optimal path of helicopters flying in formation communications network under network connectivity. Path recovery was achieved by node moving at link expiration or node outage. After theoretical simulation and analysis, the path recovery of the optimal path in different links expiration was obtained. The results show that although the algorithm spends 2s~3s time to move the nodes, compared with the paths re-search method, the convergence time of three-hop and four-hop node can effectively reduce 0.2ms and 0.4ms. The path weight also can reduce 20dB and 45dB. The algorithm is feasible and has applicable value for studying path fast recovery of inter clusters.