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.