Routing Algorithm Based on High Latency Communication Node Awareness in Dynamic Networks

Aiming at the instability of communication links caused by environmental interference, dynamic change of node location, and long distance between nodes in the dynamic networking process of mobile clusters, this paper proposes an algorithm for high delay communication node perception and routing in dynamic networking, predicts the nodes that may generate high communication delay, and optimizes the path selection between high delay nodes to prevent network congestion. First of all, according to the communication status in the time series, the BiLSTM algorithm is used to predict the attenuation trend of the signal with the increase of distance, and calculate the distance between nodes that can establish efficient communication; Then, based on elbow method and K-means algorithm, group is divided according to the distance that can establish efficient communication, critical nodes are identified, and cost capacity diagram is constructed for critical nodes; Finally, according to the network flow optimization algorithm with maximum cost and maximum flow constraint, the best matching link is calculated and mapped to the communication path between critical nodes. By planning the path selection strategy between nodes with high latency communication in the cluster, the problem of unstable communication in the cluster is solved with less system overhead and faster convergence speed.