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 "Ad hoc network routing" patented technology

A routing method for distributed unmanned aerial vehicle ad hoc networks based on deep reinforcement learning

The application relates to a kind of distributed unmanned aerial vehicle ad hoc network routing methods based on deep reinforcement learning, comprising;According to Markov decision process, the deep reinforcement learning architecture of unmanned aerial vehicle communication network is built;Running Dijkstra algorithm sends original data packet from source node to destination node and generates original training data according to the routing process of original data packet to pre-train the deep reinforcement learning architecture;The coordinates of the destination node D of target data packet are input, the next hop node B of current node A is obtained using the pre-trained deep reinforcement learning architecture, and target training data is generated, and the deep reinforcement learning architecture is retrained according to the original training data and target training data;Next hop node B is used as starting node, until the next hop node is the destination node, the routing of target data packet is completed, and the application can enhance the robustness of network and improve the life of unmanned aerial vehicle communication network.
Owner:CHONGQING 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