利用离散时间聚合图的无人机编队最短时延路由协议

Shortest Delay Routing Protocol for UAV Formation with Discrete Time Aggregation Graph

针对传统的无人机编队路由算法无法有效利用拓扑变化的可提前预知特性、以发送探测包的方式获取链路的连接情况会导致开销大等问题,该文引入时变图模型,提出了基于离散时间聚合图的无人机编队最短时延路由协议。首先,利用无人机编队网络的先验知识,如节点的运动轨迹以及网络拓扑变化情况,使用离散时间聚合图对网络的链路资源和拓扑进行表征。其次,基于该图模型设计路由决策算法,即在路由探索阶段将链路时延作为链路权重求解网络的源节点到目的节点的最短时延路由。最后,性能仿真结果表明,该路由协议与传统按需距离矢量路由协议相比提高了网络的分组投递率、降低了端到端时延和网络的控制开销。

Aiming at the problems that the traditional UAV formation routing algorithm cannot effectively utilize the advance predictability of topology changes,and the high cost is caused by acquiring the link connection by sending detection packets,a UAV formation shortest delay routing protocol based on discrete time aggregation graph is proposed by introducing the time-varying graph model.Firstly,using the prior knowledge of the UAV formation network,such as the movement trajectory of nodes and the network topology changes,the network link resources and network topology are characterized by using the discrete time aggregation graph.Secondly,the routing decision algorithm is designed based on the graph model.The delay in the process of route discovery is used as the link weight to solve the shortest delay route from the source node to the destination node of the network.Finally,the simulation performance shows that the routing protocol improves the packet delivery rate,reduces the end-to-end delay and diminishes the network control overhead compared with the traditional Ad-hoc On-Demand Distance Vector routing protocol.