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.
UAV ad hoc networkUAV formationTime-varying graph modelShortest delay route
万方数据
维普
