Method and system for realizing underwater acoustic sensor network routing protocol
By using link quality information and energy levels to select the optimal relay node in the water acoustic sensor network, the problems of transmission delay and energy consumption are solved, and the reliability and efficiency of data transmission are improved, which is better than the existing protocols .
Patent Information
- Application Number
- CN202411104241.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-13
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2044-08-13
AI Technical Summary
The existing water acoustic sensor networks have network changes caused by long delay, narrow bandwidth, slow power signal attenuation, high error rate, high noise and topological changes in data transmission, and lack effective routing protocol solutions.
A water acoustic sensor network routing protocol was designed to select the optimal relay node through link quality information between nodes, and use HANDSHAKE-S and HANDSHAKE-R data packets to shake hands, calculate the link quality and select the best relay node. , combining energy level and link quality, optimize data transmission paths and reduce the possibility of communication gaps.
It effectively improves the reliability and energy-saving performance of data transmission, reduces the handshake frequency, improves the reliability and efficiency of the protocol, and is better than the performance of existing protocols in terms of packet loss rate, energy consumption and delay.
Smart Images

Figure CN119071870A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of underwater acoustic sensor network and underwater acoustic routing protocol, and in particular to a method and system for implementing an underwater acoustic sensor network routing protocol. Background Art
[0002] Underwater Acoustic Sensor Network (UASN) is a key component of underwater communication technology and is of great significance for underwater monitoring, marine development and national defense applications. However, existing underwater acoustic sensor networks use sound signals instead of radio frequency for wireless communication, which has limitations such as long and variable delay, narrow bandwidth, slow power signal attenuation, high error rate, and high noise; therefore, link quality is an important factor to consider when forwarding data packets to the aggregation node. In addition, most sensor nodes are powered by batteries with limited energy. When designing routing protocols, energy consumption needs to be considered, and network changes caused by topology changes must also be considered. At present, there is still a lack of an effective solution. Summary of the invention
[0003] In order to solve at least one of the technical problems existing in the prior art to a certain extent, the present invention aims to provide a method and system for implementing an underwater acoustic sensor network routing protocol.
[0004] The first technical solution adopted by the present invention is:
[0005] A method for implementing an underwater acoustic sensor network routing protocol comprises the following steps:
[0006] Node x transmits a first data packet to a number of its neighboring nodes; wherein the first data packet includes a first hop value;
[0007] After receiving the first data packet, the neighbor node compares the first hop value with the second hop value stored in the neighbor node; if the second hop value is greater than the first hop value, the second data packet is fed back to achieve handshake; otherwise, the first data packet is discarded; wherein the second data packet includes the link quality between the two nodes;
[0008] After receiving the second data packet, node x selects the best relay node from neighboring nodes according to the link quality; and sends a third data packet to the selected best relay node;
[0009] After receiving the third data packet, the best relay node feeds back an ACK signal;
[0010] If node x receives the ACK signal, it determines that the data transmission is successful; otherwise, the node is eliminated and the process of selecting the best relay node is returned and re-executed.
[0011] Furthermore, the link quality is calculated as follows:
[0012]
[0013] In the formula, x represents node x, y represents node y, and the formula represents the link quality calculation when node x sends data to node y; α, β, γ, and δ are all adjustable parameters; S x,y represents the success rate between node x and node y; HC(y) is the hop count of node y; is the average value of the link quality between node y and other neighboring nodes excluding node x; It is the maximum value of the link quality between all neighboring nodes of node y; E(y) represents the energy level of node y.
[0014] Furthermore, the type of the first data packet is HANDSHAKE-S; the format of the HANDSHAKE-S sent by the initiating node is: TypeID, NodeID, PacketID, HC, Q-packet, the first four of which respectively represent the data packet type, sender ID, HANDSHAKE-S ID and the number of hops of the sender; Q-packet constitutes a data packet queue, which contains the forwarding data to be processed represented by the pktsrc, pktid pair.
[0015] Furthermore, the type of the second data packet is HANDSHAKE-R; the format of the HANDSHAKE-R sent by the receiving node is: TypeID, NodeID, PacketID, HC, Packet-Bit, Energy, Link-Quality, Packet-Bit indicates whether the receiving node saves the forwarding data to be processed in its cache, if there is data, the corresponding queue bit is set to 1; Energy indicates the energy of the HANDSHAKE-R sender; LinkQuality is to quantify the link quality between the two nodes participating in the handshake.
[0016] Furthermore, the node x is a sink node, which sends Hello data packets in the network at fixed time intervals during the network initialization phase to establish a handshake between nodes.
[0017] Furthermore, the Hello data packet includes the ID and hop count of the forwarding node in the format of<node's ID,hc> ; The ID of the forwarding node is initially the ID of the sink node, and the hop count starts from 0;
[0018] When node y receives a Hello packet, it checks whether its current hop count HC(y) is greater than the hop count HC (hop count) in the received packet; if so, node y updates its hop count HC(y) by adding 1 to the value in the Hello packet, and then node y updates and forwards the Hello packet; if not, node y discards the received Hello packet to maintain the integrity of the hop count.
[0019] Furthermore, the method for implementing the underwater acoustic sensor network routing protocol also includes the following steps:
[0020] If node x successfully sends data to node y, node y has a higher priority in subsequent data transmission, that is, in the next data transmission, node x calculates the average energy E of its neighboring nodes. avw , if the energy of node y is greater than E ave , then node y is directly selected as the best relay node without handshake again; node x directly sends data to node y. If node x does not receive the ACK signal from node y, it initiates handshake with its adjacent nodes to select another best relay node.
[0021] Furthermore, the method for implementing the underwater acoustic sensor network routing protocol also includes the following steps:
[0022] If the link qualities of all neighboring nodes of node x are lower than a preset threshold, node x does not send data.
[0023] The second technical solution adopted by the present invention is:
[0024] A system for implementing an underwater acoustic sensor network routing protocol comprises a plurality of nodes, wherein data is transmitted between the plurality of nodes using the above-mentioned method for implementing an underwater acoustic sensor network routing protocol.
[0025] The beneficial effects of the present invention are as follows: the present invention utilizes the link quality information of each node for data transmission. When selecting the optimal relay, it is necessary to consider the link quality between the next-hop node and the adjacent node, which effectively reduces the possibility of the node encountering a communication gap and improves the reliability of the protocol. BRIEF DESCRIPTION OF THE DRAWINGS
[0026] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the embodiments of the present invention or the drawings of related technical solutions in the prior art are introduced below. It should be understood that the drawings introduced below are only for the convenience of clearly describing some embodiments of the technical solutions of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.
[0027] Figure 1 is a flowchart of the steps of a method for implementing an underwater acoustic sensor network routing protocol in an embodiment of the present invention;
[0028] Figure 2 It is a flow chart of the handshake phase in an embodiment of the present invention. DETAILED DESCRIPTION
[0029] The embodiments of the present invention are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and are not to be construed as limitations of the present invention. For the step numbers in the following embodiments, they are only provided for the convenience of explanation, and the order between the steps is not limited in any way, and the execution order of each step in the embodiment can be adaptively adjusted according to the understanding of those skilled in the art.
[0030] In the description of the present invention, it should be understood that descriptions involving orientations, such as up, down, front, back, left, right, etc., and orientations or positional relationships indicated are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present invention.
[0031] In the description of the present invention, "several" means one or more, "more" means more than two, "greater than", "less than", "exceed" etc. are understood as not including the number itself, and "above", "below", "within" etc. are understood as including the number itself. If there is a description of "first" or "second", it is only used for the purpose of distinguishing the technical features, and cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.
[0032] In the description of the present invention, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in the present invention based on the specific content of the technical solution.
[0033] In response to some problems existing in existing routing protocols, the present invention designs a location-free and energy-saving, channel-aware routing protocol called the Energy-Efficient Reliable Routing Protocol (EERP protocol). The protocol uses the link quality information of each node for data transmission. When selecting the optimal relay, not only the transmission success rate between the node and the next-hop node should be evaluated, but also the link quality between the next-hop node and the adjacent node should be considered. This method effectively reduces the possibility of nodes encountering communication gaps. In addition, the protocol combines the concept of relay node persistence, greatly reducing the handshake frequency between nodes and saving energy.
[0034] like Figure 1 As shown, this embodiment provides a method for implementing an underwater acoustic sensor network routing protocol, which specifically includes the following steps:
[0035] S1. Node x transmits a first data packet to several of its neighboring nodes; wherein the first data packet includes a first hop value.
[0036] Here, node x represents an initiating node, which can be a sink node or other nodes. Node x sends a first data packet to different nodes around it to establish a handshake.
[0037] In some embodiments, the first data packet is in HANDSHAKE-S format, and the HANDSHAKE-S format includes TypeID, NodeID, PacketID, HC, and Q-packet, and the first four represent the data packet type, sender ID, HANDSHAKE-S ID, and the number of hops of the sender, respectively. Q-packet constitutes a data packet queue, which contains the forwarding data to be processed represented by the pktsrc and pktid pairs.
[0038] S2. After receiving the first data packet, the neighbor node compares the first hop value with the second hop value stored in the neighbor node; if the second hop value is greater than the first hop value, the second data packet is fed back to achieve handshake; otherwise, the first data packet is discarded; wherein the second data packet includes the link quality between the two nodes.
[0039] After receiving the first data packet, the neighbor node of node x (referred to as node y) parses the content of the data packet and compares HC(x) in the first data packet with the second hop value HC(y) pre-stored in node y. If HC(y) is greater than HC(x), a second data packet is generated and fed back to node x. Otherwise, node y discards the first data packet.
[0040] In some embodiments, the type of the second data packet is HANDSHAKE-R, which is a response data packet sent by the receiving node, and the format is (TypeID, NodeID, PacketID, HC, Packet-Bit, Energy, Link-Quality). Packet-Bit indicates whether node y saves the forwarding data to be processed in its cache. If there is data, the corresponding queue bit is set to 1. Energy indicates the energy of the sender of HANDSHAKE-R, and LinkQuality quantifies the link quality between the two nodes participating in the handshake. The specific calculation method is as follows:
[0041]
[0042] The link quality calculation of adjacent nodes follows formula (1), S x,y It represents the success rate between node x and node y, which is calculated as the ratio of actual data forwarding to theoretical data forwarding; theoretical data forwarding occurs when node x and node y successfully handshake and select node y as the next hop of data relay node; actual data forwarding occurs when the exponential packet is successfully transmitted from node x to node y after the handshake is successful. is the average value of the link quality between node y and its neighboring nodes (excluding node x); is the maximum value of the link quality between all neighbor nodes of node y. The EERP protocol considers these values of the next hop to avoid routing problems and reduce the risk of routing traps. E(y) represents the energy level of node y, reducing the risk of packet loss due to insufficient energy of node y. The constants α, β, γ, and δ in the formula are all adjustable parameters used to control the balance between the next hop link quality and the node energy. In the scenario of poor link quality, increasing the weight of the link quality of the subsequent hop can improve the reliability of the protocol.
[0043] S3. After receiving the second data packet, node x selects the best relay node from neighboring nodes according to link quality; and sends a third data packet to the selected best relay node.
[0044] S4. After receiving the third data packet, the best relay node feeds back an ACK signal.
[0045] S5. If node x receives the ACK signal, it is determined that the data transmission is successful; otherwise, the node is eliminated and the process returns to step S3 and re-executes the step of selecting the best relay node.
[0046] The EERP protocol method is described in detail below with reference to the accompanying drawings.
[0047] 1) Network initialization phase
[0048] The sink node will broadcast a "Hello" packet in the network at a fixed time interval. The "Hello" packet includes the ID of the forwarding node (initially the ID of the sink node) and the hop count (starting from 0), and the format is<node's ID,hc> . When node y receives a "Hello" packet, it checks whether its current hop count HC(y) is greater than the hop count HC (hop count) in the received packet. If so, node y updates its hop count HC(y) by adding the value in the "Hello" packet to 1. Then it resends the "Hello" packet, updates the hop count HC(y) and broadcasts the forwarding node information. If not satisfied, node y discards the received "Hello" packet to maintain the integrity of the hop count. This process lasts for a few seconds, after which the periodic transmission of the "Hello" packet stops. A successful handshake must be established between nodes before further communication. Optionally, the node that receives the "Hello" packet will feed back an ACK message to the aggregation node to indicate that the information has been received.
[0049] 2) Handshake phase
[0050] In the handshake phase, two types of packets are used: HANDSHAKE-S and HANDSHAKE-R. The format of HANDSHAKE-S sent by the initiating node is TypeID, NodeID, PacketID, HC, Q-packet. The first four represent the packet type, sender ID, HANDSHAKE-S ID and the number of hops of the sender respectively. Q-packet constitutes a packet queue, which contains the pending forwarding data represented by the pktsrc, pktid pair. HANDSHAKE-R is the response packet sent by the receiving node, and the format is (TypeID, NodeID, PacketID, HC, Packet-Bit, Energy, Link-Quality). Packet-Bit indicates whether node y saves the pending forwarding data in its cache. If there is data, the corresponding queue bit is set to 1. Energy represents the energy of the HANDSHAKE-R sender, and LinkQuality quantifies the link quality between the two nodes participating in the handshake.
[0051] See also Figure 2 , Figure 2This is a flowchart of the handshake phase. Before a node starts data transmission, a handshake phase is started. If node y is a neighbor node of node x, after node y receives the HANDSHAKE-S sent by node x, node y will compare the hop count. If HC(y) is large, node y checks whether there is Q-packet data in the cache, generates a HANDSHAKE-R data packet with Packet-Bit set to 1, and returns it to node x. If HC(y) is small, node y discards the HANDSHAKE-S data packet.
[0052] After node x receives the HANDSHAKE-R from its neighbor, it selects the best relay node from the responding neighbor nodes. Then, node x determines which data packets in the queue can be discarded by the Packet-Bit in the HANDSHAKE-R of the selected relay. Finally, node x forwards the data packet to the selected best relay node, assuming it is node z. If node z successfully receives the data packet, it will send an ACK (acknowledgement) to node x. If node x does not receive an ACK within the specified waiting time (round-trip time), it will select a node with the next best link quality for data transmission and repeat this process. If the link quality of all neighboring nodes of node x is lower than the set threshold, the data packet is discarded.
[0053] As an optional implementation, in subsequent data transmission, the node that successfully transmitted data previously has a higher priority. That is, if node x successfully sent data to node z in the previous data transmission, then in this data transmission, node x will calculate the average energy of its neighboring nodes (denoted as E ave ), if the energy of node z is greater than E ave , then node z is selected as the best relay node. There is no need to shake hands again. Node x sends data directly to node z. If it does not receive an ACK from node z, it initiates a handshake with its adjacent nodes to select the best relay node.
[0054] 3) Experimental verification
[0055] This embodiment uses multiple performance indicators in the simulation: packet loss rate, energy consumption per packet, and end-to-end delay to compare the invented EERP protocol with the existing VBF protocol (Vector-Based Forwarding). The proposed routing protocol is simulated using MATLAB, and the results show that the proposed protocol has better performance in terms of packet transmission success rate, end-to-end delay, etc. Unlike other protocols that trade delay for other indicators, the EERP protocol maintains low delay and is superior to the VBF protocol in these aspects.
[0056] Among them, the definitions of various performance indicators are as follows:
[0057] a) Packet loss rate: the ratio of data packets not received by the source node to the data packets generated.
[0058] b) Energy consumed per packet: It represents the ratio of the total energy consumed by the network to transmit data packets to the number of data packets received by the sink node.
[0059] c) End-to-end delay: The average time from the source node initiating data packet transmission to the sink node successfully receiving the data packet, including propagation, transmission, holding and calculation time.
[0060] This embodiment also provides a system for implementing an underwater acoustic sensor network routing protocol, including multiple nodes, wherein the multiple nodes are connected using Figure 1 or Figure 2 A method for implementing an underwater acoustic sensor network routing protocol is shown for data transmission.
[0061] Specifically, the node can be implemented by an existing node device, wherein the node includes a sink node and an underwater sensor node, the sink node is located at the center of the water surface, and the underwater sensor nodes are randomly distributed in a three-dimensional underwater area. The system of this embodiment can execute a method for implementing an underwater acoustic sensor network routing protocol provided by the method embodiment of the present invention, and can execute any combination of implementation steps of the method embodiment, and therefore, has the corresponding functions and beneficial effects of the method.
[0062] In the above description of this specification, the description with reference to the terms "one embodiment / example", "another embodiment / example" or "certain embodiments / examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.
[0063] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.
[0064] The above is a specific description of the preferred implementation of the present invention, but the present invention is not limited to the above embodiments. Those skilled in the art may make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of this application.
Claims
1. A method for implementing a routing protocol for an underwater acoustic sensor network. It is characterized in that The following steps are involved: Node x transmits a first data packet to several of its neighboring nodes; The first data packet includes a first hop value; After receiving the first data packet, the neighboring node compares the first hop value with the second hop value stored in the neighboring node; If the second hop value is greater than the first hop value, the second data packet is fed back to achieve handshake; otherwise, the first data packet is discarded; The second data packet includes the link quality between the two nodes; After receiving the second data packet, node x selects the best relay node from neighboring nodes according to the link quality; and sends a third data packet to the selected best relay node; After receiving the third data packet, the best relay node feeds back an ACK signal; If node x receives the ACK signal, it determines that the data transmission is successful; otherwise, the node is eliminated and the process of selecting the best relay node is returned and re-executed.
2. A method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The link quality is calculated as follows: In the formula, x represents node x, y represents node y, and the formula represents the link quality calculation when node x sends data to node y; α, β, γ, and δ are all adjustable parameters; S x,y represents the success rate between node x and node y; HC(y) is the hop count of node y; is the average value of the link quality between node y and other neighboring nodes excluding node x; It is the maximum value of the link quality between all neighboring nodes of node y; E(y) represents the energy level of node y.
3. The method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The type of the first data packet is HANDSHAKE-S; the format of the HANDSHAKE-S sent by the initiating node is: TypeID, NodeID, PacketID, HC, Q-packet, the first four of which respectively represent the data packet type, sender ID, HANDSHAKE-SID and the number of hops of the sender; Q-packet constitutes a data packet queue, which contains the forwarding data to be processed represented by the pktsrc, pktid pair.
4. The method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The type of the second data packet is HANDSHAKE-R; the format of the HANDSHAKE-R sent by the receiving node is: TypeID, NodeID, PacketID, HC, Packet-Bit, Energy, Link-Quality, Packet-Bit indicates whether the receiving node saves the forwarding data to be processed in its cache. If there is data, the corresponding queue bit is set to 1; Energy indicates the energy of the HANDSHAKE-R sender; LinkQuality is to quantify the link quality between the two nodes participating in the handshake.
5. The method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The node x is a sink node, which sends Hello data packets in the network at fixed time intervals during the network initialization phase, so as to establish a handshake between nodes.
6. A method for implementing an underwater acoustic sensor network routing protocol according to claim 5, It is characterized in that The Hello data packet includes the ID and hop count of the forwarding node, and the format is<node's ID,hc> ;The ID of the forwarding node is initially the ID of the sink node; When node y receives a Hello packet, it checks whether its current hop count HC(y) is greater than the hop count HC (hop count) in the received packet; if so, node y updates its hop count HC(y) by adding 1 to the value in the Hello packet, and then node y updates and forwards the Hello packet; if not, node y discards the received Hello packet to maintain the integrity of the hop count.
7. The method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The method for implementing the underwater acoustic sensor network routing protocol also includes the following steps: If node x successfully sends data to node y, node y has a higher priority in subsequent data transmission, that is, in the next data transmission, node x calculates the average energy E of its neighboring nodes. ave , if the energy of node y is greater than E ave , then node y is directly selected as the best relay node without handshake again; node x directly sends data to node y. If node x does not receive the ACK signal from node y, it initiates handshake with its adjacent nodes to select another best relay node.
8. The method for implementing an underwater acoustic sensor network routing protocol according to claim 1, It is characterized in that The method for implementing the underwater acoustic sensor network routing protocol also includes the following steps: If the link qualities of all neighboring nodes of node x are lower than a preset threshold, node x does not send data.
9. An implementation system for an underwater acoustic sensor network routing protocol, It is characterized in that It comprises a plurality of nodes, and data transmission is performed between the plurality of nodes using an implementation method of an underwater acoustic sensor network routing protocol as described in any one of claims 1 to 8.
Citation Information
Patent Citations
Realization method for underwater acoustic sensor network opportunistic routing protocol
CN106413022A
Underwater sensor network routing protocol system based on weighted link quality
CN117580125A
