Underwater acoustic communication routing forwarding method based on uncertain graph

Abstract

The invention discloses an underwater acoustic communication routing forwarding method based on an uncertain graph. The method comprises the following steps: abstracting nodes, links and link stability in an underwater acoustic communication network into vertexes, edges and the probability of existence of the edges in the underwater acoustic communication uncertain graph through an improved K-CLOSE algorithm; traversing all possible worlds meeting the node number condition in the uncertain graph through an improved K-CLOSE algorithm, and mining compact sub-graphs in the uncertain graph; and enabling the nodes in the underwater acoustic communication network to determine the routing path of the underwater acoustic communication network by using the high-probability connectivity of the closest sub-graph in the uncertain graph.

Description

technical field [0001] The present disclosure relates to the field of underwater acoustic communication, in particular to an uncertain graph-based routing and forwarding method for underwater acoustic communication. Background technique [0002] In order to understand, develop and protect the ocean in a more comprehensive way, people have continuously developed many advanced marine equipment, constantly challenging the limit of exploring the ocean. Due to the particularity and complexity of the marine environment, these devices usually need to form a large-scale network. The limitations of traditional wired links in terms of mobility, laying cost and difficulty, as well as the influence of the underwater environment on information transmission carriers have contributed to the rise of underwater acoustic communication networks. As an important tool for collecting marine data and studying marine science, underwater acoustic communication network has important research value a...

AI Technical Summary

Problems solved by technology

[0005] In order to solve the above problems, this disclosure proposes an underwater acoustic communication routing and forwarding method based on an uncertain graph, which solves problems such as hidden nodes and geographic shielding that may appear in the underwater acoustic communication network based on mining the tightest subgraph in the uncertain graph

The underwater acoustic communication network is abstracted into an uncertain graph, and the K-CLOSE algorithm for mining the most compact subgraph is improved to adapt to the decentralized topology of the underwater acoustic communication network, and the underwater acoustic communication node link is transformed into an uncertain graph Probabilistic edges in , which solves the problem of finding densely connected regions in underwater acoustic communication networks

Images