Method and system for realizing energy consumption balance of underwater sensor network nodes

The clustering algorithm is divided and the cluster head node is selected according to location and energy factors. Combined with double-hop communication, the problems of node energy balance and data packet transmission in the underwater sensor network are solved, extending the network life and reducing energy consumption.

CN119071875APending Publication Date: 2024-12-03SUN YAT SEN UNIV

Patent Information

Application Number
CN202411104242.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-13
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

The existing underwater sensor networks have shortcomings in the balance of node energy consumption and energy consumption reduction, especially in the selection of cluster head nodes and packet transmission, which can easily lead to energy depletion and packet loss.

Method used

The clustering algorithm is used to divide the underwater sensor nodes into multiple clusters, and the cluster first node is selected according to factors such as the location in the cluster, residual energy and propagation delay, and data packets are transmitted through double-hop communication to ensure the energy balance of the cluster first node. and the extension of network life.

Benefits of technology

By rationally selecting the cluster head node and adopting double-hop communication, the energy balance of nodes is achieved, and packet loss caused by insufficient energy from the cluster head node is avoided, the survival time of the network is extended, and energy consumption is reduced.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071875A_ABST
    Figure CN119071875A_ABST
Patent Text Reader

Abstract

The invention discloses an underwater sensor network node energy consumption balance realization method and system, an underwater sensor network comprises a sink node and underwater sensor nodes, and the underwater sensor nodes comprise cluster head nodes and non-cluster head nodes; the method comprises the following steps of: dividing underwater sensor nodes into a plurality of clusters by adopting a clustering algorithm; according to a preset factor, selecting one underwater sensor node from each cluster as a cluster head node of the cluster, and taking other underwater sensor nodes of the cluster as non-cluster head nodes; and detecting and judging whether the working energy consumption of the cluster head node in each cluster reaches a preset threshold, and if so, updating the cluster head node of the cluster according to a preset factor. According to the invention, the cluster head node is selected according to the in-cluster position, residual energy, propagation delay and other factors, so that the selection of the cluster head node is more reasonable, and the problem of data packet loss caused by insufficient residual energy due to large energy consumption of the cluster head node is avoided. The method can be widely applied to the technical field of underwater acoustic sensor networks.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of underwater acoustic sensor networks, and in particular to a method and system for realizing energy consumption balancing of underwater sensor network nodes. Background Art

[0002] Underwater sensor networks (UWSNs) are a special type of wireless sensor network composed of acoustic sensor nodes, which are usually designed to monitor and control vast waters, such as real-time warship monitoring, positioning mooring positions, and ocean data collection. Compared with traditional sensor networks, underwater sensor networks use acoustic technology and consume more energy, while clustering routing protocols can achieve energy-saving and reliable network communications. At present, a variety of distributed and centralized clustering routing strategies have been proposed, such as clustering vector-based forwarding algorithm (CVBF) and three-dimensional geographic adaptive fidelity (BAGF) routing protocol, but these protocols still have shortcomings in achieving node energy consumption balance and energy reduction. Summary of the invention

[0003] In order to solve one of the technical problems existing in the prior art to at least a certain extent, the object of the present invention is to provide a method and system for realizing energy consumption balancing of underwater sensor network nodes.

[0004] The first technical solution adopted by the present invention is:

[0005] A method for realizing energy consumption balance of underwater sensor network nodes, wherein the underwater sensor network comprises a sink node and underwater sensor nodes, wherein the underwater sensor nodes comprise cluster head nodes and non-cluster head nodes; the method for realizing node energy consumption balance comprises the following steps:

[0006] Clustering algorithm is used to divide underwater sensor nodes into multiple clusters;

[0007] According to the preset factors, one underwater sensor node is selected in each cluster as the cluster head node of the cluster, and the other underwater sensor nodes of the cluster are selected as non-cluster head nodes;

[0008] Detect and determine whether the working energy consumption of the cluster head node in each cluster reaches a preset threshold, and if so, update the cluster head node of the cluster according to the preset factors;

[0009] Among them, the preset factors include the location within the cluster, the residual energy and the propagation delay.

[0010] Furthermore, the working energy consumption includes at least one of working time, amount of data packets transmitted or number of times data packets are transmitted.

[0011] Furthermore, the clustering algorithm is used to divide the underwater sensor nodes into multiple clusters, including:

[0012] A1. Determine the number of clusters k and randomly obtain k underwater sensor nodes in the underwater sensor network as the initial cluster centers;

[0013] A2. Calculate the distance between each underwater sensor node and k cluster centers, assign the underwater sensor node to the nearest cluster center, and generate k clusters;

[0014] A3. For each cluster, calculate the average value of all underwater sensor nodes assigned to the cluster as the centroid; the average value here refers to the average value of the spatial coordinates of all data points in the cluster, that is, the coordinates of the centroid are the mean of all data points;

[0015] A4. Update the cluster center according to the centroid and return to execute steps A2-A3 until the position of the centroid no longer changes, and obtain the final k clusters.

[0016] Further, the determining the number of clusters k includes:

[0017] The silhouette coefficient method is used to determine the number of clusters k.

[0018] Furthermore, the position within the cluster is determined as follows:

[0019] Calculate the Euclidean distance between the candidate cluster head node and other nodes in the cluster, and select the candidate node with the smallest sum of distances as the cluster head node; where the Euclidean distance CCH_d j The calculation formula is as follows:

[0020]

[0021] In the formula, CCH_d j represents the position of the jth candidate node in the cluster, p j is the position of the node in the corresponding cluster, CCHp j Represents the position of the jth candidate node.

[0022] Furthermore, the residual energy RE i is determined as follows:

[0023] When selecting the cluster head node, the node's residual energy level must be considered and a residual energy threshold is set. When the node's residual energy is less than the residual energy threshold, the node cannot be selected as the cluster head node.

[0024] Furthermore, the propagation delay t i is determined as follows:

[0025] Select the node with the smallest propagation delay as the cluster head node, where the propagation delay calculation formula is:

[0026]

[0027] In the formula, t i Represents the i-th node N in the network i Propagation delay with the sink node; d i Represents node N i The distance from the converging node; v is the speed of sound in water.

[0028] Further, selecting an underwater sensor node in each cluster as a cluster head node of the cluster according to preset factors includes:

[0029] Calculate the quality CCHQ of the candidate node based on the preset factors i :

[0030] CCHQ i =γ[αRE i +(1-α)CCH_d j ]+(1-γ)t i

[0031] In the formula, constants α and γ are weights;

[0032] Calculate the quality of each candidate node and select the node with the highest quality as the cluster head node.

[0033] Furthermore, the method for realizing energy consumption balance of underwater sensor network nodes further includes the following steps:

[0034] In the data packet transmission stage, if the transmission distance between the cluster head node and the non-cluster head node exceeds the preset distance threshold, a double-hop communication method is used to transmit the data packet.

[0035] Furthermore, the method for implementing energy consumption balance of underwater sensor network nodes also includes the step of network initialization:

[0036] The aggregation node broadcasts hello information to nodes within the communication range;

[0037] The node that receives the hello message from the sink node then sends a hello message carrying the forwarding node identity (ID) and the remaining energy by broadcasting until the message reaches all reachable underwater sensor nodes;

[0038] The node that receives the hello message feeds back an ACK message to indicate that the message has been received; the ACK message includes the receiving node identity (ID), remaining energy, and the distance between the receiving node and the sending node;

[0039] During the initialization process, each node maintains its neighbor node information table to share and update information regularly.

[0040] The second technical solution adopted by the present invention is:

[0041] A system for realizing energy consumption balance of underwater sensor network nodes comprises a sink node and underwater sensor nodes, wherein the above method is adopted to select and update a cluster head node from the underwater sensor nodes.

[0042] The beneficial effects of the present invention are as follows: the present invention selects the cluster head node according to factors such as the position within the cluster, the residual energy and the propagation delay, so that the selection of the cluster head node is more reasonable, and the problem of the loss of data packets caused by insufficient residual energy of the cluster head node due to large energy consumption is avoided. In addition, the node with the smallest sum of average distances to other non-cluster head nodes is selected as the cluster head to minimize energy consumption, and while ensuring the balanced energy consumption of each network node participating in the communication, the energy of data packet transmission from each non-cluster head node to the cluster head node is minimized, thereby extending the network life. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] 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.

[0044] Figure 1 It is a flowchart of the steps of a method for realizing energy consumption balancing of underwater sensor network nodes in an embodiment of the present invention;

[0045] Figure 2 Schematic diagram of a model of an underwater sensor network in an embodiment of the present invention. DETAILED DESCRIPTION

[0046] 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.

[0047] 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.

[0048] 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.

[0049] 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.

[0050] like Figure 1 As shown, this embodiment provides a method for implementing energy consumption balancing of underwater sensor network nodes. The underwater sensor network includes a sink node and underwater sensor nodes. The underwater sensor nodes include cluster head nodes and non-cluster head nodes. The method for implementing node energy consumption balancing includes the following steps:

[0051] S1. Clustering algorithm is used to divide underwater sensor nodes into multiple clusters.

[0052] In some embodiments, step S1 specifically includes the following steps:

[0053] S11, determining the cluster number k, and randomly obtaining k underwater sensor nodes in the underwater sensor network as initial cluster centers;

[0054] S12, calculating the distance between each underwater sensor node and k cluster centers, assigning the underwater sensor node to the nearest cluster center, and generating k clusters;

[0055] S13. For each cluster, calculate the average value of all underwater sensor nodes assigned to the cluster as the centroid;

[0056] S14. Update the cluster center according to the centroid, and return to execute steps S12-S13 until the position of the centroid no longer changes, and obtain the final k clusters.

[0057] As a further optional implementation, the number of clusters k is determined using a silhouette coefficient method.

[0058] S2. Select one underwater sensor node in each cluster as the cluster head node of the cluster and the other underwater sensor nodes of the cluster as non-cluster head nodes according to preset factors, wherein the preset factors include the position within the cluster, the residual energy and the propagation delay.

[0059] After obtaining k clusters, the cluster head node is selected for each cluster. Since the cluster head node needs to communicate with other non-cluster head nodes and has a high work intensity, it consumes much more energy than other nodes. Therefore, it is necessary to select the cluster head node based on multiple considerations to ensure that the energy consumption of each network node participating in the communication is balanced, while minimizing the energy of data packet transmission from each non-cluster head node to the cluster head node, thereby extending the network life.

[0060] S3. Detect and determine whether the working energy consumption of the cluster head node in each cluster reaches a preset threshold. If so, update the cluster head node of the cluster according to preset factors.

[0061] When it is detected that the working energy consumption of the cluster head node in a cluster reaches a preset threshold, it is necessary to start the cluster head node update process of the cluster. In some embodiments, the working energy consumption is the working time, such as starting to calculate the time from when a node is elected as the cluster head node. When the calculated time reaches the preset time, the cluster head node update process is started. In other embodiments, the working energy consumption is the number of transmitted data packets. When it is detected that the cluster head node receives a fixed threshold of data packets, the cluster head node update process is started. In the cluster head node update process, the quality CCHQ of the candidate node is recalculated based on the preset factors. i , select the node with the highest quality as the cluster head node.

[0062] The above method is explained in detail below with reference to the accompanying drawings and specific implementation methods.

[0063] (1) Underwater sensor network model

[0064] The underwater sensor network model of this embodiment relies on a three-dimensional static hydroacoustic sensor network model and adopts a single sink architecture. The sink node is located at the center of the water surface, and the sensor nodes are randomly distributed in the three-dimensional underwater area, following a Poisson distribution. Figure 2 As shown in the figure, the underwater sensor network model has a clustering structure. The yellow underwater sensor nodes represent cluster head nodes. Other non-cluster head nodes send data to the corresponding cluster head nodes through direct transmission or collaborative transmission. The underwater robot (AUV) is used to assist the communication between the underwater sensor nodes and the sink nodes.

[0065] For the protocol proposed in this embodiment, the following assumptions are set for the convenience of description: in the three-dimensional static underwater acoustic sensor network (3D UWSN) model, the surface aggregation node has unlimited energy supply, and all underwater sensor nodes can use precise positioning technology to determine the geographical location of themselves and the aggregation node.

[0066] This embodiment takes into account multiple key factors that determine the efficiency and reliability of underwater communication systems, including signal frequency, transmission delay, and path loss, which have a comprehensive impact on the durability of the network. Therefore, this protocol also comprehensively considers the energy consumption model and sound wave propagation model in shallow water environments.

[0067] Assuming that the underwater acoustic channel model considers the application scenario as shallow sea, the transmission loss of the underwater acoustic signal can be expressed as:

[0068] A(r,f)=A0r κ [a(f)] κ (1)

[0069] Where r is the transmission range in km, f is the signal frequency in kHz, A0 is the normalization coefficient, κ is the spreading factor, and a(f) is the absorption coefficient.

[0070] Writing equation (1) in logarithmic form can be expressed as:

[0071] TL=κ*10logr+r*10loga(f)

[0072] The value of κ depends on the type of wave propagation. In this embodiment, κ=1.5. In the low frequency range (100-3kHz), the absorption coefficient can be calculated by the Thorp formula:

[0073]

[0074] Wherein, 10loga(f) represents the absorption coefficient in logarithmic form, and the unit is dB / km.

[0075] Sonar technology is based on the propagation characteristics of sound waves in underwater environments, and its effectiveness is closely related to the accurate measurement of the speed of sound. The speed of sound is affected by environmental parameters such as seawater temperature, pressure (related to depth) and salinity, and can be expressed by the following formula:

[0076] c=1448.96+4.591T-0.05304T 2 +0.002374T 3

[0077] +1.340(S-35)+0.0163D+1.675×10 -7 D 2

[0078] -0.01025T(S-35)-7.139×10 -13 D 3

[0079] Where c represents the speed of sound in seawater, T represents temperature, S represents salinity, and D represents depth.

[0080] (2) Communication protocol description

[0081] First, the network initialization process begins. During this process, the sink node on the sea surface starts the clustering process by broadcasting hello messages to the nodes within the communication range. The nodes that receive the sink node information then broadcast hello messages carrying the forwarding node identity (ID) and remaining energy until the message reaches all reachable sensor nodes. The node that receives the hello message replies to the sending node by sending an ACK message, indicating that the information has been received. The ACK message includes the receiving node identity (ID), remaining energy, and the distance between the receiving node and the sending node. During the initialization process, each node maintains its neighbor node information table to share and update information regularly.

[0082] In this routing protocol, underwater sensor nodes use K-Means clustering technology to divide each node into its own cluster. K-Means clustering algorithm is a distance-based unsupervised learning algorithm. Its core idea is to divide data into K clusters in an iterative manner so that the data points within each cluster are as close to its cluster center as possible, while the data points between different clusters are as far away as possible. K-means algorithm has an iterative process in which data is grouped into several predefined non-overlapping clusters or subgroups so that the internal points of the clusters are as similar as possible, while trying to keep the clusters in different spaces. It assigns data points to clusters so that the sum of the squared distances between the cluster centroid and the data points is minimized. At this position, the centroid of the cluster is the arithmetic mean of the data points in the cluster.

[0083] The underwater routing protocol proposed in this embodiment is mainly aimed at improving the cluster establishment phase, which includes the cluster formation and cluster head selection phases and the cluster head selection phases of subsequent rounds.

[0084] a) Cluster formation stage

[0085] The steps to establish a cluster are as follows:

[0086] 1) Generate a sensor network consisting of n nodes;

[0087] 2) Randomly select k samples as the initial cluster centers;

[0088] 3) Calculate the distance between each sample point and k cluster centers, assign the sample point to the nearest cluster center, and generate k clusters;

[0089] 4) For each cluster, calculate the average value of all sample points assigned to the cluster as the centroid, and update the cluster center based on the obtained centroid;

[0090] 5) Repeat steps 3) and 4) until the position of the centroid no longer changes. At this time, the iteration ends and clustering is completed.

[0091] In order to determine the number of clusters k, this paper uses the silhouette coefficient method. The silhouette coefficient method measures the quality of the clustering results, that is, how appropriate each point is to be placed in the current cluster. A high silhouette coefficient means that the clustering result is very good. The formula used by the average silhouette coefficient method is as follows:

[0092]

[0093] In the formula, S is the silhouette coefficient, and a refers to the sample point X i The average distance from other samples in the same cluster is called cohesion. b refers to the sample point X i The average distance to all samples in the nearest cluster is called separation. j represents the nearest cluster, p is a cluster C k of sample points.

[0094] After finding the silhouette coefficient S of all samples, we can get the average silhouette coefficient by averaging them:

[0095]

[0096] Therefore, the k that maximizes the average silhouette coefficient S is the optimal number of clusters.

[0097] b) Cluster head node selection stage

[0098] After a cluster is successfully formed, the energy of the cluster head node decreases much faster than other nodes. Therefore, in subsequent rounds, the most qualified node needs to be selected as the cluster head node. The process of selecting the optimal cluster head node mainly involves evaluating the quality of the candidate nodes. The cluster head node selection strategy mainly considers the following factors:

[0099] 1) Position within the cluster: The nodes in the sensor network are unevenly distributed. Therefore, this embodiment gives priority to deploying the cluster head in an area with high node density. By calculating the Euclidean distance between the candidate cluster head node and other nodes in the cluster, the candidate node with the smallest sum of distances is selected as the cluster head node, which can effectively reduce the energy loss during transmission. j The calculation formula is as follows:

[0100]

[0101] In the formula, CCH_d j represents the position of the jth candidate node in the cluster, p j is the position of the node in the corresponding cluster, CCHp j Represents the position of the jth candidate node.

[0102] 2) Residual Energy RE i :The high working intensity of the cluster head node causes it to consume much more energy than other nodes. If a node is repeatedly selected as the cluster head node, its energy will be exhausted and it will not be able to work. At the same time, a hole area will be formed in space. Therefore, the residual energy level of the node should also be considered when selecting the cluster head node. At the same time, in order to avoid the formation of a hole area, a residual energy threshold should be set. When the residual energy of the node is less than the residual energy threshold, the node cannot be selected as the cluster head node.

[0103] 3) Propagation delay t i : The smaller the delay of each node in the network, the higher the network throughput and the less energy consumed. Therefore, this embodiment tends to select nodes with small delays to ensure better network performance. The calculation formula for propagation delay is:

[0104]

[0105] In the formula, t i Represents the i-th node N in the network i Propagation delay with the sink node; d i Represents node N i The distance from the sink node; v is the speed of sound in water, in km / s.

[0106] The quality of the candidate node CCHQ i The calculation follows the following formula:

[0107] CCHQ i =γ[αRE i +(1-α)CCH_d j ]+(1-γ)t i

[0108] c) Data packet transmission phase

[0109] Since the energy consumption of node data packet transmission increases exponentially with the distance, when nodes that exceed the transmission distance threshold transmit data packets to the cluster head, a double-hop communication method is required to further reduce energy consumption.

[0110] Since the cluster head node consumes a lot of energy, in order to avoid the packet loss rate caused by energy exhaustion, this protocol repeats the above cluster head node selection steps after the original cluster head node receives a fixed threshold of data packets to select the cluster head node again.

[0111] In summary, the method of the present invention is equivalent to the prior art and includes at least the following advantages and beneficial effects:

[0112] 1) In the underwater acoustic communication application scenario, the network divides the nodes into clusters according to the K-Means algorithm, and uses the silhouette coefficient method to measure the quality of the clustering results to obtain effective and reliable clustering results. The clustering algorithm can effectively increase the survival time of the network.

[0113] 2) The present invention takes into account factors such as average Euclidean distance, residual energy, and delay size when selecting the cluster head, making the cluster head selection more reasonable and avoiding the loss of data packets due to high energy consumption and insufficient residual energy of the cluster head. The node with the smallest sum of average distances to other non-cluster head nodes is selected as the cluster head to minimize energy consumption.

[0114] 3) Since the energy consumption of node data packet transmission increases exponentially with the distance, a double-hop method is required when nodes that exceed the transmission distance threshold transmit data packets to the cluster head, which effectively reduces energy consumption.

[0115] This embodiment also provides a system for realizing energy consumption balance of underwater sensor network nodes, including a sink node and underwater sensor nodes, wherein the system adopts Figure 1 The method shown selects and updates the cluster head node from the underwater sensor nodes.

[0116] 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.

[0117] 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.

[0118] 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.

[0119] 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 realizing energy consumption balance of underwater sensor network nodes, characterized in that: The underwater sensor network includes a sink node and underwater sensor nodes, and the underwater sensor nodes include cluster head nodes and non-cluster head nodes; the method for implementing node energy consumption balancing includes the following steps: Clustering algorithm is used to divide underwater sensor nodes into multiple clusters; According to the preset factors, one underwater sensor node is selected in each cluster as the cluster head node of the cluster, and the other underwater sensor nodes of the cluster are selected as non-cluster head nodes; Detect and determine whether the working energy consumption of the cluster head node in each cluster reaches a preset threshold, and if so, update the cluster head node of the cluster according to the preset factors; Among them, the preset factors include the location within the cluster, the residual energy and the propagation delay.

2. A method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The clustering algorithm is used to divide the underwater sensor nodes into multiple clusters, including: A1. Determine the number of clusters k and randomly obtain k underwater sensor nodes in the underwater sensor network as the initial cluster centers; A2. Calculate the distance between each underwater sensor node and k cluster centers, assign the underwater sensor node to the nearest cluster center, and generate k clusters; A3. For each cluster, calculate the average value of all underwater sensor nodes assigned to the cluster as the centroid; A4. Update the cluster center according to the centroid and return to execute steps A2-A3 until the position of the centroid no longer changes, and obtain the final k clusters.

3. A method for realizing energy consumption balance of underwater sensor network nodes according to claim 2, characterized in that: The determining of the number of clusters k comprises: The silhouette coefficient method is used to determine the number of clusters k.

4. The method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The position within the cluster is determined as follows: Calculate the Euclidean distance between the candidate cluster head node and other nodes in the cluster, and select the candidate node with the smallest sum of distances as the cluster head node; where the Euclidean distance CCH_d j The calculation formula is as follows: In the formula, CCH_d j represents the position of the jth candidate node in the cluster, p j is the position of the node in the corresponding cluster, CCHp j Represents the position of the jth candidate node.

5. The method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The residual energy RE i is determined as follows: When selecting the cluster head node, the node's residual energy level must be considered and a residual energy threshold is set. When the node's residual energy is less than the residual energy threshold, the node cannot be selected as the cluster head node.

6. The method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The propagation delay t i is determined as follows: Select the node with the smallest propagation delay as the cluster head node, where the propagation delay calculation formula is: Where, t i Represents the i-th node N in the network i Propagation delay with the sink node; d i Represents node N i The distance from the converging node; v is the speed of sound in water.

7. A method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The step of selecting an underwater sensor node in each cluster as a cluster head node of the cluster according to preset factors includes: Calculate the quality CCHQ of the candidate node based on the preset factors i : CCHQ i =γ[αRE i +(1-α)CCH_d j ]+(1-γ)t i In the formula, constants α and γ are weights; Calculate the quality of each candidate node and select the node with the highest quality as the cluster head node.

8. The method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The method for realizing energy consumption balance of underwater sensor network nodes also includes the following steps: In the data packet transmission stage, if the transmission distance between the cluster head node and the non-cluster head node exceeds the preset distance threshold, a double-hop communication method is used to transmit the data packet.

9. The method for realizing energy consumption balance of underwater sensor network nodes according to claim 1, characterized in that: The method for realizing energy consumption balance of underwater sensor network nodes also includes the step of network initialization: The aggregation node broadcasts hello information to nodes within the communication range; The node that receives the hello message from the sink node then broadcasts the hello message carrying the forwarding node identity and remaining energy until the hello message reaches all reachable underwater sensor nodes; The node that receives the hello message feeds back an ACK message to indicate that the message has been received; the ACK message includes the identity of the receiving node, the remaining energy, and the distance between the receiving node and the sending node; During the initialization process, each node maintains its neighbor node information table to share and update information regularly.

10. A system for realizing energy consumption balance of underwater sensor network nodes, characterized in that: The method comprises a sink node and underwater sensor nodes, wherein a cluster head node is selected and updated from the underwater sensor nodes by using the method as described in any one of claims 1 to 9.

Citation Information

Patent Citations

  • Mine environment wireless sensor network clustering routing protocol based on K-means (CRPK-means)

    CN108521633A

  • Sensor network multi-target routing method suitable for electric power monitoring environment

    CN111148160A

  • Method for designing opportunistic routing protocol of underwater acoustic sensor network

    CN118474014A

  • WSN clustering routing method based on optimization with salp swarm algorithm

    US20220256431A1

  • Method for selecting cluster head in distributed network, node, and system

    WO2018098759A1

Cited By

  • Underwater acoustic sensor network clustering method, system, equipment and medium

    CN121865364A

  • A method, system, device and medium for clustering in underwater acoustic sensor networks

    CN121865364B

  • Dynamic self-adaptive clustering method, device, equipment, medium and product for underwater acoustic sensor network

    CN122028139A