Node Redeployment Algorithm Based on Stratified Connected Tree for Underwater Sensor Networks

During the underwater sensor networks (UWSNs) operation, node drift with water environment causes network topology changes. Periodic node location examination and adjustment are needed to maintain good network monitoring quality as long as possible. In this paper, a node redeployment algorithm based on stratified connected tree for UWSNs is proposed. At every network adjustment moment, self-examination and adjustment on node locations are performed firstly. If a node is outside the monitored space, it returns to the last location recorded in its memory along straight line. Later, the network topology is stratified into a connected tree that takes the sink node as the root node by broadcasting ready information level by level, which can improve the network connectivity rate. Finally, with synthetically considering network coverage and connectivity rates, and node movement distance, the sink node performs centralized optimization on locations of leaf nodes in the stratified connected tree. Simulation results show that the proposed redeployment algorithm can not only keep the number of nodes in the monitored space as much as possible and maintain good network coverage and connectivity rates during network operation, but also reduce node movement distance during node redeployment and prolong the network lifetime.


Introduction and Related Works
With rapid advances in technologies such as sensors, micro-electro-mechanical-systems (MEMS), wireless communication and embedded systems, wireless sensor networks (WSNs) have been widely used in applications like environment monitoring, military surveillance, industry or agriculture production, traffic control and heath care [1,2]. As application extension of conventional terrestrial WSNs, underwater sensor networks (UWSNs) are an kind of underwater monitoring system composed of nodes that are capable of information perception, data processing and communication, which also have such characteristics as using acoustic signal as communication medium, 3D network structure, limited and difficult-to-supplement node energy, node drift with water environment and relatively sparse node deployment density. Because of suitability for information acquisition in 3D underwater space, UWSNs have been widely used for seabed resources exploration, underwater pollution monitoring, and marine military [3][4][5]. Due to increasing attentions of many countries on marine resources, UWSNs have also become the research hotspot of current sensor network field. The UWSNs researches mainly involve node deployment [6][7][8], time synchronization [9,10], node localization [11,12], network route [13,14], energy balance and efficiency [15,16], etc. Among them, node deployment is not only closely related to network monitoring quality, but it is also the basis of other network protocol and algorithm designs [17].
(3) The sink node performs centralized optimization adjustment on the locations of leaf nodes in the stratified connected tree with synthetically considering the network coverage and connectivity rates, and node movement distance. This can not only maintain excellent network monitoring performances, but also reduce node movement distance during node redeployment, as well as prolong the network lifetime. Table 1 is used to give a better description of the differences between the related research works and NRBSCT algorithm. The rest of the paper is organized as follows. In Section 2, the models, definitions and preliminaries involved in the NRBSCT algorithm are formally introduced. In Section 3, we elaborate the UWSNs node redeployment problem and corresponding NRBSCT algorithm. The simulation evaluation is provided in Section 4 with our conclusion and future work in Section 5. Table 1. Differences between the related research works and NRBSCT algorithm.

3D Underwater Space Model
As is shown in Figure 1, the 3D underwater space is a large cube [33] divided into a number of small cubes whose side lengths are w. All the small cubes have selected their center points to represent themselves. The coordinates of cube p i is (a i, b i, c i ).
Sensors 2017, 17, 27 4 of 27 connectivity rates, and node movement distance. This can not only maintain excellent network monitoring performances, but also reduce node movement distance during node redeployment, as well as prolong the network lifetime. Table 1 is used to give a better description of the differences between the related research works and NRBSCT algorithm. The rest of the paper is organized as follows. In Section 2, the models, definitions and preliminaries involved in the NRBSCT algorithm are formally introduced. In Section 3, we elaborate the UWSNs node redeployment problem and corresponding NRBSCT algorithm. The simulation evaluation is provided in Section 4 with our conclusion and future work in Section 5. Table 1. Differences between the related research works and NRBSCT algorithm. [19,20] Static No [21,22,27] limited Additional [28] limited No [23,25,[29][30][31] Free No [26] Free Additional [32], NRBSCT Free Full

3D Underwater Space Model
As is shown in Figure 1, the 3D underwater space is a large cube [33] divided into a number of small cubes whose side lengths are w. All the small cubes have selected their center points to represent themselves. The coordinates of cube pi is (ai,bi,ci).

Node Energy Consumption Model
Considering that the energy consumption of nodes for sensing, processing, and receiving information is much smaller than for transmitting information and moving [34], only the latter is considered. The energy consumption for transmitting information is modeled based on the method mentioned in reference [35]. According to the related content in reference [35], the specific method to calculate the energy consumption for transmitting information can be elaborated as follows. Supposing that d denotes the geometrical transmitting distance of the information package, which includes the necessary information used in the network redeployment process, such as the ID number, location and left energy of the node, and the size of the information package is denoted as Mb. Tp denotes the transmitting time of the information package and Sv is the transmission speed of the information package. On the one hand, we can calculate the transmitting time of the information package by the following formula:

Node Energy Consumption Model
Considering that the energy consumption of nodes for sensing, processing, and receiving information is much smaller than for transmitting information and moving [34], only the latter is considered. The energy consumption for transmitting information is modeled based on the method mentioned in reference [35]. According to the related content in reference [35], the specific method to calculate the energy consumption for transmitting information can be elaborated as follows. Supposing that d denotes the geometrical transmitting distance of the information package, which includes the necessary information used in the network redeployment process, such as the ID number, location and left energy of the node, and the size of the information package is denoted as M b . T p denotes Sensors 2017, 17, 27 5 of 27 the transmitting time of the information package and S v is the transmission speed of the information package. On the one hand, we can calculate the transmitting time of the information package by the following formula: On the other hand, the relationship between the frequency f (KHZ) of the carrier acoustic signal and the water absorption coefficient α(f ) (dB/m) is calculated by the following formula: When the transmitting distance of the information package is d, the energy attenuation is denoted as A(d) and can be calculated by the following formula: where λ is the energy spreading factor (λ is 1 for cylindrical, 1.5 for practical, and 2 for spherical spreading). Therefore, the energy consumption for transmitting information can be denoted as E tx (d) and calculated by the following formula: where P r denotes the power threshold for a node to receive the information package. Moreover, supposing that the number of information package transmitting times for node s in the network redeployment process is t n , and the communication range for node s is R t , the communication energy consumption C e can be obtained by the following formula: The movement energy consumption M e can be defined as the product of the movement distance m d and the energy consumption per movement distance m u , which can be also described as follows:

Node Sensing Model
The Boolean sensing model in reference [32] is adopted to describe node sensing. The function f (p i ,s j ) denotes whether cube point p i can be covered by node s j : where (x j ,y j ,z j ) is the coordinate of node s j ; (a i ,b i ,c i ) is the coordinate of cube point p i , and R s is the sensing range of node s j . If the value of f (p i ,s j ) is 1, cube point p i is covered by node s j . Otherwise, cube point p i is not covered by node s j . Based on function f (p i ,s j ), coverage degree k(p i ) of cube point p i can be defined as: where n denotes the total number of nodes in the network. Based on coverage degree k(p i ), the function f 0 (p i ) describes whether cube point p i is covered or not: If the value of f 0 (p i ) is 1, cube point p i is not covered by any node.

3D Random Drift Model
The 3D random drift model mentioned in reference [32] is used to describe the node drift with water environment. The functions rd(a,b) and rdi(a,b) are used to produce the random real number and integer between a and b. These two functions play important role in simulating the random node drift with water environment, and a and b can be regarded as the parameters of these two functions. Whether a node drifts is expressed as follows: where P e is used to control the probability of node drift, and the higher P e means the larger node drift probability. If Equation (10) holds, the node drift model can be described as: To explain the above model, the node drift in the x direction is taken as an example. λ 1 and m x are the coefficients to determine the maximum drift distance along the x direction, and P dx is the coefficient to determine the drift probability along the x positive direction. The higher P dx means the larger node drift probability along the x positive direction. rd(0,1) < P dx is a Boolean expression whose value is 1 when it holds and 0 otherwise. The meanings of the similar coefficients in the y or z directions are like those in the x direction, and we omit the corresponding description about them for simplicity.

Network Coverage Rate
The network coverage rate C v can be defined as the ratio of P c and P t , where P c is the number of the cube points covered and P t is the total number of all the cube points. Therefore, C v can be calculated as follows:

Network Connectivity Rate
The network connectivity rate C n can be defined as the ratio of n c and n, where n c is the number of nodes that can communicate with the sink node through single-hop or multi-hop communication. C n can be calculated as follows: If the network connectivity rate is 1, the network achieves full network connectivity, and all the nodes can communicate with the sink node through single-hop or multi-hop communication.

Network Adjustment Moment
The network operation time is expressed as t whose unit is denoted as round. If t = 0 and is an integral multiple of the network adjustment cycle T r , this network operation time is also called the network adjust moment T ad , when the locations of nodes should be examined and adjusted to maintain or improve network monitoring quality.

Energy Threshold
The energy of node s i is denoted as E i , and two kinds of energy threshold are defined in this paper. One is E d = E tx (R t ) that is used to determine whether node s i is died. If E i is smaller than E d , we consider that node s i has almost depleted its energy and is hard to participate into the network monitoring, and we think that node s i is died. The other is E y = E tx (R t ) × T r (T r is the network adjustment cycle) that judges whether a leaf node is strong. If the leaf node s i is a leaf node and its energy E i is smaller than E y , it is not strong enough and should be neglected during centralized optimization conducted by the sink node.

Network Lifetime
The network lifetime is denoted as L f , which is one of the important criteria to evaluate the algorithm energy efficiency [36,37]. In this paper, the network lifetime is defined as the operating rounds where the network coverage rate C v satisfies the condition (i.e., C th ≤ C v ≤ 1), and C th is the coverage rate threshold. If the network coverage rate is smaller than C th , the network has difficulty in monitoring the underwater space, and the network lifetime is over.

Preliminaries
(1) Inspired by the related assumptions or descriptions in references [18,22], the sink node and all the other nodes can freely move in all directions with the help of related technologies such as AUVs [38] and their real-time locations can be known during network operation with the help of related localization technologies [39]. (2) Before the deployment, the destination location information of the sink node, i.e., the location information of the water surface center, has been stored in the memories of all the other nodes for them to gain information on the destination location of the sink node. Information on the 3D underwater space model and the number of nodes has also been stored in the memory of the sink node. (3) The communication range of the sink node is R t and the sink node can be recharged, whereas the sensing capability of the sink node is neglected. All the other nodes are homogeneous, meaning these nodes have the same sensing range R s , same communication range R t , and initial energy E in . Furthermore, each of them has a unique I d number.

Problem Description
During the UWSNs network operation, as the 3D random drift model shows, node drift with water environment results in the network topology changes. Periodic examination and adjustment on node locations and node redeployment are needed to make the network maintain good monitoring performances as long as possible. There are few node redeployment algorithms considering node drift with water environment for UWSNs. Moreover, existing algorithms are difficult to improve the network coverage rate C v and connectivity rate C n at the cost of the probably least network energy consumption. For instance, as one of the typical node redeployment algorithms for UWSNs, the MRNR algorithm proposed that at every network adjustment moment T ad , the sink node repeatedly required the least important node, which made the smallest contribution to the network coverage rate, to move to the biggest coverage blind point through centralized optimization, aiming at achieving large network coverage rate improvement. However, this algorithm could not keep nodes in the monitored space effectively and did not consider how to improve the network connectivity rate. Moreover, it did not optimize the movement distance m d of the least important node during redeployment. Due to limited node energy and huge movement energy consumption M e in underwater environment, nodes die quickly upon running out of their energy (i.e., the left energy is smaller than E d ), which shortens the network lifetime L f . Therefore, this paper proposes the NRBSCT algorithm. At every network adjustment moment, self-examination and adjustment on node locations are performed firstly. If a node finds it is outside the monitored space, it returns to the last location recorded in its memory along the straight line to maintain network monitoring quality. Later, the network is stratified into a connected tree that takes the sink node as the root node by broadcasting ready information level by level, which can improve the network connectivity rate during network operation. Finally, by synthetically considering the network coverage and connectivity rates, together with node movement distance, the sink node performs a centralized optimization on locations of leaf nodes in the stratified connected tree.

Description of Initial Network Distribution
In this paper, two different initial network distributions are discussed. One initial network distribution is dented as D1 and the other is denoted as D2. The corresponding descriptions about them are given in the following respectively.
Description about initial network distribution D1: As shown in Figure 2, the sink node is fixed at the center of the water surface. All the other sensing nodes are randomly scattered on the surface of the monitored 3D underwater space firstly, then randomly adjust their own depths. Therefore, this initial network distribution is exactly the random distribution and all the sensing nodes have random locations. algorithm could not keep nodes in the monitored space effectively and did not consider how to improve the network connectivity rate. Moreover, it did not optimize the movement distance md of the least important node during redeployment. Due to limited node energy and huge movement energy consumption Me in underwater environment, nodes die quickly upon running out of their energy (i.e., the left energy is smaller than Ed), which shortens the network lifetime Lf. Therefore, this paper proposes the NRBSCT algorithm. At every network adjustment moment, self-examination and adjustment on node locations are performed firstly. If a node finds it is outside the monitored space, it returns to the last location recorded in its memory along the straight line to maintain network monitoring quality. Later, the network is stratified into a connected tree that takes the sink node as the root node by broadcasting ready information level by level, which can improve the network connectivity rate during network operation. Finally, by synthetically considering the network coverage and connectivity rates, together with node movement distance, the sink node performs a centralized optimization on locations of leaf nodes in the stratified connected tree.

Description of Initial Network Distribution
In this paper, two different initial network distributions are discussed. One initial network distribution is dented as D1 and the other is denoted as D2. The corresponding descriptions about them are given in the following respectively.
Description about initial network distribution D1: As shown in Figure 2, the sink node is fixed at the center of the water surface. All the other sensing nodes are randomly scattered on the surface of the monitored 3D underwater space firstly, then randomly adjust their own depths. Therefore, this initial network distribution is exactly the random distribution and all the sensing nodes have random locations. Description about initial network distribution D2: As shown in Figure 3, the sink node is fixed at the center of the water surface. As to other sensing nodes, taking node sj(xj,yj,zj) for example and supposing that the coordinate of the sink node (i.e., the center of the water surface) is (xsink,ysink,0), the coordinate of node sj in the x direction follows the normal distribution whose mean is xsink and standard deviation is half of the x direction length of the monitored 3D underwater space. Similarly, the coordinate of node sj in the y direction follows the normal distribution whose mean is ysink and standard deviation is half of the y direction length of the monitored 3D underwater space. The depth of node sj (i.e., zj) can be calculated as follows: Description about initial network distribution D2: As shown in Figure 3, the sink node is fixed at the center of the water surface. As to other sensing nodes, taking node s j (x j ,y j ,z j ) for example and supposing that the coordinate of the sink node (i.e., the center of the water surface) is (x sink , ysink ,0), the coordinate of node s j in the x direction follows the normal distribution whose mean is x sink and standard deviation is half of the x direction length of the monitored 3D underwater space. Similarly, the coordinate of node s j in the y direction follows the normal distribution whose mean is y sink and Sensors 2017, 17, 27 9 of 27 standard deviation is half of the y direction length of the monitored 3D underwater space. The depth of node s j (i.e., z j ) can be calculated as follows: where z h means the depth of the monitored 3D underwater space. If the network follows the above distribution, the node distribution in the shallow area of the monitored 3D underwater space is denser than that in the deep area. Since the nodes closer to the sink node are usually burdened with heavier information packet forwarding task, this kind of distribution owns the effectiveness in balancing the network energy consumption.
where zh means the depth of the monitored 3D underwater space. If the network follows the above distribution, the node distribution in the shallow area of the monitored 3D underwater space is denser than that in the deep area. Since the nodes closer to the sink node are usually burdened with heavier information packet forwarding task, this kind of distribution owns the effectiveness in balancing the network energy consumption.

Algorithm Steps
Step 1: The network operation time t is initialized to be 0 round. The network adjustment cycle Tr and node drift cycle Tm are initialized to be two different non-zero constants, and the value of Tr should be larger than that of Tm.
Step 2: t = t + 1 round. Each node senses its own environment and transmits the sensing information to the sink node through single-hop or multi-hop communication. The relay node can compress the received sensing information from other nodes and its own sensing information into one information packet. Judge whether the value of Rem(t,Tr) which means the remainder of dividing t by Tr is 0 or not. If it is, the network operation time reaches the adjustment moment, and the algorithm turns to Step 3 for network topology adjustment; otherwise, the algorithm turns to Step 6.
Step 3: All nodes examine whether they are in the monitored space or not. If all of them are in the monitored space, the algorithm turns to Step 4 (when t = 0, all the nodes are in the monitored space); otherwise, the node outside the monitored space should return to the location recorded in its memory at the last network adjustment moment along the straight line.
Step 4: The sink node set its state at the ready state and all the other nodes set their states at the non-ready states. If node si has not received any ready information Mr, it moves to the sink node along the straight line. During the movement, it opens its data receiving module to catch the ready information Mr and stops moving upon the reception of Mr. At the same time, the network is stratified level by level from the sink node. The corresponding description is shown in Figure 4. The process and result are shown in Figure 5 (a network comprised of 9 nodes is taken as the example). After finishing the network stratification, the whole network topology is changed into a stratified connected tree that takes the sink node as the root node, which helps to achieve full network connectivity. In the stratified connected tree, if node si has received any acknowledging information

Algorithm Steps
Step 1: The network operation time t is initialized to be 0 round. The network adjustment cycle T r and node drift cycle T m are initialized to be two different non-zero constants, and the value of T r should be larger than that of T m .
Step 2: t = t + 1 round. Each node senses its own environment and transmits the sensing information to the sink node through single-hop or multi-hop communication. The relay node can compress the received sensing information from other nodes and its own sensing information into one information packet. Judge whether the value of Rem(t,T r ) which means the remainder of dividing t by T r is 0 or not. If it is, the network operation time reaches the adjustment moment, and the algorithm turns to Step 3 for network topology adjustment; otherwise, the algorithm turns to Step 6.
Step 3: All nodes examine whether they are in the monitored space or not. If all of them are in the monitored space, the algorithm turns to Step 4 (when t = 0, all the nodes are in the monitored space); otherwise, the node outside the monitored space should return to the location recorded in its memory at the last network adjustment moment along the straight line.
Step 4: The sink node set its state at the ready state and all the other nodes set their states at the non-ready states. If node s i has not received any ready information M r , it moves to the sink node along the straight line. During the movement, it opens its data receiving module to catch the ready information M r and stops moving upon the reception of M r . At the same time, the network is stratified level by level from the sink node. The corresponding description is shown in Figure 4. The process and result are shown in Figure 5 (a network comprised of 9 nodes is taken as the example). After finishing the network stratification, the whole network topology is changed into a stratified connected tree that takes the sink node as the root node, which helps to achieve full network connectivity. In the stratified connected tree, if node s i has received any acknowledging information M a , it has one or more child nodes and is considered as a backbone node; otherwise, node s i has no child node and is considered as a leaf node.
Sensors 2017, 17, 27 10 of 27 Ma, it has one or more child nodes and is considered as a backbone node; otherwise, node si has no child node and is considered as a leaf node.  Step 5: After Step 4, the network achieves full network connectivity and the sink node can perform centralized adjustment. First, the sink node determines the set C1 comprising cube points in the 3D underwater space model, which are less than Rt away (this is helpful to guarantee full network connectivity after centralized optimization) from the backbone nodes in the network. Next, it determines the set Cy comprising the strong leaf nodes in the network. Then, new locations of leaf nodes in Cy are calculated one by one according to the descending order of their residual energy. Taking leaf node si for example, pi and oi are used to denote its probably new location and old  Ma, it has one or more child nodes and is considered as a backbone node; otherwise, node si has no child node and is considered as a leaf node.  Step 5: After Step 4, the network achieves full network connectivity and the sink node can perform centralized adjustment. First, the sink node determines the set C1 comprising cube points in the 3D underwater space model, which are less than Rt away (this is helpful to guarantee full network connectivity after centralized optimization) from the backbone nodes in the network. Next, it determines the set Cy comprising the strong leaf nodes in the network. Then, new locations of leaf nodes in Cy are calculated one by one according to the descending order of their residual energy. Taking leaf node si for example, pi and oi are used to denote its probably new location and old Step 5: After Step 4, the network achieves full network connectivity and the sink node can perform centralized adjustment. First, the sink node determines the set C 1 comprising cube points in the 3D underwater space model, which are less than R t away (this is helpful to guarantee full network connectivity after centralized optimization) from the backbone nodes in the network. Next, it determines the set C y comprising the strong leaf nodes in the network. Then, new locations of leaf nodes in C y are calculated one by one according to the descending order of their residual energy. Taking leaf node s i for example, p i and o i are used to denote its probably new location and old location respectively. First, the sink node calculates its furthest movement distance d m (i) according to Equation (15): where d 1 ensures that s i is still a strong leaf node after reaching the probably new location and d 2 ensures that s i will not consume excessive energy during the movement (r g is the control coefficient). Both of them limit the movement energy consumption of the leaf node from different perspectives (d 1 is from the left energy perspective and d 2 is from the consumed energy perspective), therefore, the node movement distance is reduced. Second, the sink node determines set C 2 comprising cube points in the sphere Q i , whose center is the old location (i.e., o i ) of node s i and radius is d m (i). The set C d = C 1 ∩C 2 is calculated. Next, the sink node considers cube points in C d one by one. Taking cube point p i for example, the network coverage rate is C v (o i ) when node s i is at its old location o i , and would be C v (p i ) if node s i moved to its probably new location p i . The distance between o i and p i is denoted as d(o i ,p i ). The target cube point p d (s i ) (i.e., final destination location of node s i ) is calculated according to Equation (16). The sink node returns the result information to node s i , and node s i moves to p d (s i ) along the straight line. Then, the sink node considers the next strong leaf node until all the strong leaf nodes have been studied. After this, all the nodes record the real-time locations into their own memories.
Step 6: The fact that whether Rem(t,T m ) (remainder of dividing t by T m ) is 0 or not determines whether the node drift with water environment occurs in the current network operation time. If the value of Rem(t,T m ) is 0, all the nodes drift according to the 3D random drift model; otherwise, the algorithm turns to Step 7.
Step 7: The sink node calculates the network coverage rate and judges whether the network reaches the network lifetime or not. If it is, the algorithm ends; otherwise, the algorithm turns to Step 2.

Detailed Description for Algorithm Important Parts
To give a better understanding about the proposed algorithm, the following important parts of the NRBSCT algorithm will be elaborated in detail and with examples. Supposing that the scenery is the same with that described in the following simulation setup, and the network adjustment cycle T r and node drift cycle T m are initialized to be 50 rounds and 5 rounds respectively. The network operation time just comes to 50 rounds, i.e., the first adjustment moment. At this time, the algorithm will turn to Step 3 which is mentioned in the previous part for network topology adjustment. We will take the scenery at this time as an example to describe for simplicity.

Self-Examination and Adjustment of Nodes Outside the Monitored Space
Since the network operation time is just 50 rounds, actually all the nodes have drifted according to the 3D random drift model 9 times, which occurred at Rounds 5,10,15,20,25,30,35,40, and 45. It is possible that some nodes may drift outside the monitored space. Taking node s e as the example, as is shown in Table 2, it gradually drifted outside the monitored space, so it returns to the location recorded in its memory at the last network adjustment moment. Since the network operation time is just the first adjustment moment, the last network adjustment moment means the operation starting time (i.e., when t = 0). Therefore, node s i will move from (125, 43, 21) to (115, 37,16), which makes itself come back into the monitored space to help maintain good network monitoring quality. Step 3, all the nodes have been into the monitored space. However, because of the initial random deployment and previous drift caused by the water environment, some nodes fail to communicate with the sink node through single-hop or multi-hop communication, which means that the network cannot still achieve full network connectivity. Therefore, measures should be taken to improve the network connectivity, and it is better to achieve full network connectivity if possible. Taking the scenery shown in Figure 5 as an example, 9 nodes in the network finally form a stratified connected tree whose root node is the sink node with the method described in Figure 4 in Step 4. This is one aspect of improve the network connectivity rate for the NRBSCT algorithm. As to the other aspect, in the centralized adjustment performed by the sink node in Step 5, the target cube point p d (s i ) (i.e., final destination location of strong leaf node s i ) belong to the set C d = C 1 ∩C 2 , which means it also belongs to the set C 1 and is less than R t away from the backbone nodes in the network, which is helpful to guarantee full network connectivity after centralized optimization. The scenery shown in Figure 5 can also be the example. Figure 5 shows that after the network stratification, nodes s 2 , s 3 , s 8 and s 9 are the leaf nodes. Supposing that their left energy are distributed as Table 3 shows (the simulation value at the 50 round time is much bigger than the supposition value in Table 3), since the energy threshold E y = E tx (R t ) × T r is 65 J in the currently supposed simulation scenery, nodes s 2 and s 8 can be treated as the strong leaf nodes. Therefore, based on Equations (15) and (16), the sink node firstly determine the final destination location for node s 2 , and then for node s 8 . During the calculation of the final destination location for the strong leaf node, it is necessary to consider how to limit the node movement distance, since the movement energy consumption is huge and node energy is limited and difficult-to-supplement in the water environment. Therefore, in Equations (15) and (16), measures are taken to limit the node movement distance. Taking node s 8 as the example, in Equation (15), the calculation of d 1 (value is 8 m) limits the movement distance by ensuring that node s 8 is still strong after the current movement; while the calculation of d 2 (value is 10 m) limits the movement distance by ensuring that node s 8 will not consume excessive energy during the current movement. By using Equation (16), the node movement distance is also limited when requiring the node to move toward its final destination location to improve the network coverage rate. As is shown in Figure 6, point p 1 and p 2 belong to the set C d = C 1 ∩C 2 . If node s 8 chooses p 1 as its final destination location, it should move 6 m to gain 0.035 network coverage rate improvement; however, if node s 8 chooses p 2 as its final destination location, it should move 4 m to gain 0.025 network coverage rate improvement. Since moving toward p 2 can gain more network coverage rate improvement per movement distance, node s 8 will prefer to choose p 2 rather than p 1 . network coverage rate improvement. Since moving toward p2 can gain more network coverage rate improvement per movement distance, node s8 will prefer to choose p2 rather than p1.

Overall Summarization for Main Mathematical Symbols
Since there are a large number of mathematical symbols, to give a better description of these symbols, Table 4 includes main mathematical symbols used.

Algorithm Analysis
For the 3D underwater space model, whether a small cube is covered or not depends on the covering state of its center point. Therefore, for the NRBSCT algorithm, when the sink node performs centralized optimization to adjust the locations of leaf nodes, the cube resolution w affects the calculating accuracy and time complexity of centralized optimization. If w is small, the calculating accuracy and time complexity is high. For example, when the sink node calculates the final destination location for node si, it has to calculate Cv(oi) and Cv(pi), and the time complexities for these two calculations are the same, i.e., O(Pt × n). The smaller w means the larger Pt, and then results in the higher time complexity.

Algorithm Comparison and Evaluation Metrics
Though the MRNR algorithm seems to be a little old, it seems the only one that can be found to solve the node redeployment problem researched in this paper as far as we know after our deep and extensive literature study; thus, to evaluate the proposed NRBSCT algorithm reasonably, the MRNR algorithm is chosen for comparison. The performances of MRNR and NRBSCT algorithms are compared from the following metrics: the number of nodes in the monitored 3D underwater space, network coverage rate, network connectivity rate, and network lifetime.
Compared with the MRNR algorithm, the NRBSCT algorithm has some advantages, as follows: (1) The MRNR algorithm does not propose effective measures to prevent nodes from drifting out of the monitored space because of water environment. However, the NRBSCT algorithm can make nodes outside the monitored space return back through self-examination and adjustment on node locations, which is goodfor maintaining good network monitoring quality. (2) The MRNR algorithm only considers how to improve the network coverage rate, but ignores the network connectivity rate improvement. However, at the network adjustment moment, the NRBSCT algorithm can firstly establish a stratified connected tree that takes the sink node as the root node, and then ensure that in the centralized optimization conducted by the sink node, the final destination location of node si will not be Rt away from the backbone nodes, which

Overall Summarization for Main Mathematical Symbols
Since there are a large number of mathematical symbols, to give a better description of these symbols, Table 4 includes main mathematical symbols used.

Algorithm Analysis
For the 3D underwater space model, whether a small cube is covered or not depends on the covering state of its center point. Therefore, for the NRBSCT algorithm, when the sink node performs centralized optimization to adjust the locations of leaf nodes, the cube resolution w affects the calculating accuracy and time complexity of centralized optimization. If w is small, the calculating accuracy and time complexity is high. For example, when the sink node calculates the final destination location for node s i , it has to calculate C v (o i ) and C v (p i ), and the time complexities for these two calculations are the same, i.e., O(P t × n). The smaller w means the larger P t , and then results in the higher time complexity.

Algorithm Comparison and Evaluation Metrics
Though the MRNR algorithm seems to be a little old, it seems the only one that can be found to solve the node redeployment problem researched in this paper as far as we know after our deep and extensive literature study; thus, to evaluate the proposed NRBSCT algorithm reasonably, the MRNR algorithm is chosen for comparison. The performances of MRNR and NRBSCT algorithms are compared from the following metrics: the number of nodes in the monitored 3D underwater space, network coverage rate, network connectivity rate, and network lifetime.
Compared with the MRNR algorithm, the NRBSCT algorithm has some advantages, as follows: (1) The MRNR algorithm does not propose effective measures to prevent nodes from drifting out of the monitored space because of water environment. However, the NRBSCT algorithm can make nodes outside the monitored space return back through self-examination and adjustment on node locations, which is goodfor maintaining good network monitoring quality.
The MRNR algorithm only considers how to improve the network coverage rate, but ignores the network connectivity rate improvement. However, at the network adjustment moment, the NRBSCT algorithm can firstly establish a stratified connected tree that takes the sink node as the root node, and then ensure that in the centralized optimization conducted by the sink node, the final destination location of node s i will not be R t away from the backbone nodes, which achieves full network connectivity and also helps to maintain a relatively high network connectivity during network operation.
The MRNR algorithm does not consider how to shorten the movement distance when requiring the least important node to move toward the biggest coverage blind point to improve the network coverage rate. However, the centralized optimization conducted by the sink node in the NRBSCT algorithm considers limiting node movement distance from the left and consumed energy perspectives, which can shorten the total movement distance of nodes during redeployment and prolong the network lifetime.

Simulation Scenario and Parameter Settings
Matlab software is used to simulate the algorithms. The final results shown in the following figures are the averages of 50 times to eliminate the effect of simulation randomness. The length and width in the horizontal direction of simulative monitored 3D underwater space are the same, i.e., 120 m, whereas the depth of space is 60 m. The cube resolution w is 5 m. In the 3D random drift model, node maximum drift distances along the x, y and z directions are controlled by setting m x = m y = m z = 1 and λ 1 = 0.8. Node drift probability P e is set to be 0.3, and drift probabilities along the positive directions of x, y and z axes are controlled by setting P dx = P dy = P dz = 0.5. In the NRBSCT algorithm, the value of r g is 0.2. Other main parameter settings of the MRNR and NRBSCT algorithms are enumerated in Table 5.  Figure 7 shows the comparison of the relationship between the number of nodes outside the monitored space and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30.

Simulation Results and Analysis
As shown in Figure 7a,b, node may drift with water environment during network operation. For the MRNR algorithm, more and more nodes drift outside the monitored space during network operation; however, for the NRBSCT algorithm, the number of nodes outside the monitored space does not increase too much, moreover, the NRBSCT algorithm can almost keep all the nodes in the monitored space when the network operation time (not exceeding the network lifetime) is just the network adjustment moment. The reason is that the MRNR algorithm does not propose any methods to prevent nodes from drifting outside the monitored space because of water environment; however, the NRBSCT algorithm can drive nodes outside the monitored space to move back into the monitored space through self-examination and adjustment on node locations, which is significant to help the network maintain better monitoring quality.
As shown in Figure 7c,d, for both the MRNR algorithm and the NRBSCT algorithm, compared with the initial network distribution D1, since there are more nodes distributed in the area around the sink node and less nodes distributed in the area near the boundary of the monitored water space for the initial network distribution D2, less nodes will move out of the monitored water space during the network operation. Figure 8 shows the comparison of the relationship between the network coverage rate and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30.
As shown in Figure 8a,b, for both of these algorithms, the network coverage rates will decrease during network operation from the whole. The reason is that some nodes drift out of the monitored space and some nodes die from energy depletion. However, when the network operation time is just the network adjustment moment, both of these two algorithms can contribute to the network coverage rate improvement to some extent since they propose the corresponding methods. Specifically, at the beginning of network operation (i.e., from the start to the 176 rounds for the initial network distribution D1 and to the 103 rounds for the initial network distribution D2), the MRNR algorithm can always achieve a higher network coverage rate than the NRBSCT algorithm; however, at the end of the network operation, the network coverage rate for the MRNR algorithm degrades dramatically with a relatively short network lifetime (i.e., 215 rounds for the initial network distribution D1 and 174 rounds for the initial network distribution D2), and that for the NRBSCT algorithm can remain a certain level for a longer network lifetime (i.e., 275 rounds for the initial network distribution D1 and 326 for the initial network distribution D2). The reason is that the MRNR algorithm only focuses on maximizing the network coverage rate, which results in a higher network coverage rate; however, compared with the MRNR algorithm, the proposed NRBSCT algorithm not only considers how to keep nodes from drifting out of the monitored space, but also tries to shorten node movement distance when the sink node conducts centralized optimization on leaf node locations, which can help to save movement energy consumption and keep the network coverage rate at a certain level for a longer network lifetime.  As shown in Figure 8a,b, for both of these algorithms, the network coverage rates will decrease during network operation from the whole. The reason is that some nodes drift out of the monitored space and some nodes die from energy depletion. However, when the network operation time is just the network adjustment moment, both of these two algorithms can contribute to the network coverage rate improvement to some extent since they propose the corresponding methods. Specifically, at the beginning of network operation (i.e., from the start to the 176 rounds for the initial network distribution D1 and to the 103 rounds for the initial network distribution D2), the MRNR algorithm can always achieve a higher network coverage rate than the NRBSCT algorithm; however, at the end of the network operation, the network coverage rate for the MRNR algorithm degrades dramatically with a relatively short network lifetime (i.e., 215 rounds for the initial network distribution D1 and 174 rounds for the initial network distribution D2), and that for the NRBSCT algorithm can remain a certain level for a longer network lifetime (i.e., 275 rounds for the initial network distribution D1 and 326 for the initial network distribution D2). The reason is that the MRNR algorithm only focuses on maximizing the network coverage rate, which results in a higher network coverage rate; however, compared with the MRNR algorithm, the proposed NRBSCT algorithm not only considers how to keep nodes from drifting out of the monitored space, but also tries to shorten node movement distance when the sink node conducts centralized optimization on leaf node locations, which can help to save movement energy consumption and keep the network coverage rate at a certain level for a longer network lifetime.
As shown in Figure 8c,d, for the NRBSCT algorithm, compared with the initial network distribution D1, since the nodes in the initial network distribution D2 tends to be located in the area near the sink node, which results more coverage overlaps, the network coverage at the beginning of network operation (i.e., from the start to the 78 rounds) is relatively lower. However, the initial network distribution D2 also results in less moving-out nodes during network operation and less movement distance during the network redeployment, which helps a lot to save the node movement energy consumption, so more nodes will save their energy to contribute to higher network coverage rates and the network lifetime can be prolonged from 275 rounds in the case of initial network distribution D1 to 326 rounds in the case of initial network distribution D2. However, that regularity cannot hold for the MRNR algorithm, since compared with the initial network distribution D1, the initial network distribution D2 is exactly less uniform, which not only means that there exists more coverage overlaps in the initial network operation, but also causes that more nodes will be involved in the network redeployment process, moving from the dense area close to the sink node to the sparse area far away from the sink node. Because of the relatively large movement energy consumption, too much movement distance will result in large movement energy consumption, which makes nodes die faster and degrades the network coverage rate. For the above reasons, the network coverage for the MRNR algorithm in the case of initial network distribution D2 cannot exceed that in the case of initial network distribution D1.  Figure 9 shows the comparison of the relationship between the network connectivity rate and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30.
As shown in Figure 9a,b, for the MRNR algorithm, the network connectivity rate will decrease during network operation from the beginning to the network lifetime. The reason is that on the one hand, some nodes drift out of the monitored space and some nodes die from energy depletion; on the other hand, the MRNR algorithm only focuses on maximizing the network coverage rate and ignores how to slow the network connectivity rate decrease. However, for the NRBSCT algorithm, the network connectivity exhibits some fluctuations during its decrease. The reason for this is actually the consideration of slowing the network connectivity rate decrease. Specifically speaking, if the network operation time is not the network adjustment moment Tad, the network connectivity exhibits the decrease because of the node drift caused by water environment and node death caused by energy depletion. While, if the network operation time is just the network adjustment moment Tad (such as 50 rounds, 100 rounds, 150 rounds), the NRBSCT algorithm can firstly establish a stratified connected tree that takes the sink node as the root node, and then ensure that in the centralized MRNR algorithm in the case of initial network distribution D2 cannot exceed that in the case of initial network distribution D1. Figure 9 shows the comparison of the relationship between the network connectivity rate and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30. optimization, the final destination location of node si will not be Rt away from the backbone nodes, which achieves full network connectivity and makes the value of the network connectivity bigger than that of the former or latter network operation time (i.e., the network connectivity exhibits the fluctuation phenomenon).
As shown in Figure 9c,d, for the NRBSCT algorithm, compared with the initial network distribution D1, the network connectivity rate in the case of the initial network distribution D2 is relatively higher, which may be the result of the fact that the majority of nodes in the initial network distribution D2 tend to be located in the area near the sink node. However, the same regularity can only hold for a short network operation time for the MRNR algorithm (i.e., 98 rounds), the reason is that at the network adjustment moments, in order to increase the network coverage rate, the MRNR algorithm requires nodes in the dense area near the sink node to move to the sparse area far away from the sink node, which will degrade the network connectivity.  Figure 10 shows the comparison of the relationship between the total movement distance of nodes in the network and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30.
As shown in Figure 10a,b, the total movement distance of nodes will increase during network operation from the whole for both algorithms. The reason is that, on the one hand, nodes may drift with water environment; on the other hand, both redeployment algorithms require some nodes to move toward better locations to improve network monitoring quality when the network operation time is just the network adjustment moment. Compared with the former, the latter will cause larger movement distance, which can be demonstrated with the higher curve slopes at the network adjustment moments. However, the total movement distance for the NRBSCT algorithm is smaller than that of the MRNR algorithm, the reason is that compared with the latter, the former considers how to decrease the node movement distance from the left and consumed energy perspectives when the sink node conducts centralized optimization on the locations of leaf nodes, which avoids the large-scale node movement that may occur in the latter. As shown in Figure 9a,b, for the MRNR algorithm, the network connectivity rate will decrease during network operation from the beginning to the network lifetime. The reason is that on the one hand, some nodes drift out of the monitored space and some nodes die from energy depletion; on the other hand, the MRNR algorithm only focuses on maximizing the network coverage rate and ignores how to slow the network connectivity rate decrease. However, for the NRBSCT algorithm, the network connectivity exhibits some fluctuations during its decrease. The reason for this is actually the consideration of slowing the network connectivity rate decrease. Specifically speaking, if the network operation time is not the network adjustment moment T ad , the network connectivity exhibits the decrease because of the node drift caused by water environment and node death caused by energy depletion. While, if the network operation time is just the network adjustment moment T ad (such as 50 rounds, 100 rounds, 150 rounds), the NRBSCT algorithm can firstly establish a stratified connected tree that takes the sink node as the root node, and then ensure that in the centralized optimization, the final destination location of node s i will not be R t away from the backbone nodes, which achieves full network connectivity and makes the value of the network connectivity bigger than that of the former or latter network operation time (i.e., the network connectivity exhibits the fluctuation phenomenon).
As shown in Figure 9c,d, for the NRBSCT algorithm, compared with the initial network distribution D1, the network connectivity rate in the case of the initial network distribution D2 is relatively higher, which may be the result of the fact that the majority of nodes in the initial network distribution D2 tend to be located in the area near the sink node. However, the same regularity can only hold for a short network operation time for the MRNR algorithm (i.e., 98 rounds), the reason is that at the network adjustment moments, in order to increase the network coverage rate, the MRNR algorithm requires nodes in the dense area near the sink node to move to the sparse area far away from the sink node, which will degrade the network connectivity. Figure 10 shows the comparison of the relationship between the total movement distance of nodes in the network and the round of network operation considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes is 30. As shown in Figure 10c,d, for the NRBSCT algorithm, compared with the initial network distribution D1, the total movement distance of nodes in the network in the case of the initial network distribution D2 is relatively smaller, and there are two main reasons accounting for this phenomenon. Firstly, the movement of nodes in the formation of the initial network distribution D2 is comparatively smaller than that of the initial network distribution D1, since the majority of all the nodes only need a relatively small depth adjustment. Secondly, in the case of the initial network distribution D2, based on the fact that the majority of all the nodes are located in the area near the sink node and the minority of all the nodes are located in the area far away from the sink node, both the number of node moving out of the monitored space and the node movement distance produced in process of the network redeployment at the network adjustment moments are relatively smaller. However, for the MRNR algorithm, the same regularity can only hold for a short network operation time (i.e., before the 50 rounds) owning to the first reason mentioned above. Once the network operation time comes to the network adjustment moment, large numbers of node in the dense area near the sink node will be required to move towards the sparse area far away from the sink node for the purpose of increasing the network coverage rate, which will obviously cause larger node movement distance increase than that in the case of the initial network distribution D1.  Figure 11 shows the comparison of the relationship between the network lifetime and the number of nodes considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes varies from 10 to 50.
As shown in Figure 11a,b, compared with the MRNR algorithm, when the network scale is the same (i.e., the number of nodes is the same), the NRBST can always achieve a higher network lifetime. The reason is that when the sink node conducts centralized optimization, the MRNR algorithm only considers maximizing the network coverage rate, with node movement distance ignored; while the NRBSCT algorithm considers how to not only improve the network coverage and connectivity rates, but also decrease node movement distance (this is also shown in Figure 10). Since node movement energy consumption in water environment is much larger than other kinds of energy consumption, the node movement distance decrease will produce a significant network lifetime improvement.
As shown in Figure 11c,d, compared with the initial network distribution D1, when the network scale is the same (i.e., the number of nodes is the same), the network lifetime in the case of the initial network distribution D2 is relatively longer for the NRBST algorithm and is relatively As shown in Figure 10a,b, the total movement distance of nodes will increase during network operation from the whole for both algorithms. The reason is that, on the one hand, nodes may drift with water environment; on the other hand, both redeployment algorithms require some nodes to move toward better locations to improve network monitoring quality when the network operation time is just the network adjustment moment. Compared with the former, the latter will cause larger movement distance, which can be demonstrated with the higher curve slopes at the network adjustment moments. However, the total movement distance for the NRBSCT algorithm is smaller than that of the MRNR algorithm, the reason is that compared with the latter, the former considers how to decrease the node movement distance from the left and consumed energy perspectives when the sink node conducts centralized optimization on the locations of leaf nodes, which avoids the large-scale node movement that may occur in the latter.
As shown in Figure 10c,d, for the NRBSCT algorithm, compared with the initial network distribution D1, the total movement distance of nodes in the network in the case of the initial network distribution D2 is relatively smaller, and there are two main reasons accounting for this phenomenon. Firstly, the movement of nodes in the formation of the initial network distribution D2 is comparatively smaller than that of the initial network distribution D1, since the majority of all the nodes only need a relatively small depth adjustment. Secondly, in the case of the initial network distribution D2, based on the fact that the majority of all the nodes are located in the area near the sink node and the minority of all the nodes are located in the area far away from the sink node, both the number of node moving out of the monitored space and the node movement distance produced in process of the network redeployment at the network adjustment moments are relatively smaller. However, for the MRNR algorithm, the same regularity can only hold for a short network operation time (i.e., before the 50 rounds) owning to the first reason mentioned above. Once the network operation time comes to the network adjustment moment, large numbers of node in the dense area near the sink node will be required to move towards the sparse area far away from the sink node for the purpose of increasing the network coverage rate, which will obviously cause larger node movement distance increase than that in the case of the initial network distribution D1. Figure 11 shows the comparison of the relationship between the network lifetime and the number of nodes considering both the initial network distribution (D1 or D2) and the network redeployment algorithm (MRNR or NRBSCT), where the number of nodes varies from 10 to 50.
As shown in Figure 11a,b, compared with the MRNR algorithm, when the network scale is the same (i.e., the number of nodes is the same), the NRBST can always achieve a higher network lifetime. The reason is that when the sink node conducts centralized optimization, the MRNR algorithm only considers maximizing the network coverage rate, with node movement distance ignored; while the NRBSCT algorithm considers how to not only improve the network coverage and connectivity rates, but also decrease node movement distance (this is also shown in Figure 10). Since node movement energy consumption in water environment is much larger than other kinds of energy consumption, the node movement distance decrease will produce a significant network lifetime improvement.
As shown in Figure 11c,d, compared with the initial network distribution D1, when the network scale is the same (i.e., the number of nodes is the same), the network lifetime in the case of the initial network distribution D2 is relatively longer for the NRBST algorithm and is relatively shorter for the MRNR algorithm. This phenomenon also results from the facts that node movement energy consumption accounts for large percent of the total energy consumption of a node. Furthermore, it is easy to understand this phenomenon considering the total node movement distance shown in Figure 10. shorter for the MRNR algorithm. This phenomenon also results from the facts that node movement energy consumption accounts for large percent of the total energy consumption of a node. Furthermore, it is easy to understand this phenomenon considering the total node movement distance shown in Figure 10.

Conclusions and Future Work
A NRBSCT algorithm is proposed because improving the network coverage and connectivity rates at the cost of the probably minimal node energy consumption to maintain excellent network monitoring quality as long as possible with full consideration of node drift with water environment is difficult for existing UWSNs node redeployment algorithms. At every network adjustment moment, nodes firstly perform the self-examination and adjustment on locations to keep themselves in the monitored space, which ensures that number of nodes in the monitored space can be as much as possible and that network monitoring quality can be as good as possible. Then, the network is stratified into a connected tree through broadcasting ready information level by level that takes the sink node as the root node, which helps to improve the network connectivity rate and even achieve full network connectivity. Last, the sink node conducts centralized optimization on locations of leaf nodes with synthetically considering the network coverage rate, network connectivity rate, and node movement distance, which is beneficial to lower the network connectivity decrease speed and improve the network lifetime. Since the centralized optimization mentioned above is actually a multi-objective optimal problem, which is hard to get the optimal solution since UWSNs are usually a large-scale, dynamical, and energy-limited system, how to get a near-optimal solution deserves our future research. Besides, since both the connected tree construction and centralized optimization performed by the sink node seem a little simple, how to find more sophisticated methods with better performances is obviously one of our future research directions. Although the models used in this paper are either similar with and improved from those used in the existing and compared MRNR algorithm (like the 3D random drift), or the supplements to the lacks of the necessary models (such as the models for communication energy consumption and movement energy consumption) in the existing and compared MRNR algorithm, they have the following limitations: (1) The 3D random drift model adopted to simulate the node drift caused by the water environment is relatively simple, considering the complex flow changes for realistic conditions. (2) In the description of the energy consumption calculation for transmitting information, the attenuation model of acoustic propagation is relatively rough considering the reasonable uncertainty bounds for realistic conditions. (3) The movement energy consumption calculation method is also relatively idealized considering the complex current effects for realistic conditions.

Conclusions and Future Work
A NRBSCT algorithm is proposed because improving the network coverage and connectivity rates at the cost of the probably minimal node energy consumption to maintain excellent network monitoring quality as long as possible with full consideration of node drift with water environment is difficult for existing UWSNs node redeployment algorithms. At every network adjustment moment, nodes firstly perform the self-examination and adjustment on locations to keep themselves in the monitored space, which ensures that number of nodes in the monitored space can be as much as possible and that network monitoring quality can be as good as possible. Then, the network is stratified into a connected tree through broadcasting ready information level by level that takes the sink node as the root node, which helps to improve the network connectivity rate and even achieve full network connectivity. Last, the sink node conducts centralized optimization on locations of leaf nodes with synthetically considering the network coverage rate, network connectivity rate, and node movement distance, which is beneficial to lower the network connectivity decrease speed and improve the network lifetime. Since the centralized optimization mentioned above is actually a multi-objective optimal problem, which is hard to get the optimal solution since UWSNs are usually a large-scale, dynamical, and energy-limited system, how to get a near-optimal solution deserves our future research. Besides, since both the connected tree construction and centralized optimization performed by the sink node seem a little simple, how to find more sophisticated methods with better performances is obviously one of our future research directions. Although the models used in this paper are either similar with and improved from those used in the existing and compared MRNR algorithm (like the 3D random drift), or the supplements to the lacks of the necessary models (such as the models for communication energy consumption and movement energy consumption) in the existing and compared MRNR algorithm, they have the following limitations: (1) The 3D random drift model adopted to simulate the node drift caused by the water environment is relatively simple, considering the complex flow changes for realistic conditions. (2) In the description of the energy consumption calculation for transmitting information, the attenuation model of acoustic propagation is relatively rough considering the reasonable uncertainty bounds for realistic conditions. (3) The movement energy consumption calculation method is also relatively idealized considering the complex current effects for realistic conditions. Therefore, it is necessary to establish more practical models in the future. Moreover, although the algorithm simulation is conducted on the software platform, as a research team which has been keeping much focus on WSNs, we have also successfully developed some practical underwater nodes and water environment monitoring systems, which demonstrate that putting the proposed algorithm into the real application is one of our key research directions. If necessary, interested readers can contact us to learn about or improve the developing process of the real UWSNs designed by our team.