2016 IEEE 30th International Conference on Advanced Information Networking and Applications

Clustering depth based routing for underwater

wireless sensor networks
Tanveer Khan1 , Israr Ahmad1 , Waqas Aman1 , Irfan Azam1 ,
Zahoor Ali Khan2,3 , Umar Qasim4 , Sanam Avais5 , Nadeem Javaid1, *

1
COMSATS Institute of Information Technology, Islamabad, 44000, Pakistan
2
Faculty of Engg., Dalhousie University, Halifax, NS B3J 4R2, Canada
3
CIS Higher Colleges of Technology, Fujairah 4114, United Arab Emirates
4
Cameron Library, University of Alberta, Edmonton, AB, T6G 2J8 Canada
5
National University of Modern Languages, Islamabad, 44000, Pakistan
∗
Corresponding author: www.njavaid.com, nadeemjavaidqau@gmail.com

Abstract—Large propagation delay, high error rate, low band-
width and limited energy in Underwater Sensor Networks
(UWSNs) attract the attention of most researchers. In UWSNs,
efficient utilization of energy is one of the major issue, as the
replacement of energy sources in such environment is very
expensive. In this paper, we have proposed a Cluster Depth
Based Routing (cDBR) that is based on existing Depth Based
Routing (DBR) protocol. In DBR, routing is based on the depth
of the sensor nodes: the nodes having less depth are used as a
forward nodes and consumes more energy as compared to the
rest of nodes. As a result, nodes nearer to sink dies first because
of more load. In cDBR, cluster based approach is used. In order
to minimize the energy consumption, load among all the nodes
are distributed equally. The energy consumption of each node
is equally utilized as each node has equal probability to be
selected as a Cluster Head (CH). This improves the stability
period of network from DBR. In cDBR Cluster Heads (CHs)
are used for forwarding packets that maximizes throughput
of the network. We have compared our results with DBR and
Energy Efficient DBR (EEDBR). The simulation result validates
that cDBR achieves better stability period and high throughput
comparatively to DBR and EEDBR.
Index Terms—Cluster, Under Water,Sensor, Energy, Efficiency,
Depth, Routing, Cluster Head
I. I NTRODUCTION
Oceans comprise two third part of the earth. It has
got much importance in research perspective from the
past few years. UWSNs are used in water for different
applications such as monitoring different areas for security
surveillance, monitoring pollution and sensing specific
area for resources,such as oil extraction etc.
In UWSNs, acoustic signal is usually preferred over radio
signal. The performance of radio signal in water is poor as
compared to acoustic signals. However the use of acoustic
signals in UWSNs imposes few challenges. In general,
acoustic signals have limited bandwidth because of high
absorption factor and attenuation. Similarly, propagation
delay of acoustic signals is longer than radio signals.[4]
In UWSNs, maximizing network lifetime is important as
replacement of batteries in such environment is very
expensive. The routing protocols have an important
role in designing network model. In UWSNs, routing
protocol plays an important role for efficient flow of
data from source to destination. In UWSNs, design of
efficient routing protocol is a challenging task because
of harsh environment, noises, pollution, temperature etc.
The design of efficient routing protocol in UWSNs takes
different parameters into account. To maximize network
lifetime, routing protocol must take into account efficient
utilization of energy. During transmitting a packet the
consumption of energy is more than receiving a packet.
A node can transmit a packet directly to the base station
(BS) or adopt multi-hop transmission. Similarly a node
consumes more energy when transmitting a packet at
longer distance. A routing protocol is efficient if it reduces
number of transmissions and also divide load of work
equally among all the nodes.
In this work, we have designed a routing protocol that
uses cluster based approach. In cluster based approach
all nodes first compete for election to be a CHs. Then
selection of CHs occurs for optimal number of CHs
formation. The selection of CHs occurs on the basis of
distance. We have used the concept of clustering in our
routing protocol to increase the stability period of the
network. Nodes are deployed randomly in a particular
area. They start broadcasting their status with each other .
For the formation of CHs first election procedure occurs in
which eligible candidate set are made on basis of random
number (Rnd).For each node Rnd is generated. If this
Rnd is greater than threshold value (Th), then the node is
considered to be a normal node else the node elected is
a CH. Similarly if distance among elected CHs is greater
than 20 meter it is selected as a CHs else considered to be
a normal node. Adaptive association of normal nodes with
these CHs are carried out which results in the formation of
balanced clusters. The nodes start transmission with their
respective CHs. No back propagation increases network life

1550-445X/16 $31.00 © 2016 IEEE 506

DOI 10.1109/AINA.2016.168
time and local communication lowers energy consumption.
The rest of paper is organized as: section II provide
related work, motivation is provided in section III, in section
IV we discuss our proposed scheme, in V results and
discussion is provided in detail, the Performance trade off
is discussed in VI and last section is concluded with future
work and conclusion.
II. R ELATED W ORK
In this section routing protocol related to WSNs are
reviewed. Routing protocol of WSNs are categorized as
terrestrial WSNs and UWSNs.
Terrestrial WSN are further categorized as homogeneous
and heterogeneous WSNs. In homogeneous same energy
level while in heterogeneous different energy levels are
assigned to nodes. Further on basis of operation, nodes
are categorized as proactive in which network transmit
periodically and reactive in which network respond
immediately.
Away cluster heads with adaptive clustering (AC H )2
scheme was presented for terrestrial WSNs. First of all
in this scheme [1] nodes are classified as CH nodes,
non-cluster head nodes (node) and BS. Nodes and CHs
can forward packet to nodes, CHs and BS when they
are in its communication range. In (AC H )2 decision of
nodes to be elected for CHs are carried out on the basis
of Rnd and residual energy of CHs. If Rnd generated by
node is less then Th value it is elected for CH and if
the residual energy of this CH is less than the residual
energy of node it is considered to be a normal node.
For the selection of optimal number of CHs first order
radio model is used. CHs are classified as normal nodes,
if distance between CHs are less than 10m or having
strong response from its neighbor CHs. A free association
mechanism was introduced in which nodes can forward
packet to nodes having strong response. High throughput,
minimizing energy consumption of networks and removes
back transmission is the beauty of this program.
Low-energy adaptive clustering hierarchy (LEACH) [2] is
a WSNs using cluster based approach. The idea is to use
randomized location of CH to increase the stability period
of network by distributing energy load on nodes in the
network. The initial phase is advertisement phase in which
each node decide whether to be a CH or not and decision
of nodes is based on formation of Rnd (0 and 1). The
Rnd is compared with Th given in equation (1). In next
cluster setup phase, each node inform its CH node that
it has joined for the membership of this cluster. Then in
scheduling criteria phase, CH inform all its members when
to transmit packet, by using time division multiple access
(TDMA). In last data transmission phase, CHs receives
information from each node in a cluster, form a composite
signal and transmit it to the BS. The first three pahses are
set up phases and last phase is steady state operation in
507
LEACH.
 p
1−p(mod (r,1/p)) , i f ‘i  ∈ G
T h(i ) = (1)
0, otherwise
r is the current round, G set of nodes selected as CHs, p
is the probability of node to be a CH in next rounds, and
mod is used for the remainder of r and 1/p.
To improve network lifetime in WSN and energy
balanced routing algorithm (EBRA) is proposed in paper
[3]. The routing algorithm proposed is based on virtual
MIMO scheme. The following shortcomings of LEACH
protocol have been improved.
• For election each node has the same probability to
be elected for CH. The nodes having more energy
consumption and less energy die quickly. To overcome
this, most recent energy consumption of nodes and re-
maining energy of entire network is taken into account.
• The CHs that are elected to transmit data to sink
is on random basis. The selected CH may not be a
suitable candidate to transmit data. to over come this
short coming a cooperative node is selected after the
formation of CHs.
• The energy consumption model of LEACH is simplified,
so a comprehensive energy consumption model is
proposed.
Similarly in UWSNs for efficient utilization of energy a large
number of protocols have been presented.
UWSNs have dynamic topology and most protocol assumed
the location information of sensor nodes in prior knowledge
by localization process.Boyu Diao et al [4] introduces time
of arrival (ToA) ranging technique in depth based routing
(DBR) to reduce data forwarding and end to end delay.
ToA provides distance between nodes for finding optimal
path. In this paper the authors’ proposed two protocols
i.e. energy efficient depth based routing (EE-DBR) and
directional depth based routing (D-DBR). EE-DBR focuses
on reduction of multipath redundancy forwarding of data
and D-DBR after identification of optimal path can direct
packets to their sink.
Balance Transmission Mechanism (BTM) in Underwater
Acoustic Sensor Networks is proposed in paper [5]. BTM
tackle challenges like high path loss, low bandwidth and
high energy consumption in UWSN’s. This protocol has two
main phases;
• Route setup phase
In Routing setup phase sender sends query packets
including information about its location and UW-Sink.
All nodes after receiving query calculates distance
between sender node (si) and receiver node (sj)
and distance between UW-Sink and sj. After this
calculation one sensor node has been selected as a
relay node towards UW-Sink which best approaches
 TABLE I
S URVEY ON S TATE OF THE A RT R OUTING P ROTOCOL

Protocol Domain Parameters Technique Working Results Flaws

Increase Stability
Node density Clustering
Period, Maximize
(AC H )2 WSN Initial Energy Clustering Free Association
Network Lifetime
Transmission Delay
of Nodes Mechanism
Throughput
Increase Stability
Node Density Clustering CHs not in Optimium
Period, Network
LEACH WSN Initial Energy Clustering Free Association Numbers, Clusters are
Lifetime
of Nodes Mechanism of Different Sizes
Throughput
Effective in Reducing
Energy of Energy consumption, Throughput
EBRA WSNs MIMO Clustering
Entire Network Prolonging Network Compromised
Lifetime
Formation of Cooperative Increase Network
Depth
DEADS UWSN Co-operative Collector and Reliability, and Processing Overhead
Residual Energy
Dominating Set Nodes Network Efficiency
Efficient Coordination
Increase Throughput Long Propagation
CT-MAC UWSN Statistical Information Co-operative Scheme, MIMO
and Energy Efficiency Delay
Method is Used
Increase Throughput
Efficient Coordination Long Propagation
COBRA UWSN Statistical Information Co-operative of Network, Improve
Scheme Delay
Delivery Ratio
Mobile Courier Nodes,
Depth, Residual Energy, Transmission loss
AMCTD UWSN Multihop Variation in Depth Increase Stability Period
Network Lifetime increases
Threshold
Network Density Throughput of
Mobile Courier Nodes Maximize Network Lifetime
Link Status Network is
iAMCTD UWSN Multi-hop Mobile Sink Minimize End-to-End Packet
Residual Energy Compromised, Reduce
Receiver Based Approach Delay, Minimize Data Loss
Depth Transmission Loss
Minimize Energy Collision Occurs,
EE-DBR, Average energy Optimal path
UWSN Time of Arrival Consumption, Delivery Redundant Data
D-DBR and delay determination
Ratios, End-to-End Latency transmit
Path Loss, Less Energy Less Average Alive
Multi Hop, Optimum transmission
BTM UWSN Bandwidth, Dissipation, Improve Nodes Due to
Single Hop distance
Energy Consumption Network Life Time Multi Hopping
Selection of Global and
Transmission Range Routing Overhead
CBC UWSN Chain Based Local Optimal Path for Improve Network Lifetime
Network Lifetime is High
Transmission of Data
Use of AUVs Minimize Energy
AURP UWSN Number of AUVs Multihope Heterogeneous Commu- Consumption, Maximize Transmission Loss
nication Channels Data Delivery Ratio
Decrease Energy
Time Lag and Energy
Co-operative, Co-operative Routing Consumption, Improve
Co-UWSN UWSN Depth Comsumption, More
Multihop Relay Selection Network Lifetime, Improve
Forwarding Nodes
End-to-End Dely
Calculate Ht
Delay Decrease in Network
UWSn Depth Multihop USE Power Minimal End-to-End Delay
Sensitive Throughput
Factor Formulae
Increases Sensor Nodes
Multiple Input Cable Channels Costs of Single
MMSL UWSN Depth Coverage, Performs Better
Single Output are Used Node Increases
in Data Communication
Hop Count Increases Network Does not Differentiate
E-CARP UWSN Reusability of Sensory Data PING-PONG Location Free Lifetime,Decrease Priority of Different
Principle Communication Cost, Attributes
Stability Period
Signal to Noise Relay Nodes Sele-
Co-operative Extends, Throughput More Forwarding Nodes,
SPARCO UWSN Ratio, Path ction,Single and Multi
Routing Increase, Improve Energy Consumption
Selection Hop Communication
End-to-End Delay
Calculate Link
Depth,Node Maximum Level of
Expiration Time,
LETA UWSN Forwarding Novel technique Network Lifetime, Throughput Decreases
Routing Table
Probability End-to-End Delivery
Formation
Forwarding Set
Expected End-to-End
Good Put, Determination and Higher Good Put, Instable Network
UWOR UWSN Latency Metric
Energy Cost Packets Forwarding Low Energy Consumption Life Time
EEL|SUCCESS (Fi)
Priorities
Increases Packets
Routing table
Packets Delivery Delivery Ratio,
Adaptive Feed- Route selection maintenance at nodes
LAFR UWSN Ratio, End-to- Minimized End-to-
back mechanism and maintenance level, packets
End Delay End Delay, Low
exchange overhead
Energy Consumption

optimal transmission distance. • First is weighting update phase which is used to

• Stable data transmission phase
In Data transmission phase it depends on distance
between sensor node and UW-Sink whether it sends
data direct to UW-Sink or through relay node.
In UWSNs main problems are constant variation in
network topology, high probability of error, and during
transmission more energy consumption. In order to
overcome major confronts in UWSNs, an Adaptive Mobility
of Courier Nodes in Threshold-Optimized DBR protocol
is presented in paper [6]. The scheme of this protocol is
divided into three phases.
decrease load on low depth nodes.
• Variation in depth threshold occurs in second phase
to manage sparse condition of the network.
• The mobility of courier nodes is adaptive
Improved adaptive mobility of courier nodes in threshold-
optimized DBR protocol (iAMCTD) was presented by
Nadeem et al in paper [7]. This protocol is based on
forwarding function. Three types of forwarding function
are defined on the basis of depth. Upper region having
least depth takes signal to noise ratio into account to
minimize transmission loss. In medium region for load

508
balancing of forwarding nodes, energy cost function grants
nodes residual energy. In last region depth dependent
function is formulate to accomplish minimum flooding
and distant forwarding. In iAMCTD sensor nodes flood
data to neighbors and the courier nodes at their sojourn
tour collect data. In the absence of courier nodes data are
forward to neighbors. Each node broadcast residual energy,
depth information among themselves and report network
density to sink. In this way sink formulate variation in
depth threshold (dth) and mobility pattern of courier
nodes.
In [8] a cooperative routing protocol with mobile sink has
presented to improve the reliability of network and efficient
utilization of network energy. In depth and energy aware
dominating set algorithm (DEADS), network is divided into
four regions and in each region high, medium and low
vertices are defined. Destination nodes belongs to high,
relay nodes to medium and source node to low vertices.
In DEADS dth is varied on the basis of alive neighbor nodes.

∀i ∈ V : d t hi (t ) ∝ N i (t ) (2)
N(i) is alive neighbors of node i. On the basis of depth it
categorize its neighbor as eligible cooperative collector (CC)
and dominating set (DS) nodes and perform cooperative
routing. Similarly all CC and non CC forward their data to
non-DS and non-DS forward their data to mobile sink by
using the procedure defined in paper [8].
Similarly Co-UWSN is a cooperative routing protocol for
UWSNs proposed in [9]. It is an energy efficient and reliable
routing protocoland is used to achieve high throughput.
Co-UWSN improves signal to noise ratio which increases
data rate, saves transmit power and extend communication
range.
Coordinated transmission MAC (CT-MAC) is a distributed
MAC protocol presented in paper [10]. To address the
challenges of low bandwidth (BW) in under water acoustic
network they used multiple-input multiple-output (MIMO)
technique based on network uplink communication. In CT-
MAC, flooding is avoided by using efficient coordination
scheme for channel competition among neighbors. In
under water acoustic communication the challenges of
collision among long control packets and long propagation
delay is also addressed by this coordination scheme. MIMO
MAC approaches such as random access and handshaking
improved the throughput and energy efficiency of this
protocol.
Relay selection scheme is not very efficient in underwater
acoustic cooperative networks. The main reason is complex
acoustic channels and long propagation delay. A relay
selection criterion, cooperative based relay assessment
(COBRA) is propose which minimizes one-way packet
transmission time. The throughput of the network has
improved by taking into account long propagation delay
and spectral efficiency of complex acoustic channels.
Instead of taking instantaneous channel state the relay
509
selection algorithm of [11] takes statistical information into
account.
Stochastic Performance Analysis with Reliability and
Co-operation (SPARCO) is a co-operative routing protocol
proposed for UWSNs.To improve packet delivery ratio ,
network lifetime and to reduce energy consumption of
network in sparse condition, the concept of co-operation
and signal to noise ratio is introduced in paper [12]. Relay
nodes are used in co-operative routing to achieve reliability.
The selection of relay nodes are on the basis of distance
among neighbouring nodes and instantaneous path
condition. Similarly single and multi hop communication
features are taken into account to improve network stability
and lower the path loss.
In paper [13] a chain based communication (CBC)
scheme in cylindrical UWSNs is designed for application
oriented networks. In this protocol three schemes are
presented.In first routing scheme, a routing protocol
based on four-chains is proposed which uses divide and
conquerer approach. The chains are interconnected and
used to achieve best possible results for transmission
of data. Similarly in second routing scheme, network is
divided into two-chains on the basis of θ. The chains are
interconnected and used to select global optimal path.
The last one is single-chain based routing scheme. In this
scheme each node connects to its nearest neighbor and
hence identify local best possible path.
In order to minimize energy consumption and to maximizes
data delivery ratio of UWSNs , Autonomous underwater
Vehicle aided routing protocol(AURP) is proposed in [14].In
this protocol multiple AUVs are used for minimizing total
data transmission. AUVs collects data from sensor node
and forward it to the sink. AURP uses heterogeneous
communication channels.
Delay-Sensitive EEDBR(DSEEDBR), Delay-Sensitive
DBR(DSDBR), and Delay-Sensitive AMCTD(DSAMCTD)
is proposed in paper [15] for time-critical applications.
DSDBR uses greedy approach and routing is on the basis
of dth and holding time (Ht). The routing in DSEEDBR
and DSAMCTD is also performed by calculating Ht and
variation in dth.
Multi-Module Separated Linear (MMSL) node is proposed
in paper [16] for UWSNs. MMSL uses MIMO technique
and the aim is to reduced influence of current on sensor
node and also to increased communication control ability.
MMSL consists of
• Header which consists of transmitter, receiver, process
and sensor module.
• Multi-receiving sensor objects.
Channel-Aware Routing Protocol (CARP) is an UWSNs
routing protocol uses PING-PONG strategy. It is proposed
to achieve multi-hoping packet forwarding and location
free routing. It does not take into account reusability of
previously collected data. To addresses this issue Energy-
Efficient CARP (E-CARP) is proposed in paper [17] which is selected are not optimum in number and also there is
an enhanced version of CARP. E-CARP is less expensive in variation in cluster. Clusters of small size consume more
energy consumption and packet forwarding. energy then large size which directly effect the stability
In paper [18] Link Expiration Time-Aware (LETA) routing period of network. The back propagation in such routing
protocol is proposed for UWSNs. Link Expiration Time protocols consumes extra energy as a result the network
(LET) is calculated to handled mobility of nodes. LETA lifetime steps down. Above mentioned drawbacks motivate
routing protocol is divided into three phases: us to design a new efficient routing protocol.
• Selection of forwarding node phase in which sender
broadcast route request message to discover forward- IV. P ROPOSED S CHEME : C DBR
ing nodes.
• Routing table formation phase in which sending nodes
We present our scheme in the following subsections.
keeps forwarding node probability in routing table. 1) Network architecture: We have deployed nodes
Forwarding node having highest probability is at the having one static sink at the top. The network region is 500
top of the table and so on. meter in x, y and z directions. We have three types of nodes
• Target node selection phase in which forwarding node
with highest probability and equivalent to LET of • CH node
forwarding time is selected. The forwarding node is • Normal node
selected , if LET is greater then packets reaching and • Dead node
acknowledgement receiving time.
Nodes having energy (E i ) equal to zero is considered to
Delay-Sensitive Opportunistic Routing for Underwater be dead nodes. Each node generates a Rnd having value
Sensor Networks (UWOR) is proposed in [19]. It employs between zero and one. If Rnd is greater then Th value
the idea of opportunistic-based routing to enhance and distance among elected CHs is greater then optimal
good put and minimize end to end latency to meet the distance (20) meter, these nodes are CHs nodes. The nodes
requirement of delay-sensitive UWSN’s applications. This having Rnd value less then Th and distance less then 20
protocol introduce a new metric named as End-to-End meter are normal nodes.
Latency EEL|SUCCESS (Fi). It is the expected end to end
delay from node i to the respective destination. This paper
emphasizes per node forwarding set determination and Algorithm 1 Cluster Formation Algorithm
packet forwarding prioritization. Upon receiving packet, 1: procedure E LECTION AND S ELECTION OF C LUSTER H EAD
node computes forwarding set and assign relay priorities 2: N←Normal Nodes
which is governed by above metric. 3: A←Number of Alive Nodes
Zhang et al explores symmetric and asymmetric links 4: CHE←Cluster Head Elected
caused by beam width and three dimensional direction 5: CHS←Cluster Head Selected
of UWSNs. Link-state Based Adaptive Feedback Routing 6: Rnd←Random Number
(LAFR) routing protocol is proposed in 20. LAFR takes 7: TH←Threshold Value
into account link state information determine by detection 8: Dist←Distance among Elected Cluster Heads
mechanism and suggests an adaptive feedback mechanism 9: for each node i ∈ A do
to fulfill desired routing information. Time-based Priority 10: generate Rnd
Forwarding mechanism and usage of downstream node 11: if Rnd < T h then
table information are proposed in this protocol to prevent 12: if Ei ≥ E av g then
flooding and save energy. Credit based dynamic mechanism 13: i = CHE
is proposed to determine best route (routing optimization) 14: else
and maintenance. 15: i=N
16: end if
III. MOTIVATION 17: end if
18: end for
In UWSN the main focus of researchers is on efficient
19: for j ∈ C H E do
utilization of node energy, reliable transmission of packets
20: if Di st ≥ 20met er then
and stability period of network. As in DBR forwarding of
21: CHE ← CHS
packet takes place on the basis of depth. Nodes having least
22: else
depth and nearer to sink die first, decreasing the stability
23: CHE← N
period of the network. The sensor node broadcast the
24: end if
packets, so nodes having more depth also receive packets
25: end for
and thus energy is consumed for no good use. Similarly
26: end procedure
different number of routing protocols are proposed that
uses cluster based approach. In these protocols, the CHs

510
 








 
   

'
 


 

 '  



!"

 ()*  %'"

'
 
+( 
'
  
#$ #$



'
' 

%
&
#$   
' (  ""

'

#$  #    (

Fig. 1. Flow Chart of cDBR

2) Sink deployment: In our proposed scheme cDBR we
have one static sink deployed at the top. Sink is consisted
of two types of modem
• Acoustic modem is used for communication with sen-
sor nodes.
• Radio frequency modem is used for communication
with BS.
The sink collects data from nodes and from CHs then
forward it to the BS.
3) Nodes deployment: The deployment of sensor nodes
is on random basis and have limited energy. Sensor nodes
are equipped with acoustic modem. It is used for com-
munication with CHs and sink. Each node has a certain
transmission range. During transmission node consumes
more energy than during receiving. Nodes having least
depth and in the transmission range of sink forward data
to the sink directly. Similarly efficient utilization of node
energy is important for stability of network. Each sensor
node broadcast Hello packet with its neighbours to ex-
change status information. The information contain node
ID, depth, residual energy, Co-ordinates of other nodes and
sink.
4) CH election and selection: To increase the stability
period of a network we have to efficiently and equally
utilized the energy consumption of sensor node. For this
purpose the sensor nodes first compete for the election of
CHs. The election of CHs are carried out on the basis of:
• Rnd generation: Each node generate a Rnd number. If
Rnd is greater then Th value it is marked as normal
node.
If Rnd generated by node is less then or equal to Th
value and not become a CH for last 1/P rounds then
the node is elected as a CH.
• Average residual energy of network: The residual energy
of CH Elected (CHE) is compared with the average

511
 





 


 





  





 
 
 

Fig. 2. CH Election and Selection

residual energy of single sensor node in the network. Algorithm 2 Free Association Algorithm
If residual energy of CHE is smaller then average, it is 1: procedure A SSOCIATION -M ECHANISM
eliminated from the candidate set for selection of CH 2: N←Number of Nodes
otherwise sensor nodes are elected as a CHs. 3: M←Mid Point between Node and Sink
4: d N −Si nk ← Distance from Node to Sink
After the election, selection of CHs are carried out on the 5: dC H −Si nk ← Distance from CH to Sink
basis of distance. The CHs are selected if the distance 6: for each node n ∈ N do
among elected CHs are greater then 20 meter. The election 7: if d N −Si nk ≤ dC H −Si nk then
and selection procedure is after each round so that each 8: Associate Node = Sink
node has equal probability to be selected as a CH. The 9: Calculate = M
CHs having sink in its transmission range forward packet 10: if Signal Strength at M = Strong then
towards it and if sink is far away, packets are forward to 11: Associate = CH1
another CH having sink in its transmission range as shown 12: else
in fig 1. 13: Associate = CH2
14: end if
5) Data Forwarding:: In fig 2 nodes nearest to sink just
15: end if
as ‘a’ forward data to sink directly. In order to remove
16: end for
back transmission sensor node ‘a’ does not forward data
17: end procedure
to CH ‘A’. As a result the energy of sensor node is efficiently
utilized. The rest of nodes like node ‘b’ sent data to there
respective CHs. In the given fig 2 node ‘b’ forwards data
to there respective CH and it cannot forward data to the V. S IMULATION R ESULTS AND D ISCUSSION
CH ‘G’ of another cluster. CHs ‘A’ and ‘C’ have sink in We evaluated the performance of our proposed
their transmission range. They can forward data to the sink protocol with DBR and EEDBR. We deploy 200 static
directly. All the remaining CHs forward data to ‘A’ and ‘C’ nodes randomly. The nodes have limited energy and
as sink is not in their transmission range. The depth of consumes energy during performing the following
‘E’ is less then that of ‘F’, so no packet forwarding in this activities, transmission, receiving and aggregation.
direction. The ‘C’ is not in the transmission range of ‘H’.
The CH ‘H’ sent data to ‘I’ which then forward data to ‘C’ For performance purpose we take into account five
as given in fig 2. The forwarding of packet towards sink is metrics:
on the basis of depth. CHs having least depth is selected • Number of packets sent
as a forwarder. As CHs are used to to sent packet to sink. • Number of packets dropped

512
  







 
 
  

Fig. 3. Data Forwarding

TABLE II 4
S IMULATION PARAMETERS x 10
9
CDBR
DBR
Parameters Values 8
EEDBR
Number of Nodes Two Hundred
7
Number of Sink 1
Number of Packets to BS

Area 500m x 500m 6

Transmission Range 100m
Number of Rounds 700 5

Depth Threshold 40m

4
Sensor Node Transmission range 100meter
3

• Number of dead nodes
• Residual energy
• Number of alive nodes
1) Number of Packets Send to BS: Number of packets sent
to sink means packet received at the sink. In figure 3, up to
700 rounds, the number of packets received at sink in DBR
is less than cDBR. cDBR are using clusters for forwarding
packets that are more reliable then nodes packet delivery. In
case of EEDBR packet delivery to sink is less as compared
to that of cDBR and DBR. The main reason is that EEDBR
takes into account residual energy of each node during
forwarding packet. In EEDBR when multi-hoping among
nodes increases it results more overhead. The transmission
of packet to sink is less reliable, so the packet reaches to
sink decreases. The main reason for more packet send in
DBR is more packets are forward which results in more
consumption of nodes energy, and the nodes die earlier in
DBR as compared to rest of protocols. The plot for number
of packets sent to BS is shown in figure:3
2) Number of Packets Dropped: In comparison to
DBR and EEDBR the packets dropped in cDBR is less
as compared to DBR and almost same to EEDBR. It
is due to reliable transmission of CHs. As there is no
2
1
0
0 100 200 300 400 500 600 700
Number 0f Rounds
Fig. 4. Packets Reached to Sink
back transmission in cDBR due to which less number of
packets are sent and less packets dropped are occured
. The packets dropped in DBR is more because nodes
are use for forwarding packets whose reliability is less as
compared to the reliability of CH. In cDBR, CHs are use
for forwarding packets and thus the packet delivery to
sink is more reliable. The plot is shown in the given figure:4
3) Number of Dead Nodes: In cDBR the number of dead
nodes is less than DBR and EEDBR. The reason is in each
round in cDBR, the nodea have different probability to be
a CH. The energy consumption of nodes is same due to
random selection of CHs nodes which also increase the
stability period of the network. In EEDBR and DBR there
is no random selection of forwarding nodes and burden
is more on one node as compared to the rest of nodes.
The result is node die earlier as compared to other nodes

513
 4 2000
x 10
8 CDBR
CDBR DBR
1800
DBR EEDBR
7
EEDBR
1600
6
1400

residual energy
5
1200
packet drop

4 1000

3 800

2 600

400
1

200
0 0 100 200 300 400 500 600 700
0 100 200 300 400 500 600 700 Number 0f Rounds
Number 0f Rounds

Fig. 7. Residual Energy of Networks

Fig. 5. Packets Dropped

200
CDBR
150
CDBR DBR
DBR EEDBR
EEDBR

Number of Alive Nodes

150
100
dead nodes

100
50

50
0 100 200 300 400 500 600 700
0
0 100 200 300 400 500 600 700 Number 0f Rounds
Number 0f Rounds

Fig. 8. Number of Alive Nodes

Fig. 6. Number of Dead Nodes

also increases. The number of alive nodes for DBR, EEDBR

in the network which also decrease the stability period of
and cDBR are shown in figure 7:
network as shown in fgiure 5:

4) Residual Energy: The residual energy of cDBR, DBR VI. P ERFORMANCE T RADE O FFS R OUTING P ROTOCOLS MAKE
and EEDBR is almost same. However our network still FOR N ETWORK P ERFORMANCE
compete and show good results as compared to the DBR
cDBR is cluster based approach. It is designed for
and EEDBR. cDBR takes into account the stability period
achieving high stability period of a network. To improve
of network and also increases network lifetime. After each
one performance parameter the other parameter must be
round in cDBR election and selection procedure is carried
degraded. There is a trade off between the parameters.
out, that result in consumption of nodes energy. In figure
In cDBR we have achieved high stability period but have
6, it is shown that cDBR consumes same amount of energy
compromised on the network life time. Similarly we have
as compared to DBR and EEDBR. The plot is given in
achieved high throughput, more packets are received at the
figure:6
BS and this is achieved at the cost of processing overhead.

5) Number of alive nodes: As in the given figure 7, the

stability period of cDBR is more as compared to that of
DBR and EEDBR. In cDBR each node is eligible to be a
CH and probability for selection of CH for each node is
different at different rounds. The energy consumption of
each node is same due to which stability period of network
VII. C ONCLUSION AND F UTURE WORK
In this paper we have proposed cDBR routing protocol
for UWSN. In cDBR the routing metrics are depth, residual
energy and Rnd number generation of the nodes. As in DBR,

514

P ERFORMANCE T RADE OFFS
Protocol Used Technique
DBR Depth Based Approach
Residual Energy,
EEDBR
Depth Based Approach
cDBR Clustering
cDBR also does not require full dimensional location infor-
mation of nodes. It takes into account depth and residual
energy of nodes. In cDBR we have deployed only one static
sink at the top. We have taken the concept of clustering
from (AC H )2 . The election and selection criteria of the
nodes to be a CH has explained in our proposed scheme.
The nodes forward data to selected CHs which further
forward data to sink. When sink is in the transmission
range of the nodes it forwards data to sink directly without
the involvement of CHs. With the formation of clusters
the overall network energy of network is efficiently and
equally utilized. The simulation results that we have plot
in MATLAB show that the stability period of our proposed
protocol have improved from DBR and EEDBR.
To further improve the energy efficiency and throughput of
our protocol we have planed in future to deploy multiple
sink and the concept of cooperative routing in our protocol.
For improving the throughput we have to deployed a mobile
courier nodes and have to defined regions for CHs. Where
mobile courier nodes collect data from CHs in specified
region and forward it to the sink.
R EFERENCES
[1] A. Ahmad, N. Javaid, Z. A. Khan, U. Qasim, and T. A. Alghamdi,
“(AC H )2 : Routing Scheme to Maximize Lifetime and Throughput of
Wireless Sensor Networks,” in IEEE Sensors Journal vol. 14, no. 10, pp.
3516–3532, 2014.
[2] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-
Efficient Communication Protocol for Wireless Microsensor Networks,”
in Pro. the 33rd Annual Hawaii International Conference on System
Sciences vol. 00, no. c, pp. 1–10, 2000.
[3] J. Li, X. Jiang, and I. Lu, “Energy Balance Routing Algorithm Based on
Virtual MIMO Scheme for Wireless Sensor Networks,” vol. 2014, 2014.
[4] B. Diao, Y. Xu, Z. An, F. Wang, and C. Li, “Improving Both Energy
and Time Efficiency of Depth-Based Routing for Underwater Sensor
Networks,” in Int. J. Distrib. Sens. Networks vol. 2015, 2015.
[5] J. Cao, J. Dou, and S. Dong, “Balance Transmission Mechanism in Un-
derwater Acoustic Sensor Networks,” in Int. J. Distrib. Sens. Networks,
vol. 2015, pp. 1–12, 2015.
[6] Jafri, M.R.; Ahmed, S.; Javaid, N.; Ahmad, Z.; Qureshi, R.J., "AMCTD:
Adaptive Mobility of Courier Nodes in Threshold-Optimized DBR
Protocol for Underwater Wireless Sensor Networks," Broadband and
Wireless Computing, Communication and Applications (BWCCA), 2013
Eighth International Conference on , vol., no., pp.93,99, 28-30 Oct.
2013. doi: 10.1109/BWCCA.2013.24.
[7] N. Javaid, M. R. Jafri, Z. A. Khan, U. Qasim, T. A. Alghamdi, M. Ali,
"iAMCTD: improved Adaptive Mobility of Courier Nodes in Threshold-
Optimized DBR Protocol for Underwater Wireless Sensor Networks",
International Journal of Distributed Sensor Networks, vol. 2014, Article
ID 213012, 12 pages, 2014. doi:10.1155/2014/213012.
TABLE III
Parameters Achieved Cost to Pay
Nodes Near to
Throughput is Maximized
Sink Die Earlier
Stability Period
Efficient Utilization
and Network
of Energy,
Lifetime Decreases
Reliable Transmission Processing Overhead,
of Packets, Stability Whole Network
Period is Achieved Die Earlier
[8] Umar, Amara; Javaid, Nadeem; Ahmad, Ashfaq; Khan, Zahoor A.;
Qasim, Umar; Alrajeh, Nabil; Hayat, Amir. 2015. "DEADS: Depth
and Energy Aware Dominating Set Based Algorithm for Cooperative
Routing along with Sink Mobility in Underwater WSNs." Sensors 15,
no. 6: 14458-14486.
[9] S. Ahmed, N. Javaid, F. A. Khan, M. Y. Durrani, A. Ali, A. Shaukat,
M. M. Sandhu, Z. A. Khan, and U. Qasim. "Co-UWSN: Cooperative
Energy-Efficient Protocol for Underwater WSNs." International Journal
of Distributed Sensor Networks, Volume 2015 (2015), Article ID 891410,
16 pages http://dx.doi.org/10.1155/2015/891410.
[10] Y. Luo, L. Pu, Z. Peng, Z. Zhou, and J.-H. Cui, “CT-MAC:a MAC
protocol for underwater MIMO based network uplink communica-
tions,” in Proceedings of the Seventh ACM International Conference on
Underwater Networks and Systems - WUWNet , p. 1-12, 2012.
[11] Y. Luo, L. Pu, Z. Peng, Z. Zhou, J.-H. Cui, and Z. Zhang, “Effective
Relay Selection for Underwater Cooperative Acoustic Networks,” in
2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor
Systems, pp. 104–112, 2013.
[12] S. Ahmed, N. Javaid, A. Ahmed, I. Ahmed, M. Y. Durrani, A. Ali, S.
B. Haider, and M. Ilahi, “SPARCO: Stochastic Performance Analysis
with Reliability and COoperation for Underwater Wireless Sensor
Networks,” in Journal of Sensors., pp. 1–38, 2015.
[13] Javaid, Nadeem; Jafri, Mohsin R.; Khan, Zahoor A.; Alrajeh, Nabil;
Imran, Muhammad; Vasilakos, Athanasios. 2015. "Chain-Based Com-
munication in Cylindrical Underwater Wireless Sensor Networks."
Sensors 15, no. 2: 3625-3649. doi:10.3390/s150203625.
[14] S. Yoon, A. K. Azad, H. Oh, and S. Kim, “AURP: an AUV-aided under-
water routing protocol for underwater acoustic sensor networks.,” in
Sensors (Basel)., vol. 12, no. 2, pp. 1827–45, 2012.
[15] N. Javaid, M. R. Jafri, S. Ahmed, M. Jamil, Z. A. Khan, U. Qasim,
S. S. Al-Saleh, "Delay-Sensitive Routing Schemes for Underwater
Acoustic Sensor Networks", International Journal of Distributed Sen-
sor Networks, Volume 2015 (2015), Article ID 532676, 13 pages,
http://dx.doi.org/10.1155/2015/532676.
[16] H. Chen, X. Wu, G. Liu, and Y. Wang, “A Novel Multi-Module Separated
Linear UWSNs Sensor Node,” in IEEE Sens. J., vol. 11, no. 4, pp. 1–1,
2015.
[17] Z. Zhou, B. Yao, R. Xing, L. Shu, and S. Bu, “E-CARP: An Energy
Efficient Routing Protocol for UWSNs in the Internet of Underwater
Things,” in IEEE Sens. J., vol. X, no. X, pp. 1–1, 2015.
[18] A. Uddin, “Link Expiration Time-Aware Routing Protocol for UWSNs,”
in Journal of Sensors., vol. 2013, 2013.
[19] C. Hsu, H. Liu, J. Luis, G. Gómez, and C. Chou, “Delay-Sensitive
Opportunistic Routing for Underwater Sensor Networks,” in IEEE
Sensors Journal vol. 15, no. 11, pp. 6584–6591, 2015.
[20] S. Zhang, D. Li, and J. Chen, “A Link-State Based Adaptive Feedback
Routing for Under Water Acoustic Sensor Networks,” in IEEE Sensors
Journal vol. 13, no. 11, pp. 4402–4412, 2013.
515