CN114025403A - Communication method and system based on underwater acoustic network routing algorithm - Google Patents

Communication method and system based on underwater acoustic network routing algorithm Download PDF

Info

Publication number
CN114025403A
CN114025403A CN202111253444.2A CN202111253444A CN114025403A CN 114025403 A CN114025403 A CN 114025403A CN 202111253444 A CN202111253444 A CN 202111253444A CN 114025403 A CN114025403 A CN 114025403A
Authority
CN
China
Prior art keywords
node
difference
packet
priority
delay
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
CN202111253444.2A
Other languages
Chinese (zh)
Inventor
李梅菊
徐涛
李旭宏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zaozhuang University
Original Assignee
Zaozhuang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zaozhuang University filed Critical Zaozhuang University
Priority to CN202111253444.2A priority Critical patent/CN114025403A/en
Publication of CN114025403A publication Critical patent/CN114025403A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G08B25/01—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems characterised by the transmission medium
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G08B25/01—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems characterised by the transmission medium
    • G08B25/10—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems characterised by the transmission medium using wireless transmission systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B11/00—Transmission systems employing sonic, ultrasonic or infrasonic waves
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B13/00—Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
    • H04B13/02—Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Emergency Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a communication method and a communication system based on an underwater acoustic network routing algorithm. The method comprises the following steps: calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node; updating a candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table; and when each underwater node receives the information to be transmitted, selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission. Because no limitation is made on the direction when the forwarding node is selected, a loop forwarding condition exists, and a loop avoidance algorithm is designed for the loop forwarding condition. The method can shorten the end-to-end delay of the data packet, reduce the conflict between the delivery rate and the energy consumption of the traditional routing algorithm, and reduce the energy consumption of the system while ensuring the data delivery rate.

Description

Communication method and system based on underwater acoustic network routing algorithm
Technical Field
The invention relates to the technical field of underwater acoustic networks, in particular to a communication method and a communication system based on an underwater acoustic network routing algorithm.
Background
With the development of the microelectronic industry and the terrestrial wireless sensor networks, in recent years, Underwater Wireless Sensor Networks (UWSNs) are receiving more and more attention. UWSNs have wide application in the aspects of underwater resource detection, pollution monitoring, navigation and the like. The optical signal has the characteristics of scattering and rapid attenuation under water, and cannot be applied to an ultra-wideband network. Radio Frequency (RF) cannot be applied to UWSNs because of its fast attenuation. Thus, the hydroacoustic signals are applied in UWSNs. The routing protocol is an important component of the UWSNs, and the design of a good routing algorithm has important significance for popularization and application of the UWSNs. The UWSNs have the characteristics of low available bandwidth, limited energy, dynamic topological structure, high error rate, low signal propagation speed, high economic cost, low network security and the like, so that the routing protocol of the ground network cannot be directly used in the underwater acoustic network. When designing UWSNs routing protocols, the following characteristics must be considered: (1) a dynamic topology. On the one hand, the underwater sensor nodes move with the movement of the vessel, the activity of microorganisms, and the like. On the other hand, the dead zone of the underwater node causes a change in the topology. (2) And long time delay. The propagation speed of the sound signal is only 1500m/s, which is 5 orders of magnitude lower than the propagation speed of the radio signal in air. (3) The energy is limited. The underwater sensor node can only be charged by a battery and cannot use solar energy. Once the battery is exhausted, the node is considered dead.
The long delay of the underwater acoustic network is still a problem in the field at present due to the slow propagation speed of the acoustic signal. In disaster early warning, such as early warning of earthquake and tsunami, the life and property loss of people is greatly reduced when the early warning signal is received every second in advance.
Disclosure of Invention
Based on the above, the invention aims to provide a communication method and a communication system based on an underwater acoustic network routing algorithm, so that the delay of underwater signal transmission is shortened.
In order to achieve the purpose, the invention provides the following scheme:
a communication method based on an underwater acoustic network routing algorithm comprises the following steps:
calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node;
updating a candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table;
and when each underwater node receives the information to be transmitted, selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission.
Further, calculating the priority of the neighbor node of each node specifically includes:
calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, wherein the difference is a first difference;
calculating the difference value between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, wherein the difference value is a second difference value;
calculating the difference value between the time when the current node receives the hello packet and the time when the neighbor node sends the hello packet, wherein the difference value is a third difference value;
calculating a delay according to the first difference, the second difference and the third difference;
and calculating the priority of the current node according to the delay and the residual energy of the current node.
Further, the priority calculation formula is as follows:
P＝K1α+K2β
wherein P represents priority, K1And K2The constant values represent the weights of the delay and the residual energy respectively, alpha represents the ratio of the residual energy of the node to the initial energy, and beta represents the delay.
Further, still include: and a loop avoidance algorithm is adopted to avoid loop forwarding of data between the nodes.
Further, a loop avoidance algorithm is adopted to avoid loop forwarding of data between nodes, and specifically includes:
when node NiReceives a message from a neighbor node Ni+1When the flag bit of the 'ACK' packet is '1', firstly deleting neighbor node information for sending the 'ACK' packet in a candidate routing table, and forwarding the neighbor node with the highest priority value of the rest nodes in the candidate routing table as the best next hop node; if node NiIf the ACK feedback packet with the flag bit of 1 sent by another next hop node is received, the current node is connected to the previous hop node Ni-1Sending the ACK with the flag bit of 2, after the ACK packet with the flag bit of 2 is received by the previous hop node, setting the type of the packet as a circulating packet at the head flag bit of the data packet and broadcasting, when the neighbor node receives the data packet with the flag bit of the circulating packet, firstly judging whether the circulating packet is received before, if so, discarding the circulating packet, otherwise, changing the flag bit of the circulating packet into a common data packet, and forwarding the common data packet.
The invention also provides a communication system based on the underwater acoustic network routing algorithm, which comprises:
the priority calculation module is used for calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node;
the updating module is used for updating the candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table;
and the selection module is used for selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission when each underwater node receives the information to be transmitted.
Further, the priority calculating module specifically includes:
the first difference calculation unit is used for calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, and the difference is a first difference;
the second difference calculation unit is used for calculating the difference between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, and the difference is a second difference;
a third difference value calculating unit, configured to calculate a difference value between a time when the current node receives the hello packet and a time when the neighbor node sends the hello packet, where the difference value is a third difference value;
a delay calculating unit, configured to calculate a delay according to the first difference, the second difference, and the third difference;
and the priority calculating unit is used for calculating the priority of the current node according to the delay and the residual energy of the current node.
Further, the priority calculation formula is as follows:
P＝K1α+K2β
wherein P represents priority, K1And K2The constant values represent the weights of the delay and the residual energy respectively, alpha represents the ratio of the residual energy of the node to the initial energy, and beta represents the delay.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention provides a communication method and a system based on an underwater acoustic network routing algorithm, wherein the method comprises the following steps: calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node; updating a candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table; and when each underwater node receives the information to be transmitted, selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission. Meanwhile, a loop avoidance algorithm is designed to avoid loop forwarding of the data packets. The method can shorten the end-to-end delay of the data packet, reduce the conflict between the delivery rate and the energy consumption of the traditional routing algorithm, and reduce the energy consumption of the system while ensuring the data delivery rate.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
Fig. 1 is a flowchart of a communication method based on an underwater acoustic network routing algorithm according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a communication method based on an underwater acoustic network routing algorithm according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the topology of an underwater acoustic network;
FIG. 4 is a schematic of a time delay analysis;
FIG. 5 is another schematic of the topology of an underwater acoustic network;
fig. 6 is a flow chart of a loop avoidance algorithm.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention aims to provide a communication method and a communication system based on an underwater acoustic network routing algorithm, which can shorten the delay of underwater signal transmission.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
As shown in fig. 1-2, the communication method based on the underwater acoustic network routing algorithm provided by the present invention includes the following steps:
step 101: and calculating the priority of the neighbor nodes of each node according to the delay and the residual energy of each underwater node.
Step 102: updating a candidate routing information table of each underwater node according to the priority; the candidate routing information table stores two neighbor nodes with the highest priority.
Step 103: and when each underwater node receives the information to be transmitted, selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission.
Wherein, step 101 specifically includes:
step 1011: and calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, wherein the difference is a first difference.
Step 1012: and calculating the difference between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, wherein the difference is a second difference.
Step 1013: and calculating the difference value between the time when the current node receives the hello packet and the time when the neighbor node sends the hello packet, wherein the difference value is a third difference value.
Step 1014: and calculating the time delay according to the first difference, the second difference and the third difference.
Step 1015: and calculating the priority of the current node according to the delay and the residual energy of the current node.
The priority calculation formula is as follows:
P＝K1α+K2β
wherein P represents priority, K1And K2The constant values represent the weights of the delay and the residual energy respectively, alpha represents the ratio of the residual energy of the node to the initial energy, and beta represents the delay.
The method further comprises the following steps: and a loop avoidance algorithm is adopted to avoid loop forwarding of data between the nodes.
The loop avoidance algorithm specifically includes:
when node NiReceives a message from a neighbor node Ni+1When the flag bit of the 'ACK' packet is '1', firstly deleting neighbor node information for sending the 'ACK' packet in a candidate routing table, and forwarding the neighbor node with the highest priority value of the rest nodes in the candidate routing table as the best next hop node; if node NiAlso received from another next-hop nodeThe flag bit is 'ACK' feedback packet of '1', then the current node is one hop node Ni-1Sending the ACK with the flag bit of 2, after the ACK packet with the flag bit of 2 is received by the previous hop node, setting the type of the packet as a circulating packet at the head flag bit of the data packet and broadcasting, when the neighbor node receives the data packet with the flag bit of the circulating packet, firstly judging whether the circulating packet is received before, if so, discarding the circulating packet, otherwise, changing the flag bit of the circulating packet into a common data packet, and forwarding the common data packet.
Fig. 2 is a schematic diagram of a communication method based on an underwater acoustic network routing algorithm, and the principle of the communication method based on the underwater acoustic network routing algorithm is described in detail below:
as shown in FIG. 3, N0To the transmitting node, node N2，N3And N4Is node N0Neighbor of (N)1Is node N2Neighbor of (N)5Is node N3And N4Of the network. The length of the line segment connecting the nodes indicates the length of time that the data has elapsed to propagate between the two nodes. N is a radical of0There are multiple paths to the Sink node, including: route 1: n is a radical of0→N2→N1→ sink, route 2: n is a radical of0→N3→N5→ sink, route 3: n is a radical of0→N4→N5→ sink. The underwater node has no knowledge about the position information of the underwater node, and the distance from the underwater node to the sink node can be judged according to the time delay through the beacon signal sent by the sink node. The node stores the sum of the time that the beacon signal passes from the sink node to the neighbor node and the time that the "hello" packet passes from the neighbor node to itself in the candidate routing information table. The time when the sink node sends out the beacon signal is set as t0Node N1The time when the beacon signal is received is t1Then the beacon signal arrives at node N1The elapsed time is Δ t1＝t1-t0Node N2Is node N0Neighbor of (N), node N2The time of receiving beacon signal is t2Node N3The time of receiving beacon signal is t3Node N4The time of receiving beacon signal is t4. The beacon signal arrives at node N from the sink node2，N3And N4The time difference is respectively delta t2＝t2-t0，Δt3＝t3-t0，Δt4＝t4-t0. Nodes N2, N3 and N4The time of sending out the "hello" packet is respectively recorded as
Figure BDA0003323144180000061
To know
Figure BDA0003323144180000062
Node N0 receives a message from node N2，N3And N4The "hello" packets of (1) are respectively at t'2，t′3And t'4. "hello" packet slave neighbor node N2，N3And N4To node N0The elapsed times are respectively
Figure BDA0003323144180000063
Figure BDA0003323144180000064
As can be seen from fig. 4, it cannot be determined which neighbor node is the best node simply according to the delay difference of the neighbor node receiving the beacon signal or the delay difference of the "hello" packet from the neighbor node received by the current node, and the two nodes need to be combined in the process of selecting the forwarding node in each hop, so that the path with the shortest delay from the source node to the sink node can be found.
From the trilateral relation analysis of the triangle, the trilateral relation of the triangle satisfies that the sum of two sides is larger than the third side, namely for any node NiNeighbor N ofi+1May be formed by node Ni，Ni+1Form a triangle with the sink node (when Ni+1At node NiWhen the three nodes are connected with the sink, the three nodes are a straight line, and equal numbers are taken) and all have the formula (1):
T(Ni→sink)≤T(Ni→Ni+1)+T(Ni+1→sink) (1)
in the formula (1), T (N)i→ sink) represents the packet slave node NiThe delay experienced by a single hop delivery to the sink node. T (N)i→Ni+1)+T(Ni+1→ sink) represents information slave node NiVia Ni+1The sum of the time elapsed to reach the sink node. Thus, in practical applications, the signal is from node NiThe propagation delay to the sink node is more than or equal to T (N)i→ sink), the closer the path the signal travels to the vector
Figure BDA0003323144180000071
The closer the time required is to the delay value, the higher the priority of the neighbor node should be. As can be seen from the delay analysis in conjunction with FIG. 4, the signal passes through the neighboring node N3The sum of the experienced delays is the shortest, so node N takes into account only the delays3Is the highest priority.
In order to achieve energy balance of the system and prolong the service life of the network, in the method, an energy threshold needs to be set, and when the residual energy of the nodes is lower than the energy threshold, the forwarding of data is stopped, and the data is only collected from the surrounding environment as a source node. The difference is that when the node sends out the hello packet, the node residual energy value needs to be extracted firstly, when the node residual energy reaches a preset threshold value, the hello packet is sent out, otherwise, the hello packet is stopped to be sent, and the hello packet is not used as a forwarding node any more.
TABLE 1 hello packet Format
Figure BDA0003323144180000072
The types of control packets sent out in the method include "hello" packets and beacon packets. The "hello" packet format is shown in table 1.
The meaning of each field in table 1 is as follows:
ID 1: the node ID number of the "hello" packet is sent.
ID 2: the source sink node ID number of the beacon signal received by the node.
Seq: the sequence number of the beacon signal received by the node.
T1: the beacon signal received by the node experiences a delay.
Re: the remaining energy of the node.
Load: the payload, including the "hello" packet transmission timestamp, and the delay experienced by the beacon signal received by itself.
The beacon signal only includes the ID number of the sink node, the serial number, and the timestamp of the time when the signal was sent out.
Table 2 candidate routing information table
Figure BDA0003323144180000081
The meaning of each field in the information table is as follows:
ID: neighbor node ID number.
Seq: the sequence number of the last received "hello" packet.
Re: the remaining energy of the node.
Pri: for the priority value of a node, see 4.3.2 for a specific algorithm.
T1: and the beacon signal received by the corresponding neighbor is delayed from the sink to the node.
T2: the delay experienced by the "hello" packet sent out by the corresponding neighbor is received.
Exp: the validity time of the neighbor node information.
The priority is calculated as follows:
P＝K1α+K2β (2)
Figure BDA0003323144180000082
Figure BDA0003323144180000083
the neighbor node priority calculation method is shown as a formula (2) and is represented by P, wherein alpha and beta are obtained by a formula (3) and a formula (4), and K1And K2Is a constant, and represents the weight of delay and residual energy, k1+k21, and 0 ≤ k1≤1，0≤k2Less than or equal to 1. The formula (3) represents the ratio of the node residual energy to the initial energy, which is represented by alpha, wherein Re _ energy represents the node residual energy thenergyRepresenting the node residual energy threshold. Equation (4) represents the proximity (i.e., delay) of the node to the ideal path, represented by β, Δ tiRepresents the difference between the time when the node receives the beacon signal and the time when the Sink node transmits the beacon signal, delta ti+1The difference value of the time when the neighbor node of the node receives the beacon signal from the Sink node and the time when the beacon signal is sent is shown as delta ti，i+1Indicating the difference between the time a node receives a "hello" packet from a neighbor and the time the neighbor sends the "hello" packet. As can be seen from the equation, the more the remaining energy of the node, the shorter the delay, the larger the priority value. So the larger the P value the higher the node priority.
In order to save storage space, each node only stores two neighbor nodes with the highest priority in the candidate routing information table. The initial value of all the entries in the candidate routing information table is set to "1". When receiving the hello packets of the first two neighbors, directly storing the corresponding information in the candidate neighbor table, and designing the calculated priority value as P1And P2. Then, when a "hello" packet is received for each neighbor, its priority value N is calculated and compared to the values in the candidate neighbor table, N-min (P)1，P2) And when the priority of the 'hello' packet source node is greater than N, replacing the information of the node with the information of the neighbor node corresponding to N in the candidate routing table. Otherwise, the "hello" packet is discarded directly.
Figure BDA0003323144180000091
The loop avoidance algorithm is as follows:
defining a cycle node: during the process that the node receives the data packet (the information to be transmitted collected by the underwater node) and forwards the data packet to the sink, the calculated optimal next-hop node is still the previous-hop node, and the data received by the previous-hop node is still forwarded to the current node, so that the data is repeatedly forwarded between the two nodes to form a loop, and the node receiving the data is called a loop node.
In the communication method based on the underwater acoustic network routing algorithm, the priority values of the nodes are compared only under the condition that the residual energy threshold is met, and the cyclic forwarding condition is easy to occur because the directionality of the forwarding nodes is not limited in the process of selecting the forwarding nodes. For example, in the topology shown in FIG. 5, node N0In order to be the current sending node,
Figure BDA0003323144180000101
and is
Figure BDA0003323144180000102
The best next hop is node N according to the IMER rule described above3. While the topology satisfies
Figure BDA0003323144180000103
And is
Figure BDA0003323144180000104
Thus, N3The best next hop of (c) is still node N0. In this case, the packet will be at node N0And N3Until some of the node energy values drop below the threshold.
On one hand, the occurrence of the cyclic forwarding condition wastes the very limited energy of the node and shortens the service life of the network; and on the other hand, the data packet cannot be delivered to the sink node, and the packet delivery rate is reduced. Therefore, in order to avoid this, it is necessary to design an effective coping method, i.e. a loop avoidance algorithm.
As shown in fig. 6, in the round robin avoidance algorithm, a node receiving a data packet needs to send an acknowledgement, i.e., "ACK". The "ACK" includes a flag bit field, a node ID number field, a destination node ID number field, and a sequence number field of a packet to be acknowledged. When the ACK flag bit is filled with 0When the "ACK" flag bit is filled to "1", it indicates that the node is a cyclic node and cannot continue forwarding the data packet. When receiving the data packet, the node firstly queries the candidate routing information table to determine the best next hop, and if the best next hop ID of the candidate routing information table is the sending node ID of the data, the node continues to query whether the node with the second priority exists. If the neighbor node with the second priority exists, the node with the second priority is the optimal next hop of the current node, and the current node sends 'ACK' with the flag bit of '0' to the optimal previous hop node; if the node does not exist, the node is indicated to be a cycle node, an ACK packet with a flag bit of 1 is broadcasted, and a cycle avoidance algorithm is started. The loop avoidance algorithm is embodied as shown in the flowchart of fig. 6. When node NiReceives a message from a neighbor node Ni+1When the flag bit is '1' or 'ACK' packet, firstly deleting the neighbor node information for sending the 'ACK' packet in the candidate routing table, and forwarding the neighbor node (the node is not the previous hop node) with the highest priority value of the rest nodes in the candidate routing table as the best next hop, if the node N isiIf the ACK feedback packet with the flag bit of 1 sent by another next hop node is received, the current node is connected to the previous hop node Ni-1And sending an ACK packet with a flag bit of 2, setting the type of the packet as a circulating packet and broadcasting the packet at the flag bit of the head of the data packet after a previous hop node receives the ACK packet, firstly judging whether the data packet is received before when a neighbor node receives the data packet with the flag bit of the circulating packet, discarding the data packet if the data packet is received before, and otherwise, changing the flag bit of the circulating packet into a common data packet and forwarding the data packet.
Figure BDA0003323144180000111
Algorithmic effect analysis
The method provided by the invention has outstanding advantages in the application scene sensitive to delay, obviously shortens the end-to-end delay of the data packet, reduces the conflict between the delivery rate and the energy consumption of the traditional routing algorithm, and reduces the energy consumption of the system while ensuring the data delivery rate. Meanwhile, the invention does not make clear regulation on the direction of the next hop node during data forwarding, improves the data delivery rate and possibly causes the condition of circular forwarding. Due to the great advantage of the invention in the aspect of data transmission delay, the invention has good application prospect in disaster early warning aspects such as tsunami, earthquake and the like.
The invention also provides a communication system based on the underwater acoustic network routing algorithm, which comprises:
the priority calculation module is used for calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node;
the updating module is used for updating the candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table;
and the selection module is used for selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission when each underwater node receives the information to be transmitted.
Wherein the priority calculating module specifically comprises:
the first difference calculation unit is used for calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, and the difference is a first difference;
the second difference calculation unit is used for calculating the difference between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, and the difference is a second difference;
a third difference value calculating unit, configured to calculate a difference value between a time when the current node receives the hello packet and a time when the neighbor node sends the hello packet, where the difference value is a third difference value;
a delay calculating unit, configured to calculate a delay according to the first difference, the second difference, and the third difference;
and the priority calculating unit is used for calculating the priority of the current node according to the delay and the residual energy of the current node.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.

Claims (8)

1. A communication method based on an underwater acoustic network routing algorithm is characterized by comprising the following steps:
calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node;
updating a candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table;
and when each underwater node receives the information to be transmitted, selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission.
2. The communication method based on the underwater acoustic network routing algorithm according to claim 1, wherein calculating the priority of the neighbor node of each node specifically includes:
calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, wherein the difference is a first difference;
calculating the difference value between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, wherein the difference value is a second difference value;
calculating the difference value between the time when the current node receives the hello packet and the time when the neighbor node sends the hello packet, wherein the difference value is a third difference value;
calculating a delay according to the first difference, the second difference and the third difference;
and calculating the priority of the current node according to the delay and the residual energy of the current node.
3. The underwater acoustic network routing algorithm-based communication method according to claim 2, wherein the priority calculation formula is as follows:
P＝K1α+K2β
wherein P represents priority, K1And K2The constant values represent the weights of the delay and the residual energy respectively, alpha represents the ratio of the residual energy of the node to the initial energy, and beta represents the delay.
4. The underwater acoustic network routing algorithm-based communication method according to claim 1, further comprising: and a loop avoidance algorithm is adopted to avoid loop forwarding of data between the nodes.
5. The communication method based on the underwater acoustic network routing algorithm according to claim 1, wherein a loop avoidance algorithm is used to avoid loop forwarding of data between nodes, and specifically includes:
when node NiReceives a message from a neighbor node Ni+1When the flag bit of the 'ACK' packet is '1', firstly deleting neighbor node information for sending the 'ACK' packet in a candidate routing table, and forwarding the neighbor node with the highest priority value of the rest nodes in the candidate routing table as the best next hop node; if node NiIf the ACK feedback packet with the flag bit of 1 sent by another next hop node is received, the current node is connected to the previous hop node Ni-1Sending ACK with flag bit of 2, after the former hop node receives ACK packet with flag bit of 2, marking the header of data packetThe flag bit setting packet is of a type of a cyclic packet and is broadcasted, when a neighbor node receives a data packet of which the flag bit is the cyclic packet, whether the cyclic packet is received before is judged, if the cyclic packet is received before, the cyclic packet is discarded, otherwise, the flag bit of the cyclic packet is changed into a common data packet, and the common data packet is forwarded.
6. A communication system based on an underwater acoustic network routing algorithm, comprising:
the priority calculation module is used for calculating the priority of the neighbor node of each node according to the delay and the residual energy of each underwater node;
the updating module is used for updating the candidate routing information table of each underwater node according to the priority; two neighbor nodes with the highest priority are stored in the candidate routing information table;
and the selection module is used for selecting the neighbor node with the highest priority in the updated candidate routing information table for data transmission when each underwater node receives the information to be transmitted.
7. The underwater acoustic network routing algorithm-based communication system according to claim 6, wherein the priority calculation module specifically includes:
the first difference calculation unit is used for calculating the difference between the moment when the current node receives the beacon signal and the moment when the Sink node sends the beacon signal, and the difference is a first difference;
the second difference calculation unit is used for calculating the difference between the time when the neighbor node of the current node receives the beacon signal and the time when the Sink node sends the beacon signal, and the difference is a second difference;
a third difference value calculating unit, configured to calculate a difference value between a time when the current node receives the hello packet and a time when the neighbor node sends the hello packet, where the difference value is a third difference value;
a delay calculating unit, configured to calculate a delay according to the first difference, the second difference, and the third difference;
and the priority calculating unit is used for calculating the priority of the current node according to the delay and the residual energy of the current node.
8. The underwater acoustic network routing algorithm-based communication system according to claim 7, wherein the priority calculation formula is as follows:
P＝K1α+K2β
wherein P represents priority, K1And K2The constant values represent the weights of the delay and the residual energy respectively, alpha represents the ratio of the residual energy of the node to the initial energy, and beta represents the delay.
CN202111253444.2A 2021-10-27 2021-10-27 Communication method and system based on underwater acoustic network routing algorithm Withdrawn CN114025403A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111253444.2A CN114025403A (en) 2021-10-27 2021-10-27 Communication method and system based on underwater acoustic network routing algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111253444.2A CN114025403A (en) 2021-10-27 2021-10-27 Communication method and system based on underwater acoustic network routing algorithm

Publications (1)

Publication Number Publication Date
CN114025403A true CN114025403A (en) 2022-02-08

Family

ID=80057888

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111253444.2A Withdrawn CN114025403A (en) 2021-10-27 2021-10-27 Communication method and system based on underwater acoustic network routing algorithm

Country Status (1)

Country Link
CN (1) CN114025403A (en)

Similar Documents

Publication Publication Date Title
JP4573914B2 (en) Relay device, control method, and program
Shah et al. Predictive location-based QoS routing in mobile ad hoc networks
Wahid et al. An energy-efficient routing protocol for UWSNs using physical distance and residual energy
CN101932062B (en) Multipath routing method in Ad Hoc network environment
CN103476086B (en) Dynamic multi-path AODV method for routing based on the prediction of node congestion degree
CN111148178A (en) DSR routing protocol implementation method based on unmanned aerial vehicle ad hoc network
US9578587B2 (en) Wireless communication device and route selection method in wireless network
CN110868727A (en) Data transmission delay optimization method in wireless sensor network
US9191846B2 (en) Monitoring method of multi-hop wireless network
Meghanathan A location prediction-based reactive routing protocol to minimize the number of route discoveries and hop count per path in mobile ad hoc networks
CN114025403A (en) Communication method and system based on underwater acoustic network routing algorithm
Gruber et al. Ad hoc routing for cellular coverage extension
Singh et al. Advanced routing on AODV using link prediction in mobile Ad-Hoc network
Zhou et al. A bidirectional Q-learning routing protocol for UAV networks
CN114390631A (en) Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction
KR20080018042A (en) Method and apparatus for an improvement of routing performance in ad hoc networks
Hoang et al. Efficient load balancing in MANETs to improve network performance
Malvankar et al. An availability-based link QoS routing for mobile ad hoc networks
Kumar et al. Energy efficient routing protocol avoiding route breaks based on DSR
Gnanasekaran et al. Link breakage time based QoS improvement in mobile ad hoc network
Li et al. A real-time routing protocol for (m, k)-firm streams in wireless sensor networks
Day An Efficient Data Collection Protocol For Underwater Wireless Sensor Networks
Jain et al. Power Efficient MANET
Deng et al. LPAR: Link Stability Prediction-based Adaptive Routing Protocol for Flying Ad Hoc Networks
CN105050151A (en) OLSR (Optimized Link State Routing) method based on energy awareness and location prediction

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20220208

WW01 Invention patent application withdrawn after publication