# An Energy Efficient Routing Protocol Based on Layers and Unequal Clusters in Underwater Wireless Sensor Networks

Authors: Fang Zhu; Junfang Wei
Journal: Journal of Sensors
 (2018)

---

## Abstract

Underwater Wireless Sensor Networks (UWSNs) have drawn tremendous attentions from all fields because of their wide application. Underwater wireless sensor networks are similar to terrestrial Wireless Sensor Networks (WSNs), however, due to different working environment and communication medium, UWSNs have many unique characteristics such as high bit error rate, long end-to-end delay and low bandwidth. These characteristics of UWSNs lead to many problems such as retransmission, high energy consumption and low reliability. To solve these problems, many routing protocols for UWSNs are proposed. In this paper, a localization-free routing protocol, named energy efficient routing protocol based on layers and unequal clusters (EERBLC) is proposed. EERBLC protocol consists of three phases: layer and unequal cluster formation, transmission routing, maintenance and update of clusters. In the first phase, the monitoring area under the water is divided into layers, the nodes in the same layer are clustered. For balancing energy of the whole network and avoiding the “hotspot” problem, a novel unequal clustering method based on layers for UWSNs is proposed, in which a new calculation method of unequal cluster size is presented. Meanwhile, a new cluster head selection mechanism based on energy balance and degree is given. In the transmission phase, EERBLC protocol proposes a novel next forwarder selection method based on the forwarding ratio and the residual energy. In the third phase, Intra and inter cluster updating method is presented. The simulation results show that the EERBLC can effectively balance the energy consumption, prolong the network lifetime, and increase the amount of data transmission compared with DBR and EEDBR protocols.


---

## Body

## 1. Introduction

Nowadays, Underwater Wireless Sensor Networks (UWSNs) are attracting more attentions from academia and industry because of their broad application fields such as environmental monitoring, disasters prevention, auxiliary navigation, resource exploration and so on [1–7]. UWSN is composed of the base station, sink nodes and ordinary sensor nodes. The sensor nodes are randomly deployed from surface to bottom of water. They collect and transmit the information to the sink nodes. Sink nodes receive the information form sensor nodes, and then send the information to the base station. Sink nodes are usually deployed on the surface of water. The base station processes the data and supports the final decision through data analysis. Figure 1 shows the architecture of UWSNs. UWSNs are similar to terrestrial Wireless Sensor Networks (WSNs). However, considering the physical layer technology and propagation medium, the challenges are very different from terrestrial WSNs. In the terrestrial WSNs, data are transmitted through radio signals. But it is not suitable for underwater environment, due to rapid decay and high energy consumption in the water. Usually in the water, the acoustic signal is adopted as communication medium. The speed of acoustic signal is significantly slower than radio signal, which causes the high propagation delay. Moreover, multipath fading channel causes high bit error ratio and the low bandwidth. These characteristics lead to many problems such as retransmission, high energy consumption and low reliability. Therefore, design of routing protocols suitable for UWSNs becomes a challenge task.Figure 1
Architecture of UWSN.Many routing protocols have been proposed for UWSNs in last few years [8–29]. These protocols can be classified into two categories: localization-based and localization-free routing protocols. In the section 2, we introduce two types of protocols in detail. In the localization-based protocols, each node requires to know its location. However, location-known is a hard issue for UWSNs because GPS device is not suitable for working in the water and the position of node is changing at any time with water current. Localization-free routing protocols are more suitable for UWSNs than localization-based routing protocols, because the nodes do not need to know their location in localization-free routing protocols.In this paper, we propose a localization-free routing protocol, named energy efficient routing protocol based on layers and unequal clusters (EERBLC). This routing protocol aims to solve the problems of high energy consumption, long propagation delay and high error rate. In this protocol, the monitoring area is layered according to the distance to the surface, and then nodes are clustered in each layer. In this process, unequal clusters are formed to balance energy. The size of cluster closer to the surface is smaller than far away from the surface. EERBLC protocol presents layer algorithm, cluster head election algorithm and cluster size calculation algorithm. Cluster member nodes collect and send the data to cluster head node in each cluster. Cluster head nodes perform data aggregation and forward the data to sink nodes by multi-hop path. Furthermore, a novel approach of selecting the next-hop based on link quality and residual energy is proposed during the data forwarding. Finally, the method of maintenance and update of cluster is presented in EERBLC protocol.The rest of this paper is organized as follows. Some well-known routing protocols proposed for UWSNs are summarized in Section2. Section 3 describes the proposed routing protocol EERBLC in detail. Section 4 presents the performance evaluation of EERBLC. Finally, Section 5 illustrates the conclusion of this study.


## 2. Related Works

UWSNs have been under research over last ten years. Many routing protocols for UWSNs have been proposed by some researchers. As mentioned above, these protocols can be classified into two categories: localization-based and localization-free.


### 2.1. Localization-Based Routing Protocols

A vector-based forwarding (VBF) routing protocol is proposed in literature [14]. In this protocol, it supposes that each sensor node knows its own location. Sensor nodes forward data packets with the location information of source, destination and a range field. Only those nodes in a pipe with a given radius can be selected as forwarders. The pipe is halved by a vector from the source node to the sink node. VBF reduces the number of forwarding nodes, so the overhead of whole network is reduced. However, it is sensitive to the radius of pipe. Based on the VBF protocol, many improved protocols are proposed [15–17]. Some of these protocols [15, 16] improve the delivery ratio, and some [17] improve the energy consumption. Focused Bream Routing (FBR) is presented to reduce unnecessary flooding in literature [18]. During the selection of forwarder, FBR uses different transmission power levels. In the FBR protocol, the mechanism of RTS/CTS leads to long end-to-end delay and excessive energy consumption. A novel multipath grid-based geographical routing protocol (EMGGR) for UWSNs is proposed in literature [19]. EMGGR routing protocol assumes that the geographic area of the network is partitioned into 3D logical grids and sensor nodes are deployed in some cells. It selects gateways based on their locations and remaining energy level. Some protocol similar to EMGGR are proposed such as NGF [11], GGFGD and GFGD [20]. Literature [21] proposes the depth-controlled routing (DCR). In DCR, each sensor node with network topology controller can adjust the its depth to organize the network topology when the greedy geographic routing fails. DCR is the first geographic routing protocol for UWSNs that considers the sensor node vertical movement ability to move it for topology control purpose.


### 2.2. Localization-Free Routing Protocols

In the localization-based routing protocols, full-dimensional location information is needed. However, in the underwater environment, the location information is hard to acquire. So, many localization-free routing protocols were proposed.A classical localization-free routing protocol called depth-based routing (DBR) is presented in literature [22]. This protocol assumes that each node equipped with a depth sensor. DBR selects next forwarder based on depth information. DBR is a practical routing protocol. However, it has some serious problems. First, if the nodes have same depth, they will forward the data packet at same time. Even if the depths are not exactly the same, because of the long propagation delay in UWSNs, the same packet can be forwarded by different nodes. Particularly, in density areas, large number of redundant data packets will be generated which leads to high energy consumption. Second, in the case of sparse areas, it is possible that no sensor node can be selected as forwarder due to its greedy mode. Third, because each node needs to keep data packet for a certain time after receiving data packet, it causes long end-to-end delay. These problems affect the performance of DBR. To improve DBR’s energy consumption problem, Energy-efficient depth-based routing protocol (EEDBR) for UWSNs is proposed in literature [23]. EEDBR improvs the performance in terms of the network lifetime, energy consumption and end-to-end delay. Hop-by-hop dynamic addressing-based routing protocol (H2-DAB) is proposed in literature [24]. In H2-DAB, each node needs to be assigned a HopID. The HopID of node represents hop count from current node to sink nodes. The nodes with smallest HopID are selected as forwarders by source node. That causes the problem of void region. Moreover, the inquiry request and reply mechanism results in long end-to-end delay and extra energy consumption. To improve the delivery ratio, some localization-free protocols are proposed such as CARP and E-CARP [12, 25]. In literature [26], a cluster-based routing protocol (CBKU) for UWSNs is proposed. CBKU uses the improved K-means algorithm for clustering to avoid energy unbalanced. To prolong the lifetime of UWSNs, some location-free protocols are proposed based on cluster [27–29].


## 2.1. Localization-Based Routing Protocols

A vector-based forwarding (VBF) routing protocol is proposed in literature [14]. In this protocol, it supposes that each sensor node knows its own location. Sensor nodes forward data packets with the location information of source, destination and a range field. Only those nodes in a pipe with a given radius can be selected as forwarders. The pipe is halved by a vector from the source node to the sink node. VBF reduces the number of forwarding nodes, so the overhead of whole network is reduced. However, it is sensitive to the radius of pipe. Based on the VBF protocol, many improved protocols are proposed [15–17]. Some of these protocols [15, 16] improve the delivery ratio, and some [17] improve the energy consumption. Focused Bream Routing (FBR) is presented to reduce unnecessary flooding in literature [18]. During the selection of forwarder, FBR uses different transmission power levels. In the FBR protocol, the mechanism of RTS/CTS leads to long end-to-end delay and excessive energy consumption. A novel multipath grid-based geographical routing protocol (EMGGR) for UWSNs is proposed in literature [19]. EMGGR routing protocol assumes that the geographic area of the network is partitioned into 3D logical grids and sensor nodes are deployed in some cells. It selects gateways based on their locations and remaining energy level. Some protocol similar to EMGGR are proposed such as NGF [11], GGFGD and GFGD [20]. Literature [21] proposes the depth-controlled routing (DCR). In DCR, each sensor node with network topology controller can adjust the its depth to organize the network topology when the greedy geographic routing fails. DCR is the first geographic routing protocol for UWSNs that considers the sensor node vertical movement ability to move it for topology control purpose.


## 2.2. Localization-Free Routing Protocols

In the localization-based routing protocols, full-dimensional location information is needed. However, in the underwater environment, the location information is hard to acquire. So, many localization-free routing protocols were proposed.A classical localization-free routing protocol called depth-based routing (DBR) is presented in literature [22]. This protocol assumes that each node equipped with a depth sensor. DBR selects next forwarder based on depth information. DBR is a practical routing protocol. However, it has some serious problems. First, if the nodes have same depth, they will forward the data packet at same time. Even if the depths are not exactly the same, because of the long propagation delay in UWSNs, the same packet can be forwarded by different nodes. Particularly, in density areas, large number of redundant data packets will be generated which leads to high energy consumption. Second, in the case of sparse areas, it is possible that no sensor node can be selected as forwarder due to its greedy mode. Third, because each node needs to keep data packet for a certain time after receiving data packet, it causes long end-to-end delay. These problems affect the performance of DBR. To improve DBR’s energy consumption problem, Energy-efficient depth-based routing protocol (EEDBR) for UWSNs is proposed in literature [23]. EEDBR improvs the performance in terms of the network lifetime, energy consumption and end-to-end delay. Hop-by-hop dynamic addressing-based routing protocol (H2-DAB) is proposed in literature [24]. In H2-DAB, each node needs to be assigned a HopID. The HopID of node represents hop count from current node to sink nodes. The nodes with smallest HopID are selected as forwarders by source node. That causes the problem of void region. Moreover, the inquiry request and reply mechanism results in long end-to-end delay and extra energy consumption. To improve the delivery ratio, some localization-free protocols are proposed such as CARP and E-CARP [12, 25]. In literature [26], a cluster-based routing protocol (CBKU) for UWSNs is proposed. CBKU uses the improved K-means algorithm for clustering to avoid energy unbalanced. To prolong the lifetime of UWSNs, some location-free protocols are proposed based on cluster [27–29].


## 3. Design of Proposed Protocol (EERBLC)

### 3.1. Motivation of EERBLC

Reducing energy consumption is the main objective of a routing protocol for UWSNs. In underwater environment, acoustic signal is adopted as communication medium, which leads to more energy consumption. The energy of sensor nodes is limited and hard to be supplied. Hence, energy efficient and energy balance are primary design objectives in a routing protocol. Cluster-based routing protocols have been proposed in the terrestrial wireless sensor networks [30–33]. After clustering, member sensor nodes collect and send data to the cluster head, cluster head sends the data to the sink node after data fusion. It has been proved that cluster-based protocols are very effective on saving energy. In UWSNs, transmission requires more energy than receiving. Therefore, reducing the number of transmissions is useful in reducing the energy consumption. Cluster head aggregates and fuses data can effectively reduce the number of transmission. Because long distance communication leads to more energy consumption, multi-hop path routing method is adopted to save the energy in our protocol. Cluster heads forward the data to sink nodes by other cluster heads. Therefore, our work aims to design a routing protocol more suitable for UWSNs based on cluster.Some protocols for UWSNs have introduced clustering techniques [34–38], but none of them takes into account the “hotspot” problem. “Hotspot” problem is that cluster heads especially the nodes near the surface forward data more frequently than others, which results in premature death of these nodes. The “hotspot” problem affects whole network lifetime. Therefore, EERBLC protocol aims to improve the clustering technique to solve the hotspot problem. The idea is that the nodes near the surface are not clustered, and each node of these can be selected as forwarder; At the same time, unequal cluster technology is applied to avoid the “hotspot” problem. The layer is closer to the surface, the number of cluster is lager and size of cluster is smaller. Furthermore, during the selection of the forwarder, energy balance should be considered.Due to the harsh environment, the bit error rate is very high and delivery ratio is very low in UWSNs. High quality links can improve bit error rate, delivery ratio, and energy consumption. Therefore, the selection of reliable routing path with good link quality is very important issue. During the selection of next forwarder, the link quality and residual energy are both taken into account in EERBLC protocol.


### 3.2. Network Structure and Assumption

The network structure is shown in Figure1. EERBLC adopts multi-sinks mode to increase the reliability of the network and the data delivery ratio. This mode also can reduce the energy consumption of the nodes around the sinks. Sink nodes are distributed evenly on the water surface. Each sink node is equipped with a radio modem and acoustic modem. Radio modem is used to communicate between sink nodes and the data center. Acoustic modem is used to communicate between sensor nodes under the water.To make the clustering more effective, Underwater sensor nodes are deployed in the form of layer from bottom to surface in a 3D space. The sensor nodes are deployed at different layers by a bouncy control mechanism. The numbers of layers depended on the depth of the water and the communication range between the layers. If the average depth of the ocean is about 2.5–3 km and the communication rang is 500 m, about 5-6 layers are needed. Each sensor node is equipped with an acoustic modem for communicating with each other in the underwater. Underwater sensor nodes drift with water current in the horizontal direction, the vertical movement can be negligible.All underwater sensor nodes can sensor and collect data. In each layer, the nodes are clustered except in the highest layer where the nodes can directly communicate with sink nodes. In each cluster, cluster members send the data to the cluster head. Cluster head aggerates and forwards the data to other cluster head. The data are sent to the sink by multi-hop path. Considering the energy balance, clustering is not needed in the highest layer, where all nodes can be selected as forwarder.In this paper, we assume the energy of sink nodes is unlimited because the battery of sink nodes can be replaced. Meanwhile, we assume the underwater sensor nodes have equal initial energy and same communication range. And the energy of underwater sensor nodes is one-time. Each underwater sensor node equipped with the depth sensor. Once any one of sink nodes receives the data packets, delivery is considered to be successful.


### 3.3. Energy Consuming Model

Due to the characteristics of underwater acoustic channel, the energy consuming model of UWSNs is quite different from the energy consuming model of terrestrial WSNs. The formula (1) shows the calculation method.
(1)Ed,f=P0dkadWhereP0 is the power threshold that the data can be received by the nodes, d is the transmitting distance, k is the coefficient of energy expansion, Ed,f is the lowest energy consumption to send the data to the destination. a is defined as formula (2).
(2)a=10af/10Wherea is concerned with frequency, which is defined as formula (3).
(3)af=0.11f21+f2+44f24100+f2+2.75×10−4f2+0.003Wheref is the frequency of the carrier acoustic signal in Hz and af is in dB/m.EDAl means the energy consumed by fusing l bits of data, which is shown as formula (4).
(4)EDAl=EEA∗lWhereEEA is the energy consumed by fusing one bit of data, generally it can be taken as 5nJ/bit.


### 3.4. EERBLC Protocol

As mentioned above, in the EERBLC protocol, the underwater sensor nodes are deployed in form of layer. For example, if the depth of monitoring area is 1000 m and the communication rang of nodes is 250 m, the whole network needs 4 layers of nodes. The distance is less than or equal to 250 m between two layers. In each layer, the sensor nodes are randomly deployed. The nodes compete to be cluster head at the same layer.There are three phases in the EERBLC protocol, including cluster formation, transmission routing and maintenance and update of clusters.


#### 3.4.1. Cluster Formation

The multi-hop transmission causes an unbalanced energy consumption. Cluster heads closer to the sink nodes take on more forwarding tasks than other cluster heads. To solve this problem, the unequal cluster technology is adopted in EERBLC protocol. Clusters will have equal cluster sizes at the same layer. The size of cluster with higher depth is larger. In the first layer, cluster is not formed and each node can forward the data to sink nodes directly. The structure of the network in EERBLC protocol is shown in Figure2. In order to balance energy consumption between nodes in each cluster, the cluster heads selection mechanism is based on three parameters: residual energy, the degree and the layer number.Figure 2
Structure of the network in EERBLC.After sensor nodes are deployed, each node calculates its own layer number. The formula (5) shows the calculation method of layer number.
(5)Ln=ni_depthR+1Where Ln is layer number of nodeni, ni_depth is the depth of ni, R is the maximum communication rang of node.There are three steps in the cluster setup phase. The first step of this phase is information collection phase, whose duration is set as T1. At the beginning of this phase, each node broadcasts a N_HELLO message which includes node id, layer number, residual energy. Once receiving the N_HELLO message, each node records the message of neighbors at the same layer. The message from nodes at other layers is dropped. The format of the N_HELLO packet is shown in Table1.Table 1
Format of N_HELLO packet.
Type of packet
Node id
Layer number
Residual energyThe second step is the cluster head competition phase, which starts when T1 expires. In this phase, the sensor node whose waiting time Tc expires becomes cluster head, and broadcasts a competition message N_COM. The competition message N_COM maintains node id, layer number, residual energy and degree. Degree is the number of neighbors. The format of the N_COM packet is shown in Table2.Table 2
Format of N_COM packet.
Type of packet
Node id
Layer number
Residual energy
DegreeIf the node Si received N_COM message from other nodes in the same layer before Tc expires, node Si drops competition and becomes an ordinary node. Tc is different for each node, which is calculated as following formula (6).
(6)Tc=1−residualenergyinitialenergy∗T2+PWhere T2 is the duration of the competition,P is the random value in [0.5, 1], which is used to avoid the communication conflict when residual energy of nodes is the same. It can be seen from formula (6) that the nodes with higher residual energy have shorter waiting time and have a greater chance to be cluster head. Once the waiting time Tc of a node expires, it is selected as candidate cluster head and broadcasts N_COM message within competition communication rang.In order to balance energy of whole network, unequal clusters are formed in different layers. The nodes closer to the surface have heavier forwarding load. Hence, the cluster size is smaller in the layer which is closer to surface. In order to generate unequal clusters, these nodes need to calculate their own competition radius Rc. The formula (7) shows the computing method of Rc.
(7)Rc=βenergycenergyinit∗αLnLtn∗RWhereLn is the layer number of node, Ltn is total layer number of whole network, energyc is current residual energy, α and β is weighted value. It is shown from formula (7) that nodes with bigger layer number have lager competition radius. And the nodes with more energy have lager competition radius at the same layer.If a node Sj receives a N_COM message from node Si before its waiting time Tc expires, it adds the Si to its candidate cluster head list and becomes a non-cluster head node. If the node receives many N_COM messages from several cluster heads, it requires to select a cluster head from its candidate cluster head list. To optimize the selection method of cluster head, we design a multi-objective optimization technique to calculate the cost value for each candidate. The cost value is calculated as formula (8).
(8)costi=γenergyres_ienergyinit+θdegree_iN,γ+θ=1Whereenergyres_i is the residual energy of candidate Si, degree_i is the number of neighbors of candidate Si, N is the total number of all nodes. γ and θ are the parameters which are used to adjust the weight of energy and degree. The node with maximum cost value will be selected as cluster head by node Sj. If there are several cluster head nodes with the maximum value, the first node with maximum value in the list is selected as its cluster head. After selection of cluster head, node Sj replies a N_JOIN message to the selected head node. N_JOIN maintains id of head node, id of Sj, residual energy. The head node adds Sj to its member list. The format of the N_JOIN packet is shown in Table 3.Table 3
Format of N_JOIN packet.
Type of packet
Head node id
Member id
Residual energyThe procedure of cluster formation is shown as algorithm1.Algorithm 1: Cluster formation algorithm.
1:Procedure cluster formation
2:for each node Ni
3: calculate the layer number LN
4: Ni < − LN
5:end for
6:for each node Ni
7: broadcast N_HELLO
8:end for
9:for each node Ni received N_HELLO packet
10:if node’s LN in received packet = Ni’s LN
11: record message of neighbors
12:else drop the packet
13:end if
14:end for
15:for each node Ni
16:if LN ≠ 1
17: Ni calculate Tc
18:end if
19:end for
20:for each node Ni
21:while Tc does not expire
22:end while
23:if did not receive N_COM packet
24: calculate competition radius Rc
25: broadcast N_COM packet within Rc
26:else CH(Sj) < -N_COM packet
26:end if
27:end for
28:for each node received N_COM packet
29: calculate cost (i) value
30: send the N_JOIN packet
31:end for
32:for each head node
33: record the member nodes
34:end for
35:end procedure


#### 3.4.2. Transmission Routing Algorithm

After cluster formation phase, each cluster head assigns a TDMA schedule to each member of its cluster. Each member node transmits its data at its allocated time slot. The cluster head aggregates and forwards the data to the sink nodes. If the node resides at the highest layer which number is 1, the data are transmitted to the sink nodes directly. In other case, the data are forwarded by cluster heads through multi-hop path.Each cluster head records the information of head id, residual energy and forwarding ratio when it hears data packets from other heads at its upper layer which layer number is one less than its layer number. Cluster head only selects the nodes at upper layer as next forwarder. Considering the energy efficient and delivery ratio, the selection of next hop is based on residual energy and forwarding ratio. The cost value of selection is computed as following formula (9).
(9)H_costi=μenergyres_Hienergyinit+εfr,μ+ε=1Whereenergyres_Hi is the residual energy of head node Si, fr is the forwarding ratio of Si, μ and ε are the weight coefficient.Cluster head calculates cost value of each cluster head according to the information recorded. For improving deliver ratio, two head nodes with the biggest value are selected as next forwarder. Cluster heads forward data packet including data number, source id, head id, next hop id1, next hop id2, data, residual energy and forwarding ratio. The format of data packet is shown as Table4.Table 4
Format of data packet.
Type of packet
Data number
Source node id
Head id
Next hop id1
Next hop id2
Data
Residual energy
Forwarding ratioEach data packet from the same node has a unique number. The source node id and data number represent a unique data packet in whole network. The head id represents the head node of forwarding this data packet. The next hop id1 and next hop id2 represent the next forwarder nodes which cost value is the two largest among the all neighbor head nodes at upper layer. The cost value of next hop id1 is larger than next hop id2. Residual energy is the current energy of head node of forwarding data. Forwarding ratio is the delivery ratio of forwarding head node.If a cluster head receives no messages from other head nodes at upper layer, it will send the data to neighbor heads at same layer. The head nodes received data packet will compare its id to next hop id1 and next hop id2. If node’s id is next hop id1 and the data packet is not recorded, it will forward the data packet immediately. Otherwise, if node’s id is next hop id2 and data packet is not recorded, it will forward the data packet after waiting for a certain time. During the waiting time, the forwarder will drop the data packet if it receives the same data packet. The forwarding node records 10 data packet forwarded recently. If node’s id is neither next hop id1 nor next hop id2, the data packet will be dropped. The procedure of next forwarder selection is shown as algorithm2.Algorithm 2: Next forwarder selection algorithm.
1:Procedure forwarder selection
2:for each head node Hi
3:for each head Hj ∈neihgbors ∩ Hi’s LN-1 = Hj’s LN
4: calculate H_cost(j)
5:end for
6: select two nodes as forwarders with two largest H_cost
7: send N_DATA packet to forwarder
8:end for
9:for each node Ni received data packet
10:if next hop id1 in received packet = Ni’s id
11:if the data packet ∉ records
12:  record data packet
13:  forward data packet
14:else drop the data packet
15:end if
16:else if next hop id2 in received packet = Ni’s id
17:if the data packet ∉ records
18:  record data packet
19:  waiting for a certain time
20:if not receive the same packet
21:  forward data packet
22:else drop the data packet
23:end if
24:else drop the data packet
25:end if
26:else drop the data packet
27:end if
28:end for


#### 3.4.3. Maintenance and Update Method of Clusters

The structure of underwater wireless sensor network is dynamic. The nodes move randomly with water current. Therefore, the structure of clusters may change at any time. A recovery mechanism is proposed in this paper.For member nodes, when the member node fails to send the data to its cluster head, that means it has moved out of its cluster. In this case, it will monitor data packets from cluster heads. Once hearing a data packet of cluster head, it will join this cluster according to the information in data packet.Each cluster head calculates the average energy of the its cluster. When its energy is lower than average energy, cluster is reformed in this layer and routing information is updated.For the whole network, at each round of data collection, sink nodes expect the delivery ratio of next round. Once the delivery ratio is less than 70% of expected, the sink nodes will broadcast reformation message to the nodes. The underwater sensor nodes will rebuild the clusters.


## 3.1. Motivation of EERBLC

Reducing energy consumption is the main objective of a routing protocol for UWSNs. In underwater environment, acoustic signal is adopted as communication medium, which leads to more energy consumption. The energy of sensor nodes is limited and hard to be supplied. Hence, energy efficient and energy balance are primary design objectives in a routing protocol. Cluster-based routing protocols have been proposed in the terrestrial wireless sensor networks [30–33]. After clustering, member sensor nodes collect and send data to the cluster head, cluster head sends the data to the sink node after data fusion. It has been proved that cluster-based protocols are very effective on saving energy. In UWSNs, transmission requires more energy than receiving. Therefore, reducing the number of transmissions is useful in reducing the energy consumption. Cluster head aggregates and fuses data can effectively reduce the number of transmission. Because long distance communication leads to more energy consumption, multi-hop path routing method is adopted to save the energy in our protocol. Cluster heads forward the data to sink nodes by other cluster heads. Therefore, our work aims to design a routing protocol more suitable for UWSNs based on cluster.Some protocols for UWSNs have introduced clustering techniques [34–38], but none of them takes into account the “hotspot” problem. “Hotspot” problem is that cluster heads especially the nodes near the surface forward data more frequently than others, which results in premature death of these nodes. The “hotspot” problem affects whole network lifetime. Therefore, EERBLC protocol aims to improve the clustering technique to solve the hotspot problem. The idea is that the nodes near the surface are not clustered, and each node of these can be selected as forwarder; At the same time, unequal cluster technology is applied to avoid the “hotspot” problem. The layer is closer to the surface, the number of cluster is lager and size of cluster is smaller. Furthermore, during the selection of the forwarder, energy balance should be considered.Due to the harsh environment, the bit error rate is very high and delivery ratio is very low in UWSNs. High quality links can improve bit error rate, delivery ratio, and energy consumption. Therefore, the selection of reliable routing path with good link quality is very important issue. During the selection of next forwarder, the link quality and residual energy are both taken into account in EERBLC protocol.


## 3.2. Network Structure and Assumption

The network structure is shown in Figure1. EERBLC adopts multi-sinks mode to increase the reliability of the network and the data delivery ratio. This mode also can reduce the energy consumption of the nodes around the sinks. Sink nodes are distributed evenly on the water surface. Each sink node is equipped with a radio modem and acoustic modem. Radio modem is used to communicate between sink nodes and the data center. Acoustic modem is used to communicate between sensor nodes under the water.To make the clustering more effective, Underwater sensor nodes are deployed in the form of layer from bottom to surface in a 3D space. The sensor nodes are deployed at different layers by a bouncy control mechanism. The numbers of layers depended on the depth of the water and the communication range between the layers. If the average depth of the ocean is about 2.5–3 km and the communication rang is 500 m, about 5-6 layers are needed. Each sensor node is equipped with an acoustic modem for communicating with each other in the underwater. Underwater sensor nodes drift with water current in the horizontal direction, the vertical movement can be negligible.All underwater sensor nodes can sensor and collect data. In each layer, the nodes are clustered except in the highest layer where the nodes can directly communicate with sink nodes. In each cluster, cluster members send the data to the cluster head. Cluster head aggerates and forwards the data to other cluster head. The data are sent to the sink by multi-hop path. Considering the energy balance, clustering is not needed in the highest layer, where all nodes can be selected as forwarder.In this paper, we assume the energy of sink nodes is unlimited because the battery of sink nodes can be replaced. Meanwhile, we assume the underwater sensor nodes have equal initial energy and same communication range. And the energy of underwater sensor nodes is one-time. Each underwater sensor node equipped with the depth sensor. Once any one of sink nodes receives the data packets, delivery is considered to be successful.


## 3.3. Energy Consuming Model

Due to the characteristics of underwater acoustic channel, the energy consuming model of UWSNs is quite different from the energy consuming model of terrestrial WSNs. The formula (1) shows the calculation method.
(1)Ed,f=P0dkadWhereP0 is the power threshold that the data can be received by the nodes, d is the transmitting distance, k is the coefficient of energy expansion, Ed,f is the lowest energy consumption to send the data to the destination. a is defined as formula (2).
(2)a=10af/10Wherea is concerned with frequency, which is defined as formula (3).
(3)af=0.11f21+f2+44f24100+f2+2.75×10−4f2+0.003Wheref is the frequency of the carrier acoustic signal in Hz and af is in dB/m.EDAl means the energy consumed by fusing l bits of data, which is shown as formula (4).
(4)EDAl=EEA∗lWhereEEA is the energy consumed by fusing one bit of data, generally it can be taken as 5nJ/bit.


## 3.4. EERBLC Protocol

As mentioned above, in the EERBLC protocol, the underwater sensor nodes are deployed in form of layer. For example, if the depth of monitoring area is 1000 m and the communication rang of nodes is 250 m, the whole network needs 4 layers of nodes. The distance is less than or equal to 250 m between two layers. In each layer, the sensor nodes are randomly deployed. The nodes compete to be cluster head at the same layer.There are three phases in the EERBLC protocol, including cluster formation, transmission routing and maintenance and update of clusters.


### 3.4.1. Cluster Formation

The multi-hop transmission causes an unbalanced energy consumption. Cluster heads closer to the sink nodes take on more forwarding tasks than other cluster heads. To solve this problem, the unequal cluster technology is adopted in EERBLC protocol. Clusters will have equal cluster sizes at the same layer. The size of cluster with higher depth is larger. In the first layer, cluster is not formed and each node can forward the data to sink nodes directly. The structure of the network in EERBLC protocol is shown in Figure2. In order to balance energy consumption between nodes in each cluster, the cluster heads selection mechanism is based on three parameters: residual energy, the degree and the layer number.Figure 2
Structure of the network in EERBLC.After sensor nodes are deployed, each node calculates its own layer number. The formula (5) shows the calculation method of layer number.
(5)Ln=ni_depthR+1Where Ln is layer number of nodeni, ni_depth is the depth of ni, R is the maximum communication rang of node.There are three steps in the cluster setup phase. The first step of this phase is information collection phase, whose duration is set as T1. At the beginning of this phase, each node broadcasts a N_HELLO message which includes node id, layer number, residual energy. Once receiving the N_HELLO message, each node records the message of neighbors at the same layer. The message from nodes at other layers is dropped. The format of the N_HELLO packet is shown in Table1.Table 1
Format of N_HELLO packet.
Type of packet
Node id
Layer number
Residual energyThe second step is the cluster head competition phase, which starts when T1 expires. In this phase, the sensor node whose waiting time Tc expires becomes cluster head, and broadcasts a competition message N_COM. The competition message N_COM maintains node id, layer number, residual energy and degree. Degree is the number of neighbors. The format of the N_COM packet is shown in Table2.Table 2
Format of N_COM packet.
Type of packet
Node id
Layer number
Residual energy
DegreeIf the node Si received N_COM message from other nodes in the same layer before Tc expires, node Si drops competition and becomes an ordinary node. Tc is different for each node, which is calculated as following formula (6).
(6)Tc=1−residualenergyinitialenergy∗T2+PWhere T2 is the duration of the competition,P is the random value in [0.5, 1], which is used to avoid the communication conflict when residual energy of nodes is the same. It can be seen from formula (6) that the nodes with higher residual energy have shorter waiting time and have a greater chance to be cluster head. Once the waiting time Tc of a node expires, it is selected as candidate cluster head and broadcasts N_COM message within competition communication rang.In order to balance energy of whole network, unequal clusters are formed in different layers. The nodes closer to the surface have heavier forwarding load. Hence, the cluster size is smaller in the layer which is closer to surface. In order to generate unequal clusters, these nodes need to calculate their own competition radius Rc. The formula (7) shows the computing method of Rc.
(7)Rc=βenergycenergyinit∗αLnLtn∗RWhereLn is the layer number of node, Ltn is total layer number of whole network, energyc is current residual energy, α and β is weighted value. It is shown from formula (7) that nodes with bigger layer number have lager competition radius. And the nodes with more energy have lager competition radius at the same layer.If a node Sj receives a N_COM message from node Si before its waiting time Tc expires, it adds the Si to its candidate cluster head list and becomes a non-cluster head node. If the node receives many N_COM messages from several cluster heads, it requires to select a cluster head from its candidate cluster head list. To optimize the selection method of cluster head, we design a multi-objective optimization technique to calculate the cost value for each candidate. The cost value is calculated as formula (8).
(8)costi=γenergyres_ienergyinit+θdegree_iN,γ+θ=1Whereenergyres_i is the residual energy of candidate Si, degree_i is the number of neighbors of candidate Si, N is the total number of all nodes. γ and θ are the parameters which are used to adjust the weight of energy and degree. The node with maximum cost value will be selected as cluster head by node Sj. If there are several cluster head nodes with the maximum value, the first node with maximum value in the list is selected as its cluster head. After selection of cluster head, node Sj replies a N_JOIN message to the selected head node. N_JOIN maintains id of head node, id of Sj, residual energy. The head node adds Sj to its member list. The format of the N_JOIN packet is shown in Table 3.Table 3
Format of N_JOIN packet.
Type of packet
Head node id
Member id
Residual energyThe procedure of cluster formation is shown as algorithm1.Algorithm 1: Cluster formation algorithm.
1:Procedure cluster formation
2:for each node Ni
3: calculate the layer number LN
4: Ni < − LN
5:end for
6:for each node Ni
7: broadcast N_HELLO
8:end for
9:for each node Ni received N_HELLO packet
10:if node’s LN in received packet = Ni’s LN
11: record message of neighbors
12:else drop the packet
13:end if
14:end for
15:for each node Ni
16:if LN ≠ 1
17: Ni calculate Tc
18:end if
19:end for
20:for each node Ni
21:while Tc does not expire
22:end while
23:if did not receive N_COM packet
24: calculate competition radius Rc
25: broadcast N_COM packet within Rc
26:else CH(Sj) < -N_COM packet
26:end if
27:end for
28:for each node received N_COM packet
29: calculate cost (i) value
30: send the N_JOIN packet
31:end for
32:for each head node
33: record the member nodes
34:end for
35:end procedure


### 3.4.2. Transmission Routing Algorithm

After cluster formation phase, each cluster head assigns a TDMA schedule to each member of its cluster. Each member node transmits its data at its allocated time slot. The cluster head aggregates and forwards the data to the sink nodes. If the node resides at the highest layer which number is 1, the data are transmitted to the sink nodes directly. In other case, the data are forwarded by cluster heads through multi-hop path.Each cluster head records the information of head id, residual energy and forwarding ratio when it hears data packets from other heads at its upper layer which layer number is one less than its layer number. Cluster head only selects the nodes at upper layer as next forwarder. Considering the energy efficient and delivery ratio, the selection of next hop is based on residual energy and forwarding ratio. The cost value of selection is computed as following formula (9).
(9)H_costi=μenergyres_Hienergyinit+εfr,μ+ε=1Whereenergyres_Hi is the residual energy of head node Si, fr is the forwarding ratio of Si, μ and ε are the weight coefficient.Cluster head calculates cost value of each cluster head according to the information recorded. For improving deliver ratio, two head nodes with the biggest value are selected as next forwarder. Cluster heads forward data packet including data number, source id, head id, next hop id1, next hop id2, data, residual energy and forwarding ratio. The format of data packet is shown as Table4.Table 4
Format of data packet.
Type of packet
Data number
Source node id
Head id
Next hop id1
Next hop id2
Data
Residual energy
Forwarding ratioEach data packet from the same node has a unique number. The source node id and data number represent a unique data packet in whole network. The head id represents the head node of forwarding this data packet. The next hop id1 and next hop id2 represent the next forwarder nodes which cost value is the two largest among the all neighbor head nodes at upper layer. The cost value of next hop id1 is larger than next hop id2. Residual energy is the current energy of head node of forwarding data. Forwarding ratio is the delivery ratio of forwarding head node.If a cluster head receives no messages from other head nodes at upper layer, it will send the data to neighbor heads at same layer. The head nodes received data packet will compare its id to next hop id1 and next hop id2. If node’s id is next hop id1 and the data packet is not recorded, it will forward the data packet immediately. Otherwise, if node’s id is next hop id2 and data packet is not recorded, it will forward the data packet after waiting for a certain time. During the waiting time, the forwarder will drop the data packet if it receives the same data packet. The forwarding node records 10 data packet forwarded recently. If node’s id is neither next hop id1 nor next hop id2, the data packet will be dropped. The procedure of next forwarder selection is shown as algorithm2.Algorithm 2: Next forwarder selection algorithm.
1:Procedure forwarder selection
2:for each head node Hi
3:for each head Hj ∈neihgbors ∩ Hi’s LN-1 = Hj’s LN
4: calculate H_cost(j)
5:end for
6: select two nodes as forwarders with two largest H_cost
7: send N_DATA packet to forwarder
8:end for
9:for each node Ni received data packet
10:if next hop id1 in received packet = Ni’s id
11:if the data packet ∉ records
12:  record data packet
13:  forward data packet
14:else drop the data packet
15:end if
16:else if next hop id2 in received packet = Ni’s id
17:if the data packet ∉ records
18:  record data packet
19:  waiting for a certain time
20:if not receive the same packet
21:  forward data packet
22:else drop the data packet
23:end if
24:else drop the data packet
25:end if
26:else drop the data packet
27:end if
28:end for


### 3.4.3. Maintenance and Update Method of Clusters

The structure of underwater wireless sensor network is dynamic. The nodes move randomly with water current. Therefore, the structure of clusters may change at any time. A recovery mechanism is proposed in this paper.For member nodes, when the member node fails to send the data to its cluster head, that means it has moved out of its cluster. In this case, it will monitor data packets from cluster heads. Once hearing a data packet of cluster head, it will join this cluster according to the information in data packet.Each cluster head calculates the average energy of the its cluster. When its energy is lower than average energy, cluster is reformed in this layer and routing information is updated.For the whole network, at each round of data collection, sink nodes expect the delivery ratio of next round. Once the delivery ratio is less than 70% of expected, the sink nodes will broadcast reformation message to the nodes. The underwater sensor nodes will rebuild the clusters.


## 3.4.1. Cluster Formation

The multi-hop transmission causes an unbalanced energy consumption. Cluster heads closer to the sink nodes take on more forwarding tasks than other cluster heads. To solve this problem, the unequal cluster technology is adopted in EERBLC protocol. Clusters will have equal cluster sizes at the same layer. The size of cluster with higher depth is larger. In the first layer, cluster is not formed and each node can forward the data to sink nodes directly. The structure of the network in EERBLC protocol is shown in Figure2. In order to balance energy consumption between nodes in each cluster, the cluster heads selection mechanism is based on three parameters: residual energy, the degree and the layer number.Figure 2
Structure of the network in EERBLC.After sensor nodes are deployed, each node calculates its own layer number. The formula (5) shows the calculation method of layer number.
(5)Ln=ni_depthR+1Where Ln is layer number of nodeni, ni_depth is the depth of ni, R is the maximum communication rang of node.There are three steps in the cluster setup phase. The first step of this phase is information collection phase, whose duration is set as T1. At the beginning of this phase, each node broadcasts a N_HELLO message which includes node id, layer number, residual energy. Once receiving the N_HELLO message, each node records the message of neighbors at the same layer. The message from nodes at other layers is dropped. The format of the N_HELLO packet is shown in Table1.Table 1
Format of N_HELLO packet.
Type of packet
Node id
Layer number
Residual energyThe second step is the cluster head competition phase, which starts when T1 expires. In this phase, the sensor node whose waiting time Tc expires becomes cluster head, and broadcasts a competition message N_COM. The competition message N_COM maintains node id, layer number, residual energy and degree. Degree is the number of neighbors. The format of the N_COM packet is shown in Table2.Table 2
Format of N_COM packet.
Type of packet
Node id
Layer number
Residual energy
DegreeIf the node Si received N_COM message from other nodes in the same layer before Tc expires, node Si drops competition and becomes an ordinary node. Tc is different for each node, which is calculated as following formula (6).
(6)Tc=1−residualenergyinitialenergy∗T2+PWhere T2 is the duration of the competition,P is the random value in [0.5, 1], which is used to avoid the communication conflict when residual energy of nodes is the same. It can be seen from formula (6) that the nodes with higher residual energy have shorter waiting time and have a greater chance to be cluster head. Once the waiting time Tc of a node expires, it is selected as candidate cluster head and broadcasts N_COM message within competition communication rang.In order to balance energy of whole network, unequal clusters are formed in different layers. The nodes closer to the surface have heavier forwarding load. Hence, the cluster size is smaller in the layer which is closer to surface. In order to generate unequal clusters, these nodes need to calculate their own competition radius Rc. The formula (7) shows the computing method of Rc.
(7)Rc=βenergycenergyinit∗αLnLtn∗RWhereLn is the layer number of node, Ltn is total layer number of whole network, energyc is current residual energy, α and β is weighted value. It is shown from formula (7) that nodes with bigger layer number have lager competition radius. And the nodes with more energy have lager competition radius at the same layer.If a node Sj receives a N_COM message from node Si before its waiting time Tc expires, it adds the Si to its candidate cluster head list and becomes a non-cluster head node. If the node receives many N_COM messages from several cluster heads, it requires to select a cluster head from its candidate cluster head list. To optimize the selection method of cluster head, we design a multi-objective optimization technique to calculate the cost value for each candidate. The cost value is calculated as formula (8).
(8)costi=γenergyres_ienergyinit+θdegree_iN,γ+θ=1Whereenergyres_i is the residual energy of candidate Si, degree_i is the number of neighbors of candidate Si, N is the total number of all nodes. γ and θ are the parameters which are used to adjust the weight of energy and degree. The node with maximum cost value will be selected as cluster head by node Sj. If there are several cluster head nodes with the maximum value, the first node with maximum value in the list is selected as its cluster head. After selection of cluster head, node Sj replies a N_JOIN message to the selected head node. N_JOIN maintains id of head node, id of Sj, residual energy. The head node adds Sj to its member list. The format of the N_JOIN packet is shown in Table 3.Table 3
Format of N_JOIN packet.
Type of packet
Head node id
Member id
Residual energyThe procedure of cluster formation is shown as algorithm1.Algorithm 1: Cluster formation algorithm.
1:Procedure cluster formation
2:for each node Ni
3: calculate the layer number LN
4: Ni < − LN
5:end for
6:for each node Ni
7: broadcast N_HELLO
8:end for
9:for each node Ni received N_HELLO packet
10:if node’s LN in received packet = Ni’s LN
11: record message of neighbors
12:else drop the packet
13:end if
14:end for
15:for each node Ni
16:if LN ≠ 1
17: Ni calculate Tc
18:end if
19:end for
20:for each node Ni
21:while Tc does not expire
22:end while
23:if did not receive N_COM packet
24: calculate competition radius Rc
25: broadcast N_COM packet within Rc
26:else CH(Sj) < -N_COM packet
26:end if
27:end for
28:for each node received N_COM packet
29: calculate cost (i) value
30: send the N_JOIN packet
31:end for
32:for each head node
33: record the member nodes
34:end for
35:end procedure


## 3.4.2. Transmission Routing Algorithm

After cluster formation phase, each cluster head assigns a TDMA schedule to each member of its cluster. Each member node transmits its data at its allocated time slot. The cluster head aggregates and forwards the data to the sink nodes. If the node resides at the highest layer which number is 1, the data are transmitted to the sink nodes directly. In other case, the data are forwarded by cluster heads through multi-hop path.Each cluster head records the information of head id, residual energy and forwarding ratio when it hears data packets from other heads at its upper layer which layer number is one less than its layer number. Cluster head only selects the nodes at upper layer as next forwarder. Considering the energy efficient and delivery ratio, the selection of next hop is based on residual energy and forwarding ratio. The cost value of selection is computed as following formula (9).
(9)H_costi=μenergyres_Hienergyinit+εfr,μ+ε=1Whereenergyres_Hi is the residual energy of head node Si, fr is the forwarding ratio of Si, μ and ε are the weight coefficient.Cluster head calculates cost value of each cluster head according to the information recorded. For improving deliver ratio, two head nodes with the biggest value are selected as next forwarder. Cluster heads forward data packet including data number, source id, head id, next hop id1, next hop id2, data, residual energy and forwarding ratio. The format of data packet is shown as Table4.Table 4
Format of data packet.
Type of packet
Data number
Source node id
Head id
Next hop id1
Next hop id2
Data
Residual energy
Forwarding ratioEach data packet from the same node has a unique number. The source node id and data number represent a unique data packet in whole network. The head id represents the head node of forwarding this data packet. The next hop id1 and next hop id2 represent the next forwarder nodes which cost value is the two largest among the all neighbor head nodes at upper layer. The cost value of next hop id1 is larger than next hop id2. Residual energy is the current energy of head node of forwarding data. Forwarding ratio is the delivery ratio of forwarding head node.If a cluster head receives no messages from other head nodes at upper layer, it will send the data to neighbor heads at same layer. The head nodes received data packet will compare its id to next hop id1 and next hop id2. If node’s id is next hop id1 and the data packet is not recorded, it will forward the data packet immediately. Otherwise, if node’s id is next hop id2 and data packet is not recorded, it will forward the data packet after waiting for a certain time. During the waiting time, the forwarder will drop the data packet if it receives the same data packet. The forwarding node records 10 data packet forwarded recently. If node’s id is neither next hop id1 nor next hop id2, the data packet will be dropped. The procedure of next forwarder selection is shown as algorithm2.Algorithm 2: Next forwarder selection algorithm.
1:Procedure forwarder selection
2:for each head node Hi
3:for each head Hj ∈neihgbors ∩ Hi’s LN-1 = Hj’s LN
4: calculate H_cost(j)
5:end for
6: select two nodes as forwarders with two largest H_cost
7: send N_DATA packet to forwarder
8:end for
9:for each node Ni received data packet
10:if next hop id1 in received packet = Ni’s id
11:if the data packet ∉ records
12:  record data packet
13:  forward data packet
14:else drop the data packet
15:end if
16:else if next hop id2 in received packet = Ni’s id
17:if the data packet ∉ records
18:  record data packet
19:  waiting for a certain time
20:if not receive the same packet
21:  forward data packet
22:else drop the data packet
23:end if
24:else drop the data packet
25:end if
26:else drop the data packet
27:end if
28:end for


## 3.4.3. Maintenance and Update Method of Clusters

The structure of underwater wireless sensor network is dynamic. The nodes move randomly with water current. Therefore, the structure of clusters may change at any time. A recovery mechanism is proposed in this paper.For member nodes, when the member node fails to send the data to its cluster head, that means it has moved out of its cluster. In this case, it will monitor data packets from cluster heads. Once hearing a data packet of cluster head, it will join this cluster according to the information in data packet.Each cluster head calculates the average energy of the its cluster. When its energy is lower than average energy, cluster is reformed in this layer and routing information is updated.For the whole network, at each round of data collection, sink nodes expect the delivery ratio of next round. Once the delivery ratio is less than 70% of expected, the sink nodes will broadcast reformation message to the nodes. The underwater sensor nodes will rebuild the clusters.


## 4. Simulations and Discussions

In this section, the performance of EERBLC is evaluated and compared with DBR and EEDBR. The simulations are implemented using MATLAB 7.0. The same number of nodes are used in all simulations for fair comparison of EERBLC, DBR and EEDBR. 400 sensor nodes are deployed in a 500 m x 500 m x 500 m 3-D area. Initial energy of each sensor node is 5 joules. Power consumption of node in sending and receiving of data is 2 W and 0.1 W, respectively. Transmission range of each sensor node is 100 m. In the simulations of EERBLC, depth of each layer is defined at 80 m, and 80 nodes are randomly deployed in each layer. All nodes move with water currents from 2-3 m/sec in the horizontal directions. Two buoys are deployed at the surface and used as sinks in order to collect the data packets from the sensor nodes. Every sensor node can hold 10 data packets in its buffer. Size of a data packet is 200 bytes, size of N_HELLO message is 5 bytes, size of N_COM message is 6 bytes, size of N_JOIN message is 5 bytes. Frequency of the carrier acoustic signal is 10 kHz. Simulation parameters are given in Table5. The final simulation results are taken as an average of 5 different results.Table 5
Parameters of simulations.
Parameters
Values
Monitoring area
500 m x 500 m x 500 m
Number of nodes
400
Initial energy of nodes
5 joule
Data packet size
200
Communication rang
100 m
Number of sink nodes
2
α, β, γ, θ, μ, ε
1, 1, 0.7, 0.3, 0.6, 0.4In this work, the performance of protocols is evaluated in terms of stability period, network lifetime, throughput, delivery ratio, energy consumption and end-to-end delay. Stability period is defined as the duration till the first node dies in the whole network. For evaluating the performance of stability, the comparison simulations of DBR, EEDBR and EERBLC are implemented. All parameters of simulations are shown as Table5. The final simulation results are shown in Figure 3, which are taken as an average of 5 different results. In the DBR protocol, the first nodes died at 50s approximately. In the EEDBR and EERBLC protocol, the first nodes both died at 100 s approximately. In the DBR, a large number of redundant data packets are generated, and residual energy of node is not considered. That leads to premature death of nodes. In the EEDBR and EERBLC, energy is a major consideration factor during the forwarding data. Especially, EERBLC uses clustering technology to reduce the number of forwarding data. Hence, the time of first dead node is later than DBR.Figure 3
Comparison of stability period.Network lifetime is defined as the duration till the all nodes die in the whole network. Figure4 demonstrates the network lifetime of three protocols in random topologies. The simulation results show that lifetime of DBR, EEDBR and EERBLC are about 1600s, 1800s and 2000s, respectively. Due to the redundant data and retransmitting, the lifetime of DBR is shortest in three protocols. In EEDBR, problems of energy and redundant data are improved to some extent, so its lifetime is longer than DBR. Clustering technology used in EERBLC saves the energy. And energy balance is taken into account during the routing. So, EERBLC has the longest lifetime among the three protocols.Figure 4
Comparison of network lifetime.Throughput is defined as the number of data packets successful received at sink nodes. Figure5 shows the throughput simulation results of three protocols. The results show that DBR receives about 95,000 packets, EEDBR receives about 86,000 packets, and EERBLC receives about 70,000 packets during 2000s. DBR receives most packets due to large number of redundant data. EEDBR reduces the number of redundant data to some extent, so throughput of EEDBR is less than DBR. In EERBLC, because cluster heads aggregate data, the number of data packets is reduced significantly. Hence the throughput of EBECRP is less than DBR and EEDBR.Figure 5
Comparison of throughput.Delivery ratio is defined as the ratio of the number of packets successfully received at the sink nodes to the number of packets transmitted from the source nodes. The comparison simulations are implemented to evaluate the performance of delivery ratio in DBR, EEDBR and EERBLC. The results are shown in Figure6. Delivery ratio of DBR, EEDBR and EERBLC are 92%, 89% and 96%, respectively. The delivery ratio of DBR is higher than EEDBR, because DBR makes packets transmitted redundantly where multiple paths are followed to reach the sink node. For avoiding redundant data, EEDBR reduces the forwarding nodes. That leads to decline of delivery ratio of EEDBR. The data are aggregated effectively in EERBLC, and forwarding ratio is considered during the selection of forwarding node. That leads to more data packets received by sink nodes in EERBLC. So, EERBLC has the highest delivery ratio among the three protocols.Figure 6
Comparison of delivery ratio.Figure 7
Comparison of energy consumption.Energy consumption is the indicator to the network performance, and it reflects the status of network lifetime implicitly. Lower consumption energy causes longer lifetime of network. Figure 7shows the simulation results of energy consumption. The energy consumption of DBR is higher than the other two protocols due to overmuch forwarding nodes and redundant packets’ transmissions. EEDBR selects forwarder based on the depth and the residual energy. It avoids the number of forwarding nodes. Moreover, in EEDBR, due to the priority assignment technique, repeat transmissions of the same data packets are reduced significantly. Hence, energy consumption of EEDBR is less than DBR. EERBLC uses the clustering technology to balance load of the whole network which results in balanced energy consumption and longer lifetime. In the network initial phase, clusters formation needs to consume more energy, therefore, the residual energy of EERBLC is less than EEDBR at first 300 s. However, the energy consumption is less than other two protocols after initial phase.End-to-end delay is defined as the average time which data packets are received by sink nodes from source nodes. DBR, EEDBR and EERBLC are compared by simulations. The results are shown in Figure8. Because a certain holding time is needed before forwarding, DBR has the longest end-to-end delay in the three protocols. Priority mechanism is adopted during the forwarding in EEDBR. The forwarder with highest priority transmits the packet immediately. Therefore, the delay is reduced. The data are aggregated effectively in EERBLC, so the reduction of data packets reduces the propagation time. Furthermore, link quality is considered during the selection of forwarding node, retransmissions are restricted effectively. So, EERBLC has the least end-to-end delay among the three protocols.Figure 8
Comparison of end-to-end delay.From the above simulation results, we can see that EERBLC has the longest network lifetime, highest delivery ratio and least end-to-end delay with the lowest energy consumption in the three protocols. It proves that EERBLC is an effective routing protocol for UWSNs.


## 5. Conclusions

It is hard to replace the batteries of underwater sensor nodes, therefor, energy efficiency is one of research hotspots in underwater wireless sensor networks. In this paper, a localization-free routing protocol, named energy efficient routing protocol based on layers and clusters (EERBLC) is proposed. This protocol aims to solve problems of high energy consumption, long end-to-end delay and high error rate. In this protocol, underwater monitoring area is layered, and then the sensor nodes are clustered at each layer. EERBLC includes three phases: cluster formation, transmission routing, maintenance and update of clusters. In the cluster formation phase, a new unequal cluster method suitable for UWSNs is proposed to solve “hotspot” problem. And, EERBLC improves the cluster head selection algorithm. A multi-objective optimization technique is introduced to calculate the cost value for each candidate head. In the transmission routing phase, EERBLC utilizes the forwarding ratio and the residual energy of sensor nodes as routing metrics. Finally, Intra and inter cluster updating method is presented. Through simulations, the EERBLC protocol is compared to DBR and EEDBR routing protocols in UWSNs. The results prove that EERBLC can effectively improve the performance in terms of network lifetime, energy consumption, delivery ratio, throughput and end-to-end delay.



---

*Source: 5835730-2018-12-16.xml*