Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

2 results about "Multi path routing" patented technology

Multi-path routing method and system for a drone swarm

PendingCN122340021AUncrewed vehicleEngineering
This application discloses a multipath routing method and system for unmanned aerial vehicle (UAV) swarms. The multipath routing method for UAV swarms includes the following steps: initialization; acquiring network status information and traffic characteristic information; performing priority scheduling based on the acquired network status information and traffic characteristic information to determine the scheduling queue; determining whether ground equipment can communicate directly with the UAV; if the ground equipment cannot communicate directly with the UAV, initiating a multipath routing algorithm to make multipath diversion decisions; performing multipath diversion and forwarding execution based on the multipath diversion decisions; and updating the scheduling queue after completing the multipath diversion and forwarding execution. This application achieves differentiated transmission control for different task flows through traffic characteristic awareness and priority queue mechanisms, enabling latency-sensitive tasks to be prioritized for scheduling and forwarding, thereby significantly improving the on-time arrival rate of data packets and enhancing the transmission guarantee capability of heterogeneous task flows.
Owner:BEIJING UNIV OF POSTS & TELECOMM

Short-wave ad-hoc network multi-path routing method based on node disjoint and adaptive offloading

This application relates to the field of shortwave ad hoc network routing optimization technology, and in particular to a multipath routing method for shortwave ad hoc networks based on node disjointness and adaptive traffic splitting. The method includes: each node exchanging messages according to a preset period to obtain one-hop neighbor information and two-hop neighbor information; constructing a comprehensive link cost model based on the current node's one-hop symmetric neighbors; modeling the shortwave ad hoc network as an original topology graph; performing a shortest path search on the original topology graph based on the comprehensive link cost to obtain primary and backup paths based on node disjointness constraints; and allocating service traffic according to the comprehensive link cost of the primary and backup paths. The method designed in this application can improve the service continuity, throughput performance, latency performance, and network robustness of shortwave ad hoc networks under conditions of sudden link degradation and rapid topology changes, while ensuring controllable routing computation complexity.
Owner:CHONGQING UNIV OF POSTS & TELECOMM