A Maximum Flow Routing Algorithm for Multi-Unmanned Surface Vessel Networks

Based on Storage Time Aggregated Graph (STAG) model in time-varying graph theory, we investigate the single-source-single-sink maximum flow problem in a time-varying Ad hoc network comprised of multiple unmanned surface vessels (USVs). In order to optimize the number of iterations of the STAG-based maximum flow algorithm, a new method for seeking an augmenting path is proposed by adopting the Breadth First Search (BFS) method combined with the redesigning routing rules. The experimental results show that, the proposed method can effectively reduce the number of iterations of the existing STAG-based maximum flow algorithms, thereby reducing the network processing delay.