Distributed routing protocol method for three-dimensional underwater acoustic sensor networks

Abstract

Disclosed is a distributed routing protocol method for three-dimensional underwater acoustic sensor networks. Supposing that each node knows its own geographic location and channels are bidirectional and symmetrical, transponding cost is calculated and transponding nodes are selected according to factors such as the node location, utilization rate of the channel, energy, and the like when data transponding is required. Node energy is used as effectively as possible on the premise that other network performances are not affected, and balanced use of the energy of each node and the utilization rate of the underwater acoustic channel are considered. The purpose is to use the channel effectively so as to minimize energy consumption, improve the utilization rate of the energy and the channel of the networks, and prolong the service life of the whole networks.

Description

technical field [0001] The invention relates to a routing protocol at the network layer of a sensor network, in particular to a distributed routing protocol method applied to a three-dimensional underwater acoustic sensor network, and belongs to the technical field of underwater acoustic signal processing. Background technique [0002] Network end-to-end delay, throughput, and energy consumption are basic technical indicators that reflect network performance. Traditional routing protocols mostly use the shortest path algorithm, that is, to find a path with the shortest distance between two nodes as the optimal path, such as Dijkstra algorithm, A *(A-star) algorithm, D*(D-star) algorithm, Bellman-Ford algorithm, etc. Most of these algorithms only limit the conditions at the cost of the distance between nodes, and do not consider some limiting factors in other aspects. Therefore, Only a few shortest paths are used to send information. Collisions are likely to occur in the netw...

AI Technical Summary

Problems solved by technology

[0002] Network end-to-end delay, throughput, and energy consumption are basic technical indicators that reflect network performance. Traditional routing protocols mostly use the shortest path algorithm, that is, to find a path with the shortest distance between two nodes as the optimal path, such as Dijkstra algorithm, A *(A-star) algorithm, D*(D-star) algorithm, Bellman-Ford algorithm, etc. Most of these algorithms only limit the conditions at the cost of the distance between nodes, and do not consider some limiting factors in other aspects. Therefore, Only a few shortest paths are used to send information. Collisions are likely to occur in the network, resulting in loss of information packets, and retransmission of information packets will increase energy consumption. Unbalanced use of energy will cause some nodes to consume prematurely. As much energy as possible will lead to link failure, reduce the end-to-end delay, throughput and energy consumption performance of the network, and shorten the survival time of the network

Images