# Delay-Sensitive Routing Schemes for Underwater Acoustic Sensor Networks

Authors: N. Javaid; M. R. Jafri; S. Ahmed; M. Jamil; Z. A. Khan; U. Qasim; S. S. Al-Saleh
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

Underwater Acoustic Sensor Networks (UASNs) offer their practicable applications in seismic monitoring, sea mine detection, and disaster prevention. In these networks, fundamental difference between operational methodologies of routing schemes arises due to the requirement of time-critical applications; therefore, there is a need for the design of delay-sensitive techniques. In this paper, Delay-Sensitive Depth-Based Routing (DSDBR), Delay-Sensitive Energy Efficient Depth-Based Routing (DSEEDBR), and Delay-Sensitive Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (DSAMCTD) protocols are proposed to empower the depth-based routing schemes. The performance of the proposed schemes is validated in UASNs. All of the three schemes formulate delay-efficient Priority Factors (PF) and Delay-Sensitive Holding time (DSHT) to minimize end-to-end delay with a small decrease in network throughput. These schemes also employ an optimal weight function (WF) for the computation of transmission loss and speed of received signal. Furthermore, solution for delay lies in efficient data forwarding, minimal relative transmissions in low-depth region, and better forwarder selection. Simulations are performed to assess the proposed protocols and the results indicate that the three schemes largely minimize end-to-end delay along with improving the transmission loss of network.


---

## Body

## 1. Introduction

From the very beginning, oceans are essential way of transportation, military actions, and distributed tactical surveillance. For all these applications, Underwater Acoustic Sensor Networks (UASNs) employ sensor nodes to detect physical attributes such as temperature and pressure. There are vast applications of UASNs such as assisted navigation, ocean sampling, mine reconnaissance, and pollution monitoring, which demand time-critical and delay-sensitive routing protocols. These applications surpass the requirements of energy-efficient and delay-tolerant routing designs. Therefore, there is a need of delay-sensitive routing protocols in UASNs, which forward the sensed data towards the Base Station (BS) with a minimal time lag. There is also a requirement of routing protocols in large-scale distributed networks to tackle the high propagation delays in localization-free environment as the underwater activities encompass hundreds to thousands of kilometers. There are two major categories of underwater routing protocols: (i) localization-free and (ii) localization-based routing protocols. Localization-free routing protocols do not require location information of sensor nodes for data forwarding; however, localization-based protocols route data towards the BS on the basis of location information of the sensor nodes.In localization-free protocols, sensor nodes conventionally depend on their depth information to forward data efficiently, as it considers continuous movement of sensor nodes in aqueous environment. Akyildiz et al. in [1] investigate several aspects of underwater routing and its challenges and categorize their issues according to network protocol stack. They also discuss open research issues in 2-dimensional and 3-dimensional UASNs.In this paper, we have proposed improved delay-sensitive versions of DBR, EEDBR, and AMCTD to make them adaptable for time-critical applications. This work is an extension of [2]. These new schemes are verified and validated through simulations in the UASNs. We have applied delay and channel loss models in depth-based routing protocols of DBR, EEDBR, and AMCTD to examine their effects in delay-sensitive routing. The main concern is to minimize huge propagation delays along with maintaining other parameters such as network lifetime and number of transmissions. We prefer localization-free routing protocols as sensor nodes move with a speed of 2-3 knots and it is difficult to identify their location information. It is important to examine the deficiencies of these flooding-based protocols as they depict the practical acoustic conditions.


## 2. Related Work

Extensive research has been done on UASN routing protocols in recent years due to their worth applications. Their primary requirement is adaptability with the delay-tolerant and delay-sensitive applications. Furthermore, the drawback of any specific method is viewed as an advantage to its contrasting scheme.Depth-Based Routing (DBR) [3] proposes flooding based approach in which sensor nodes forward data solely on the basis of their depth information. It is one of the best localization-free routing schemes of UASN which utilizes acoustic signals to tackle error-prone underwater conditions. EEDBR [4] enhances the network lifetime and improves path loss by computing holding time (HT) on the bases of residual energy of sensor nodes. AMCTD [5] encourages the deployment of courier nodes and devises efficient weight functions (WF) to increase the stability period of the network. It also provides a paradigm to minimize noise and other attenuation losses for sensor nodes positioned in a low-depth region of UASN.Wahid and Dongkyun [6] investigate UASN routing schemes and classify them according to their priorities in UASN. Tolba et al. [7] propose Delay Tolerant network (DTN) routing protocol to tackle continuous node movements and utilize the single-hop and multihop routing. They also attempt to minimize collision overhead at the Medium Access Control (MAC) layer.Luo et al. [8] propose energy balancing strategies in an underwater moored monitoring system in order to deal with sparse conditions. They provide a mathematical model to investigate the power consumption of sensor nodes. These schemes provide higher stability period at the cost of higher delay or increased path loss. Furthermore, there are also some energy-efficient protocols in all types of UWSNs such as Round-Based clustering (RBC) [9] and Link-State Based routing (LSB) [10]. The main designing concern of these schemes is the minimization of energy consumption of the sensor nodes. These protocols propose different technical solutions for this purpose at physical, MAC, and routing layer. These schemes assume the water condition, according to the depth of the sender and receiver node, as there is a large difference between the parameters of shallow and deep water. At the MAC layer, the major problem is the large number of transmission collisions which can also be handled by the routing protocols. Chao and Lu [11] minimize the transmission collisions by proposing an efficient multichannel MAC layer protocol. Moreover, RBC minimizes the amount of redundant data transmission by utilizing cluster formation. In [12], the authors study the effects of frequency scaling over channel capacity. They achieve a high quality of signal by utilizing multihop communication in dense UASNs.In addition, to the above mentioned schemes, there are also some delay-sensitive protocols proposed for UWSN. Mobicast Routing Protocol (MRP) [13] suggests adaptive mobility of Autonomous Underwater Vehicle (AUV) to collect data with a minimum end-to-end delay. It applies “Appleslice” technique to solve the coverage hole problem with varying node density. Basagni et al. [14] minimize the packet latency and energy consumption of the sensor nodes by optimized packet size selection along with examining its effects on MAC layer protocols.Pompili and Melodia [15] suggest the paradigms for both delay-sensitive and delay-insensitive techniques in UWSN by formulating Integer Linear Programming models. Zhou et al. [16] suggest Multipath Power control Transmission (MPT) protocol to ensure a guaranteed end-to-end delay and minimum Bit Error Rate (BER) in challenging acoustic channels. It formulates optimal energy distribution models for unipath and multipath communication. In [17], the authors devise multisubpath routing to minimize propagation delays along with improving packet delivery ratio in UWSN.We have selected DBR, EEDBR, and AMCTD for the analysis because these are depth-based routing protocols. In this paper, the main focus is on the improvement of notable depth-based routing protocols in UWSNs. There is a large end-to-end delay in these protocols due to calculation of holding time and long transmission distance between sender and receiver node. Having minimized delay, these protocols perform well in the delay-sensitive applications of UWSNs. Moreover, EEDBR and AMCTD have high network throughput, whereas the major deficiency is high end-to-end delay which has been overcome by their delay-sensitive versions. DBR is the initial routing protocol in the category of depth-based routing and its major deficiency is also a high delay due to large nodal delay.We discuss the underwater channel model in Section3. Section 4 presents the problem statement of DBR, EEDBR, and AMCTD. Sections 5, 6, and 7 contain brief explanation of our proposed protocols DSDBR, DSEEDBR, and DSAMCTD, respectively. Simulation results are presented in Section 8 and, finally, Section 9 concludes the paper.


## 3. Underwater Channel Model

In this section, we analyze the effects of acoustic channel characteristics on the speed and end-to-end delay of the signal. We propose an analytical model to compute the propagation delay in data transmissions, as shown in Figure1. The propagation delay for acoustic signal is five times greater than the terrestrial radio signals due to multipath and fading effects and depends on the attenuation coefficient due to high BER in aqueous environment. The end-to-end delay between the sender and receiver is given by(1)TE-E=n+1Ttx+nTrx+Tpd,where Ttx and Trx are the transmission and receiving time consumed by a sensor node for a packet in seconds. n is the number of hops for a specific packet and TE-E is the end-to-end delay whereas Tpd is the overall propagation delay of packets between the source and BS expressed as(2)Tpd=Ts,is,b+∑i,j∈n‍Ti,js,b+Tj,bs,bn≥2∧i,j∈n,(3)Tpd=Ts,is,b+Ti,bs,bn=1∧i∈n,(4)Tpd=Ts,bs,bn=0.Equations (2), (3), and (4) show the computations of propagation delay for multihop, single-hop, and direct communication, respectively.Figure 1
Propagation delay in multihop communication.In (5), we compute the propagation delay Tp between any two nodes of the network. Propagation delay is the time consumed by the signal to cover the distance between sender and receiver node. We assume d as the Euclidean distance between the two nodes and q as the speed of received acoustic signal which depends upon different parameters such as depth difference between sender and receiver. Propagation delay between two nodes calculated in [15] is given as(5)Tp=dq,where d is the distance between the sender and receiver in m and q is the speed of signal in m/s which is calculated as follows [18]:(6)q=1449.05+45.7t-5.21t2+0.23t3+1.333-0.126t+0.009t2S-35+16.3z+0.18z2,t=T10.In the above equations, T is the temperature in °C, S is salinity in ppt, and z is the depth in km. Above discussed equations compute the overall delay of packets between the source nodes and BS, by considering signal speed with the depth of water.


### 3.1. Acoustic Attenuation Models

Underwater channel efficiency depends primarily on the attenuation coefficient for the inter-nodal distances. This coefficient is characterized by different factors such as depth of sensor nodes and distances between them. Furthermore, path loss increases with the increase in frequency of signal. We have thoroughly reviewed the attenuation losses in both Thorps [19] and Monterey-Miami Parabolic Equation (MMPE) [20] models. Thorps computes the total attenuation loss A(l,f) by the summation of absorption effects and the spreading loss, which can be expressed as(7)10log⁡⁡Al,f=k10log⁡⁡l+l10log⁡⁡αf.In (7), the first term refers to spreading loss and the second term denotes the absorption loss, which are measured in dBreμPa. The spreading coefficient k describes the geometry of the signal propagation (i.e., k=1 is cylindrical, k=2 is spherical, and k=1.5 is particle spreading [21]) and α(f) is bandwidth efficiency measured in dB/km. l is the distance between the sender and receiver in km and f is the frequency of signal in kHz.Research shows that the molecular movement of acoustic signal is highly affected by the random noise and wave motion, which can be detected by increasing the complexity of the improved models along with their enhanced accuracy. MMPE [22] model computes the Transmission Loss (TL) as(8)TL=mf,s,dA,dB+wt+en,where m(f,s,dA,dB) is the propagation loss due to haphazard and periodic constituents, incurred from the regression of MMPE data. f is the frequency of acoustic signal in kHz. dA is the depth of sender node A in m. dB is the depth of receiver node B in m. s is the Euclidean distance between node A and node B in m. w(t) is the periodic function to estimate signal loss due to wave movement. e(n) is the signal loss function caused by random noise error.Figures2 and 3 show the effect of TL on DBR and EEDBR as predicted by Thorps and MMPE models.Figure 2
Comparison of TL calculation in DBR by Thorps and MMPE models.Figure 3
Comparison of TL calculation in EEDBR by Thorps and MMPE models.


## 3.1. Acoustic Attenuation Models

Underwater channel efficiency depends primarily on the attenuation coefficient for the inter-nodal distances. This coefficient is characterized by different factors such as depth of sensor nodes and distances between them. Furthermore, path loss increases with the increase in frequency of signal. We have thoroughly reviewed the attenuation losses in both Thorps [19] and Monterey-Miami Parabolic Equation (MMPE) [20] models. Thorps computes the total attenuation loss A(l,f) by the summation of absorption effects and the spreading loss, which can be expressed as(7)10log⁡⁡Al,f=k10log⁡⁡l+l10log⁡⁡αf.In (7), the first term refers to spreading loss and the second term denotes the absorption loss, which are measured in dBreμPa. The spreading coefficient k describes the geometry of the signal propagation (i.e., k=1 is cylindrical, k=2 is spherical, and k=1.5 is particle spreading [21]) and α(f) is bandwidth efficiency measured in dB/km. l is the distance between the sender and receiver in km and f is the frequency of signal in kHz.Research shows that the molecular movement of acoustic signal is highly affected by the random noise and wave motion, which can be detected by increasing the complexity of the improved models along with their enhanced accuracy. MMPE [22] model computes the Transmission Loss (TL) as(8)TL=mf,s,dA,dB+wt+en,where m(f,s,dA,dB) is the propagation loss due to haphazard and periodic constituents, incurred from the regression of MMPE data. f is the frequency of acoustic signal in kHz. dA is the depth of sender node A in m. dB is the depth of receiver node B in m. s is the Euclidean distance between node A and node B in m. w(t) is the periodic function to estimate signal loss due to wave movement. e(n) is the signal loss function caused by random noise error.Figures2 and 3 show the effect of TL on DBR and EEDBR as predicted by Thorps and MMPE models.Figure 2
Comparison of TL calculation in DBR by Thorps and MMPE models.Figure 3
Comparison of TL calculation in EEDBR by Thorps and MMPE models.


## 4. Problem Statement

Depth-based routing protocols use natural characteristics of acoustic communication as they do not require localization information and completely depend upon the depth information of sensor nodes. There is high end-to-end delay in DBR, EEDBR, and AMCTD which is unsuitable for delay-sensitive routing applications. Therefore, in terms of high end-to-end delay, the following major observations were noticed in the above mentioned protocols.(i)
In DBR, there are distant transmissions between the sensor nodes specifically in the medium-depth region introducing large propagation delay.(ii)
In EEDBR, the delay conditions are improved than in DBR; however, there is lack of load balancing in the low-depth region due to multiple forwarding and number of transmissions of data packets.(iii)
Presence of courier nodes improves the throughput in AMCTD but, however, does not minimize end-to-end delay of network remarkably.In this paper, we propose improved delay-sensitive versions of DBR, EEDBR, and AMCTD to remove above-discussed deficiencies.


## 5. Delay-Sensitive DBR

Delay Sensitive Depth-Based Routing (DSDBR) is an improved version of DBR, which not only performs routing on the basis of depth information but also employs Holding Time (HT) and depth threshold (dth). Each sensor node transmits the sensed data within its transmission range as shown in Figure 4. The neighbor node, at a depth lower than the source node and located outside its dth limit, computes HT for received data packet. dth limit is given as(9)dth<dp-dc.dc and dp denote the depths of the current and previous node, respectively, during transfer of a packet. HT depends upon the weight function (WF) of the received data packet as discussed in next subsection. Figure 4 shows the mechanism of transmission in DSDBR. It shows that as the source node A transmits the packet, all the nodes in its transmission range receive the packet. These nodes compare the depth of A with their depth. The three neighbors in the figure having more depth than A discard the packet. Now, the other four neighbors check that whether their depth falls under the limit of depth threshold or not. In Figure 4, a single neighbor in depth threshold limit also discards the packet. The other three eligible neighbors compute the Forwarding value (Fi) and Weight function (WF) of the received packet using the parameters of received signal such as Transmission loss. By using WF, each eligible node computes the HT for the received packet. HT is the time duration to hold the packet in queue. We found out that one of the neighbors having a depth between the other two eligible neighbors has less HT than the other two nodes. It transmits the packet earlier than the other nodes. Other two nodes receive the packet during their HT and discard it due to overhearing process. The same process continues until the packet reaches the sink.Figure 4
Data Transmission in DSDBR.


### 5.1. Data Forwarding Phase

DSDBR works on the principle of greedy algorithm and nodes with a lower depth forward data towards BS. Each eligible neighbor computes Forwarding valueFi for the received packet as follows:(10)Fi=TLiqiη,where qi is the speed of the received data packet in m/s and (TL)i is the TL of the received data packet i in dB. η is a scaling factor for Fi which is assumed as 1000. Fi depends upon TL and q of received data packet which is used to find intermediate forwarder in transmission range. Furthermore, Fi is used to compute WF for received packet, which is expressed as(11)WF=α-Fi,where α is used as a constant and depends upon the network size. The value of α determines the difference between the Fi values of neighbors of the source node, which is further applied to calculate HT. Nodes having high Fi will have low WF as well as HT, which is computed as(12)HT=WFHTmax⁡vACTmin⁡.Using (12), each node calculates HT for received packet during which it keeps data packet in buffer. Tmin⁡ is the minimum TL between any two nodes in dB and vAC [23] is the speed of acoustic signal in m/s. HTmax⁡ is the maximum value of HT for any received packet.An optimal value ofHT is used to minimize multiple transmissions of same packets, as nodes overhearing the received packets from low-depth nodes will not transmit these packets. Thus, DSDBR aims to minimize end-to-end delay in DBR to make it adaptable to time-critical applications by improving HT computations criteria and WF formulation. However, there is a trade-off between end-to-end delay and throughput in the stability period. Figure 5 depicts the forwarding mechanism of DSDBR.Figure 5
Forwarding mechanism of DSDBR.


## 5.1. Data Forwarding Phase

DSDBR works on the principle of greedy algorithm and nodes with a lower depth forward data towards BS. Each eligible neighbor computes Forwarding valueFi for the received packet as follows:(10)Fi=TLiqiη,where qi is the speed of the received data packet in m/s and (TL)i is the TL of the received data packet i in dB. η is a scaling factor for Fi which is assumed as 1000. Fi depends upon TL and q of received data packet which is used to find intermediate forwarder in transmission range. Furthermore, Fi is used to compute WF for received packet, which is expressed as(11)WF=α-Fi,where α is used as a constant and depends upon the network size. The value of α determines the difference between the Fi values of neighbors of the source node, which is further applied to calculate HT. Nodes having high Fi will have low WF as well as HT, which is computed as(12)HT=WFHTmax⁡vACTmin⁡.Using (12), each node calculates HT for received packet during which it keeps data packet in buffer. Tmin⁡ is the minimum TL between any two nodes in dB and vAC [23] is the speed of acoustic signal in m/s. HTmax⁡ is the maximum value of HT for any received packet.An optimal value ofHT is used to minimize multiple transmissions of same packets, as nodes overhearing the received packets from low-depth nodes will not transmit these packets. Thus, DSDBR aims to minimize end-to-end delay in DBR to make it adaptable to time-critical applications by improving HT computations criteria and WF formulation. However, there is a trade-off between end-to-end delay and throughput in the stability period. Figure 5 depicts the forwarding mechanism of DSDBR.Figure 5
Forwarding mechanism of DSDBR.


## 6. Delay-Sensitive Energy-Efficient DBR

Delay-Sensitive Energy-Efficient DBR (DSEEDBR) provides enhanced network lifetime along with delay sensitivity to EEDBR by implementing Delay-Sensitive Holding time (DSHT) and adaptive variations in dth for sensor nodes. DSHT is heart of depth-based routing model as it removes the inadequacy of multiple retransmissions in EEDBR. Every receiving node, before forwarding the data packet, computes the TL and noise loss of the channel and depth difference in order to predict the time-lag of the packet to be forwarded. Figure 6 shows data transmission in DSEEDBR. Figure 6 shows the mechanism of transmission in DSEEDBR. It shows that all the nodes in the range of source node A receive the packet. The four neighbors having more depth than A discard the packet. Now, the other five neighbors compare their depth with the limit of depth threshold. A single neighbor falling in depth threshold limit discards the packet. The other three eligible neighbors compute the DSHT of the received packet using the parameters of received signal such as attenuation loss. We found out that one of the neighbors has less DSHT than the other three nodes. It transmits the packet earlier than the other nodes. The link between this node and source node A is termed active link. Other two nodes receive the packet during their DSHT and discard it due to overhearing process.Figure 6
Data transmission in DSEEDBR.


### 6.1. Variations indth

DSEEDBR exploits the inefficient approach of constantdth in the entire network which causes more delay in the low-depth region. Transmissions by sensor nodes in the low-depth region cause high propagation delays. These transmissions may reduce the load on medium-depth region nodes on the cost of high noise losses in the upper region. We compute these losses along with considering the residual energy of medium-depth nodes and apply variable dth for nodes according to their depth information. The sensor nodes deployed in low-depth and medium-depth regions have smaller dth values than the high-depth nodes; therefore, they will have increased number of neighbors avoiding distant transmissions. Algorithm 1 shows adaptive variations in dth for sensor nodes according to their depth information.Algorithm 1:Variations in Depth threshold in EEDSDBR.
D
1
← 1st limit for Depth
D
2
← 2nd limit for Depth
D
3
← 3rd limit for Depth
D
th
← Depth threshold for any node i
D
th1
← Depth threshold for low-depth nodes
D
th2
← Depth threshold for medium-depth nodes
D
th3
← Depth threshold for high-depth nodes
D
i
← Depth of Node i
if  Di≤D1  then
Dth=Dth1
else  {D2<Di≤D3}
Dth=Dth2
else
Dth=Dth3
end if


### 6.2.DSHT Estimation

DSEEDBR proposes faster data forwarding mechanism than EEDBR by estimatingDSHT for forwarding data packets. After receiving these packets, eligible forwarders consider attenuation loss AL [24] in computing DSHT. Since, our scheme is energy efficient (as it utilizes residual energy of the forwarder node), DSH is computed as (13)DSHT=ALDdRiLNvACEini,where AL denotes attenuation loss of received data packet in dB, Dd is the depth difference between sender and receiver node in m, and Ri is the residual energy of a receiver node in J. LN [25] is the combined noise loss due to shipping, wind, turbulence, and thermal activities in dB and Eini shows the initial energy of nodes in J. Nodes having low AL and Dd will have lesser DSHT than the other neighbours and will be selected as suitable forwarder.


## 6.1. Variations indth

DSEEDBR exploits the inefficient approach of constantdth in the entire network which causes more delay in the low-depth region. Transmissions by sensor nodes in the low-depth region cause high propagation delays. These transmissions may reduce the load on medium-depth region nodes on the cost of high noise losses in the upper region. We compute these losses along with considering the residual energy of medium-depth nodes and apply variable dth for nodes according to their depth information. The sensor nodes deployed in low-depth and medium-depth regions have smaller dth values than the high-depth nodes; therefore, they will have increased number of neighbors avoiding distant transmissions. Algorithm 1 shows adaptive variations in dth for sensor nodes according to their depth information.Algorithm 1:Variations in Depth threshold in EEDSDBR.
D
1
← 1st limit for Depth
D
2
← 2nd limit for Depth
D
3
← 3rd limit for Depth
D
th
← Depth threshold for any node i
D
th1
← Depth threshold for low-depth nodes
D
th2
← Depth threshold for medium-depth nodes
D
th3
← Depth threshold for high-depth nodes
D
i
← Depth of Node i
if  Di≤D1  then
Dth=Dth1
else  {D2<Di≤D3}
Dth=Dth2
else
Dth=Dth3
end if


## 6.2.DSHT Estimation

DSEEDBR proposes faster data forwarding mechanism than EEDBR by estimatingDSHT for forwarding data packets. After receiving these packets, eligible forwarders consider attenuation loss AL [24] in computing DSHT. Since, our scheme is energy efficient (as it utilizes residual energy of the forwarder node), DSH is computed as (13)DSHT=ALDdRiLNvACEini,where AL denotes attenuation loss of received data packet in dB, Dd is the depth difference between sender and receiver node in m, and Ri is the residual energy of a receiver node in J. LN [25] is the combined noise loss due to shipping, wind, turbulence, and thermal activities in dB and Eini shows the initial energy of nodes in J. Nodes having low AL and Dd will have lesser DSHT than the other neighbours and will be selected as suitable forwarder.


## 7. Delay Sensitive AMCTD

Delay-Sensitive AMCTD (DSAMCTD) employs variations indth with the changing depth of sensor nodes. In this scheme, courier nodes largely minimize the delay factor as sensor nodes adapt their priority of data forwarding according to the presence of courier nodes. Nodes apply different Priority Factor (PF) formulae for data forwarding with the help of which they compute their HT with varying network density. This parameter is based on the availability of neighbor nodes, depth information, and residual energy of source node. Our scheme prioritizes distant transmissions with decreasing network density to facilitate the quick movement of courier nodes.


### 7.1. System Model and Network Initialization

AMCTD formulates energy-efficientWF to forward data along with availability of courier nodes. We have utilized dth variations according to depth information of sensor nodes. Nodes with higher depth have more dth than the other nodes. This increases distant transmissions in high-depth regions and, however, reduces them in low-depth region. Flow diagram (Figure 7) depicts the variation of dth in DSAMCTD. In this figure, ε1 and ε2 represent the lower and upper limits for dth variations whereas Dth1, Dth2, and Dth3 represent the values for dth at varying depths in meters.Figure 7
Variations ofdth in DSAMCTD.


### 7.2. PF Formulation

DSAMCTD devises PFs for sensor nodes to manage delay-efficient data transmission. During initialization phase, each sensor node estimates the number of neighbors within its transmission range and finds itsHT on the basis of PF formulae. There are three different PF formulae designed to enhance availability of neighbors for selection of optimal data forwarders. These formulae are used for efficient data forwarding in the proposed scheme. Figure 8 shows the mechanism of data transmission in DSAMCTD. Nodes having high PF value will have shorter HT than the other nodes. Furthermore, nodes forward data using PFH in high network density, PFM in medium density, and PFL in last rounds of network, when the network density gets sufficiently low. Consider (14)PFH=HTmax⁡Ni×RiDmax⁡DiEini.PFH encourages high availability of neighbours and residual energy instead of depth information in forwarder selection. Consider(15)PFM=HTmax⁡(Dmax⁡-Di)NiEiniDiDmax⁡.During instability period, PFM manages data forwarding by considering depth as a decision factor in the network. Consider(16)PFL=HTmax⁡RiDiDmax⁡Eini.In extreme sparse situation, PFL monitors the network by selecting nodes with high residual energy as optimal forwarder. Figure 9 shows that if the number of dead nodes is less than α1, then the sensor nodes compute their HT for the received data packets using PFH. They utilize PFM between α1 and α2 for forwarder selection, and, in sparse conditions, PFL provides better performance for time-critical applications when the number of dead nodes is greater than α2. Figure 8 shows the mechanism of transmission in DSAMCTD. It shows that the four neighbors having more depth than A discard the packet after receiving packet. Now, a single neighbor in depth threshold limit also discards the packet. The other three eligible neighbors check out the number of alive nodes and network density by using the received information from the sink. If the network density is high, the three eligible nodes compute the PFH of the received packet using the parameters of received signal. By using PFH, these nodes compute the HT for the received packet. We found out that one of the neighbors has less HT than the other two nodes. It transmits the packet earlier than the other nodes. Other two nodes receive the packet during their HT and discard it due to overhearing process. If the network density is medium, the three eligible nodes compute the PFM of the received packet. By using PFM, these nodes compute HT for the received packet. Neighbor having less HT than the other two nodes transmits the packet earlier than the other nodes. If the network density is low, the three eligible nodes compute the PFL of the received packet. By using PFL, these nodes compute HT for the received packet. Neighbor having less HT than the other two nodes transmits the packet earlier than the other nodes. Therefore, there are three different data forwarders according to the network density.Figure 8
Data transmission in DSAMCTD.Figure 9
PF computation in DSAMCTD.


## 7.1. System Model and Network Initialization

AMCTD formulates energy-efficientWF to forward data along with availability of courier nodes. We have utilized dth variations according to depth information of sensor nodes. Nodes with higher depth have more dth than the other nodes. This increases distant transmissions in high-depth regions and, however, reduces them in low-depth region. Flow diagram (Figure 7) depicts the variation of dth in DSAMCTD. In this figure, ε1 and ε2 represent the lower and upper limits for dth variations whereas Dth1, Dth2, and Dth3 represent the values for dth at varying depths in meters.Figure 7
Variations ofdth in DSAMCTD.


## 7.2. PF Formulation

DSAMCTD devises PFs for sensor nodes to manage delay-efficient data transmission. During initialization phase, each sensor node estimates the number of neighbors within its transmission range and finds itsHT on the basis of PF formulae. There are three different PF formulae designed to enhance availability of neighbors for selection of optimal data forwarders. These formulae are used for efficient data forwarding in the proposed scheme. Figure 8 shows the mechanism of data transmission in DSAMCTD. Nodes having high PF value will have shorter HT than the other nodes. Furthermore, nodes forward data using PFH in high network density, PFM in medium density, and PFL in last rounds of network, when the network density gets sufficiently low. Consider (14)PFH=HTmax⁡Ni×RiDmax⁡DiEini.PFH encourages high availability of neighbours and residual energy instead of depth information in forwarder selection. Consider(15)PFM=HTmax⁡(Dmax⁡-Di)NiEiniDiDmax⁡.During instability period, PFM manages data forwarding by considering depth as a decision factor in the network. Consider(16)PFL=HTmax⁡RiDiDmax⁡Eini.In extreme sparse situation, PFL monitors the network by selecting nodes with high residual energy as optimal forwarder. Figure 9 shows that if the number of dead nodes is less than α1, then the sensor nodes compute their HT for the received data packets using PFH. They utilize PFM between α1 and α2 for forwarder selection, and, in sparse conditions, PFL provides better performance for time-critical applications when the number of dead nodes is greater than α2. Figure 8 shows the mechanism of transmission in DSAMCTD. It shows that the four neighbors having more depth than A discard the packet after receiving packet. Now, a single neighbor in depth threshold limit also discards the packet. The other three eligible neighbors check out the number of alive nodes and network density by using the received information from the sink. If the network density is high, the three eligible nodes compute the PFH of the received packet using the parameters of received signal. By using PFH, these nodes compute the HT for the received packet. We found out that one of the neighbors has less HT than the other two nodes. It transmits the packet earlier than the other nodes. Other two nodes receive the packet during their HT and discard it due to overhearing process. If the network density is medium, the three eligible nodes compute the PFM of the received packet. By using PFM, these nodes compute HT for the received packet. Neighbor having less HT than the other two nodes transmits the packet earlier than the other nodes. If the network density is low, the three eligible nodes compute the PFL of the received packet. By using PFL, these nodes compute HT for the received packet. Neighbor having less HT than the other two nodes transmits the packet earlier than the other nodes. Therefore, there are three different data forwarders according to the network density.Figure 8
Data transmission in DSAMCTD.Figure 9
PF computation in DSAMCTD.


## 8. Performance Evaluation and Analysis

In this section, we examine the performance of DSDBR, DSEEDBR, and DSAMCTD and analyze their simulated effects in realistic acoustic conditions. All the three proposed schemes improve the end-to-end delay in the routing protocols of DBR, EEDBR, and AMCTD by allowing small decrease in network throughput. Using these performance parameters, we estimate the TL specifically in the low-depth region in order to provide efficient data forwarding. Effects of combined noise caused by shipping, turbulence, and thermal activity have been calculated. Same simulation scenario and specifications are employed for all the proposed protocols.


### 8.1. Simulation Scenario

In all simulations, we have assumed a network dimension of500m×500m×500m with multiple sinks deployed on the surface of water, with a random deployment of 225 sensor nodes. Each sensor node has a transmission range of 100 meters. Following the convention of existing depth-based routing schemes, we used acoustic modem of LinkQuest UWM1000 [26] having a bit rate of 10 kbps. According to the specifications of modem, the power consumption in transmitting, receiving, and idle mode is 2 W, 0.1 W, and 10 mW, respectively. The size of data packet is 50 bytes, while that of control packet is 8 bytes. Moreover, we minimize collisions at MAC layer by implementing 802.11-DYNAV [27] protocol as a core MAC protocol. The initial energy of the sensor node is set as 20 joules.


### 8.2. Simulation Results and Analysis

This section is devoted for the performance evaluation, verification, validation, and comparison of our three proposed protocols with the conventional ones in Wireless Sensor Networks (particularly UASNs). In the following subsections, each enhanced scheme is compared with the existing one.


#### 8.2.1. Comparison of DBR and DSDBR

First of all, we compare DBR and DSDBR to analyze the functioning of our proposed scheme in terms of different performance parameters. The default transmission time and receiving time of data packet for all sensor nodes are 40 ms and those of control packets are 10 ms. We also assume that sensor nodes employ a frequency of 25 kHz for acoustic communication. In Figure10, we analyze the total energy consumption in DBR and DSDBR. DSDBR faces tradeoff between decreased end-to-end delay (Figure 12) and increased total energy consumption; however, it allows a small decrease in network throughput (Figure 11). In the earlier rounds of DBR, there is an increase in number of transmissions which increases the network throughput along with end-to-end delay. In DSDBR, the network attempts to remove distant transmissions by selecting optimal data forwarders on the basis of their received packet’s TL and q. Figure 11 depicts that, in DBR, a number of packets received by sink are higher than DSDBR. In the initial rounds, throughput of DSDBR is lower than that of DBR. In DBR, high throughput in the initial rounds reduces the number of available forwarding nodes during instability period. In later rounds of DBR, there is a quick average energy consumption of sensor nodes causing creation of energy holes in the network.Figure 10
Total energy consumption in DBR and DSDBR.Figure 11
Network throughput in DBR and DSDBR.Figure 12
End-to-end delay in DBR and DSDBR.Figure12 illustrates the average decrement in delay of our proposed scheme in comparison to DBR. After 5000 rounds, there is a major decrease in delay of DSDBR at the cost of small decrement in network density. However, in DBR, there is increase in end-to-end delay which is primarily due to high TLs for remaining distant nodes. Furthermore, end-to-end delay depends upon salinity, temperature, depth, and TL of an acoustic signal. Nodal delay is also important; however, propagation delay mainly affects total end-to-end delay. After 1000 rounds, during the instability period of DSDBR, throughput remains higher than that of DBR along with minimum energy consumption and lesser end-to-end delay as shown in Figures 9, 10, and 11. The key cause of reduced delay in DSDBR in later rounds is low network density and availability of suitable data forwarders. Therefore, DSDBR is 48% more efficient than DBR in terms of end-to-end delay by compromising on low throughput and less stability period. Figure 13 shows that DBR has larger delay than DSDBR with the change in number of nodes. As the number of nodes increases, the delay in DBR is increased largely due to large aggregated holding time. In DSDBR, there is not a large increase in delay with increase in number of nodes due to selection of data forwards at the intermediate depth difference from the sender.Figure 13
Comparison of DBR and DSDBR in terms of delay.


#### 8.2.2. Comparison of EEDBR and DSEEDBR

In Figure14, we compare TL of EEDBR and DSEEDBR. It illustrates that TL is higher in EEDBR than the proposed scheme, which is caused by a large number of transmissions and multiple retransmissions for same packets. In EEDBR, due to high network density in initial rounds, there is less transmission loss which increases dramatically with a decrease in the number of available forwarders in low-depth regions. Nevertheless, it delivers higher throughput than our proposed scheme due to increased stability period. DSEEDBR maintains low TL throughout the network lifetime by decreasing load on low-depth nodes; however, it compromises on network throughput in the initial rounds.Figure 14
Comparison of transmission loss (dB) in EEDBR and DSEEDBR.Figure15 depicts average end-to-end delay in EEDBR and DSEEDBR. It shows gradual decrease in delay of DSEEDBR along with changes in TL (Figure 16) of the network. It illustrates slower network activity in EEDBR which is not suitable for time-critical applications. After 2000 rounds, there is a sharp increase in delay of EEDBR due to quick energy consumption of nodes deployed in medium-depth region. DSEEDBR decreases end-to-end delay of the network by incrementing dth in high-depth area for forwarder selection considering low attenuation and noise losses in this region.Figure 15
End-to-end delay in EEDBR and DSEEDBR.Figure 16
Number of transmissions in EEDBR and DSEEDBR.Figure16 shows the comparison of number of transmissions in EEDBR and DSEEDBR. It also shows that, in spite of low throughput in stability period before 2000 rounds, there are a high number of transmissions in EEDBR which increase rapidly in the later rounds.Our proposed protocol minimizes delay by reducing the number of transmissions in the network. It compromises on network throughput to achieve lowTp. Global load balancing is achieved in DSEEDBR which results in an almost same number of transmissions throughout the entire lifetime. Simulations show that DSEEDBR is 68% more delay-efficient than EEDBR which is highly suitable for applications requiring high network lifetime and low network delay. Figure 17 shows that DSEEDBR has decreased end-to-end delay than EEDBR. It is due to the fact that speed of received signal defines the holding time. Neighbors having high depth difference but low Euclidean distance are selected as the data forwarder of the source node. It has less holding time than the other neighbors which causes decrease in delay. As the number of nodes is 225, there is a large improvement in delay condition in DSEEDBR due to efficient holding time computation.Figure 17
Comparison of EEDBR and DSEEDBR in terms of delay.


#### 8.2.3. Comparison of AMCTD and DSAMCTD

Figure18 shows the comparison of end-to-end delay between AMCTD and DSAMCTD. The delay in AMCTD is already less than that of DBR and EEDBR due to the involvement of courier nodes; however, there is a high variation in end-to-end delay of AMCTD which is removed in our proposed scheme by introducing WF. Sensor nodes having higher number of neighbors have a greater WF than the other nodes and they are selected as optimal data forwarders. This reduces distant transmissions towards BS and utilizes the courier nodes in the high-depth region of the network. DSAMCTD also maintains reasonable stability period by avoiding distant transmissions in the medium-depth region.Figure 18
End-to-End delay in AMCTD and DSAMCTD.Figure19 illustrates total energy consumption in the schemes of AMCTD and DSAMCTD. There is a continuous variation in results of AMCTD due to movement of courier nodes. Our scheme maintains energy consumption in entire lifetime by adaptive dths. It prioritizes depth information of sensor nodes to compute its WF.Figure 19
Total energy consumption in AMCTD and DSAMCTD.Figures18 and 20 clearly show the trade-off between the throughput and end-to-end delay of DSAMCTD. Moreover, AMCTD has much higher throughput in the stability period, however, high variation in energy consumption of sensor nodes. We employed the mobility of courier nodes to achieve minimal delay without increasing network throughput. However, higher network throughput is maintained in the later rounds. According to our computations, DSAMCTD is 56% more efficient than AMCTD in terms of end-to-end delay in the network. Figure 21 shows the comparison of delay in AMCTD and DSAMCTD with the change in number of nodes in the network. It also shows the improved performance of DSAMCTD. It shows the equally efficient performance of priority factors in high, medium, and low network density.Figure 20
Network throughput in AMCTD and DSAMCTD.Figure 21
Comparison of AMCTD and DSAMCTD in terms of delay.


## 8.1. Simulation Scenario

In all simulations, we have assumed a network dimension of500m×500m×500m with multiple sinks deployed on the surface of water, with a random deployment of 225 sensor nodes. Each sensor node has a transmission range of 100 meters. Following the convention of existing depth-based routing schemes, we used acoustic modem of LinkQuest UWM1000 [26] having a bit rate of 10 kbps. According to the specifications of modem, the power consumption in transmitting, receiving, and idle mode is 2 W, 0.1 W, and 10 mW, respectively. The size of data packet is 50 bytes, while that of control packet is 8 bytes. Moreover, we minimize collisions at MAC layer by implementing 802.11-DYNAV [27] protocol as a core MAC protocol. The initial energy of the sensor node is set as 20 joules.


## 8.2. Simulation Results and Analysis

This section is devoted for the performance evaluation, verification, validation, and comparison of our three proposed protocols with the conventional ones in Wireless Sensor Networks (particularly UASNs). In the following subsections, each enhanced scheme is compared with the existing one.


### 8.2.1. Comparison of DBR and DSDBR

First of all, we compare DBR and DSDBR to analyze the functioning of our proposed scheme in terms of different performance parameters. The default transmission time and receiving time of data packet for all sensor nodes are 40 ms and those of control packets are 10 ms. We also assume that sensor nodes employ a frequency of 25 kHz for acoustic communication. In Figure10, we analyze the total energy consumption in DBR and DSDBR. DSDBR faces tradeoff between decreased end-to-end delay (Figure 12) and increased total energy consumption; however, it allows a small decrease in network throughput (Figure 11). In the earlier rounds of DBR, there is an increase in number of transmissions which increases the network throughput along with end-to-end delay. In DSDBR, the network attempts to remove distant transmissions by selecting optimal data forwarders on the basis of their received packet’s TL and q. Figure 11 depicts that, in DBR, a number of packets received by sink are higher than DSDBR. In the initial rounds, throughput of DSDBR is lower than that of DBR. In DBR, high throughput in the initial rounds reduces the number of available forwarding nodes during instability period. In later rounds of DBR, there is a quick average energy consumption of sensor nodes causing creation of energy holes in the network.Figure 10
Total energy consumption in DBR and DSDBR.Figure 11
Network throughput in DBR and DSDBR.Figure 12
End-to-end delay in DBR and DSDBR.Figure12 illustrates the average decrement in delay of our proposed scheme in comparison to DBR. After 5000 rounds, there is a major decrease in delay of DSDBR at the cost of small decrement in network density. However, in DBR, there is increase in end-to-end delay which is primarily due to high TLs for remaining distant nodes. Furthermore, end-to-end delay depends upon salinity, temperature, depth, and TL of an acoustic signal. Nodal delay is also important; however, propagation delay mainly affects total end-to-end delay. After 1000 rounds, during the instability period of DSDBR, throughput remains higher than that of DBR along with minimum energy consumption and lesser end-to-end delay as shown in Figures 9, 10, and 11. The key cause of reduced delay in DSDBR in later rounds is low network density and availability of suitable data forwarders. Therefore, DSDBR is 48% more efficient than DBR in terms of end-to-end delay by compromising on low throughput and less stability period. Figure 13 shows that DBR has larger delay than DSDBR with the change in number of nodes. As the number of nodes increases, the delay in DBR is increased largely due to large aggregated holding time. In DSDBR, there is not a large increase in delay with increase in number of nodes due to selection of data forwards at the intermediate depth difference from the sender.Figure 13
Comparison of DBR and DSDBR in terms of delay.


### 8.2.2. Comparison of EEDBR and DSEEDBR

In Figure14, we compare TL of EEDBR and DSEEDBR. It illustrates that TL is higher in EEDBR than the proposed scheme, which is caused by a large number of transmissions and multiple retransmissions for same packets. In EEDBR, due to high network density in initial rounds, there is less transmission loss which increases dramatically with a decrease in the number of available forwarders in low-depth regions. Nevertheless, it delivers higher throughput than our proposed scheme due to increased stability period. DSEEDBR maintains low TL throughout the network lifetime by decreasing load on low-depth nodes; however, it compromises on network throughput in the initial rounds.Figure 14
Comparison of transmission loss (dB) in EEDBR and DSEEDBR.Figure15 depicts average end-to-end delay in EEDBR and DSEEDBR. It shows gradual decrease in delay of DSEEDBR along with changes in TL (Figure 16) of the network. It illustrates slower network activity in EEDBR which is not suitable for time-critical applications. After 2000 rounds, there is a sharp increase in delay of EEDBR due to quick energy consumption of nodes deployed in medium-depth region. DSEEDBR decreases end-to-end delay of the network by incrementing dth in high-depth area for forwarder selection considering low attenuation and noise losses in this region.Figure 15
End-to-end delay in EEDBR and DSEEDBR.Figure 16
Number of transmissions in EEDBR and DSEEDBR.Figure16 shows the comparison of number of transmissions in EEDBR and DSEEDBR. It also shows that, in spite of low throughput in stability period before 2000 rounds, there are a high number of transmissions in EEDBR which increase rapidly in the later rounds.Our proposed protocol minimizes delay by reducing the number of transmissions in the network. It compromises on network throughput to achieve lowTp. Global load balancing is achieved in DSEEDBR which results in an almost same number of transmissions throughout the entire lifetime. Simulations show that DSEEDBR is 68% more delay-efficient than EEDBR which is highly suitable for applications requiring high network lifetime and low network delay. Figure 17 shows that DSEEDBR has decreased end-to-end delay than EEDBR. It is due to the fact that speed of received signal defines the holding time. Neighbors having high depth difference but low Euclidean distance are selected as the data forwarder of the source node. It has less holding time than the other neighbors which causes decrease in delay. As the number of nodes is 225, there is a large improvement in delay condition in DSEEDBR due to efficient holding time computation.Figure 17
Comparison of EEDBR and DSEEDBR in terms of delay.


### 8.2.3. Comparison of AMCTD and DSAMCTD

Figure18 shows the comparison of end-to-end delay between AMCTD and DSAMCTD. The delay in AMCTD is already less than that of DBR and EEDBR due to the involvement of courier nodes; however, there is a high variation in end-to-end delay of AMCTD which is removed in our proposed scheme by introducing WF. Sensor nodes having higher number of neighbors have a greater WF than the other nodes and they are selected as optimal data forwarders. This reduces distant transmissions towards BS and utilizes the courier nodes in the high-depth region of the network. DSAMCTD also maintains reasonable stability period by avoiding distant transmissions in the medium-depth region.Figure 18
End-to-End delay in AMCTD and DSAMCTD.Figure19 illustrates total energy consumption in the schemes of AMCTD and DSAMCTD. There is a continuous variation in results of AMCTD due to movement of courier nodes. Our scheme maintains energy consumption in entire lifetime by adaptive dths. It prioritizes depth information of sensor nodes to compute its WF.Figure 19
Total energy consumption in AMCTD and DSAMCTD.Figures18 and 20 clearly show the trade-off between the throughput and end-to-end delay of DSAMCTD. Moreover, AMCTD has much higher throughput in the stability period, however, high variation in energy consumption of sensor nodes. We employed the mobility of courier nodes to achieve minimal delay without increasing network throughput. However, higher network throughput is maintained in the later rounds. According to our computations, DSAMCTD is 56% more efficient than AMCTD in terms of end-to-end delay in the network. Figure 21 shows the comparison of delay in AMCTD and DSAMCTD with the change in number of nodes in the network. It also shows the improved performance of DSAMCTD. It shows the equally efficient performance of priority factors in high, medium, and low network density.Figure 20
Network throughput in AMCTD and DSAMCTD.Figure 21
Comparison of AMCTD and DSAMCTD in terms of delay.


## 8.2.1. Comparison of DBR and DSDBR

First of all, we compare DBR and DSDBR to analyze the functioning of our proposed scheme in terms of different performance parameters. The default transmission time and receiving time of data packet for all sensor nodes are 40 ms and those of control packets are 10 ms. We also assume that sensor nodes employ a frequency of 25 kHz for acoustic communication. In Figure10, we analyze the total energy consumption in DBR and DSDBR. DSDBR faces tradeoff between decreased end-to-end delay (Figure 12) and increased total energy consumption; however, it allows a small decrease in network throughput (Figure 11). In the earlier rounds of DBR, there is an increase in number of transmissions which increases the network throughput along with end-to-end delay. In DSDBR, the network attempts to remove distant transmissions by selecting optimal data forwarders on the basis of their received packet’s TL and q. Figure 11 depicts that, in DBR, a number of packets received by sink are higher than DSDBR. In the initial rounds, throughput of DSDBR is lower than that of DBR. In DBR, high throughput in the initial rounds reduces the number of available forwarding nodes during instability period. In later rounds of DBR, there is a quick average energy consumption of sensor nodes causing creation of energy holes in the network.Figure 10
Total energy consumption in DBR and DSDBR.Figure 11
Network throughput in DBR and DSDBR.Figure 12
End-to-end delay in DBR and DSDBR.Figure12 illustrates the average decrement in delay of our proposed scheme in comparison to DBR. After 5000 rounds, there is a major decrease in delay of DSDBR at the cost of small decrement in network density. However, in DBR, there is increase in end-to-end delay which is primarily due to high TLs for remaining distant nodes. Furthermore, end-to-end delay depends upon salinity, temperature, depth, and TL of an acoustic signal. Nodal delay is also important; however, propagation delay mainly affects total end-to-end delay. After 1000 rounds, during the instability period of DSDBR, throughput remains higher than that of DBR along with minimum energy consumption and lesser end-to-end delay as shown in Figures 9, 10, and 11. The key cause of reduced delay in DSDBR in later rounds is low network density and availability of suitable data forwarders. Therefore, DSDBR is 48% more efficient than DBR in terms of end-to-end delay by compromising on low throughput and less stability period. Figure 13 shows that DBR has larger delay than DSDBR with the change in number of nodes. As the number of nodes increases, the delay in DBR is increased largely due to large aggregated holding time. In DSDBR, there is not a large increase in delay with increase in number of nodes due to selection of data forwards at the intermediate depth difference from the sender.Figure 13
Comparison of DBR and DSDBR in terms of delay.


## 8.2.2. Comparison of EEDBR and DSEEDBR

In Figure14, we compare TL of EEDBR and DSEEDBR. It illustrates that TL is higher in EEDBR than the proposed scheme, which is caused by a large number of transmissions and multiple retransmissions for same packets. In EEDBR, due to high network density in initial rounds, there is less transmission loss which increases dramatically with a decrease in the number of available forwarders in low-depth regions. Nevertheless, it delivers higher throughput than our proposed scheme due to increased stability period. DSEEDBR maintains low TL throughout the network lifetime by decreasing load on low-depth nodes; however, it compromises on network throughput in the initial rounds.Figure 14
Comparison of transmission loss (dB) in EEDBR and DSEEDBR.Figure15 depicts average end-to-end delay in EEDBR and DSEEDBR. It shows gradual decrease in delay of DSEEDBR along with changes in TL (Figure 16) of the network. It illustrates slower network activity in EEDBR which is not suitable for time-critical applications. After 2000 rounds, there is a sharp increase in delay of EEDBR due to quick energy consumption of nodes deployed in medium-depth region. DSEEDBR decreases end-to-end delay of the network by incrementing dth in high-depth area for forwarder selection considering low attenuation and noise losses in this region.Figure 15
End-to-end delay in EEDBR and DSEEDBR.Figure 16
Number of transmissions in EEDBR and DSEEDBR.Figure16 shows the comparison of number of transmissions in EEDBR and DSEEDBR. It also shows that, in spite of low throughput in stability period before 2000 rounds, there are a high number of transmissions in EEDBR which increase rapidly in the later rounds.Our proposed protocol minimizes delay by reducing the number of transmissions in the network. It compromises on network throughput to achieve lowTp. Global load balancing is achieved in DSEEDBR which results in an almost same number of transmissions throughout the entire lifetime. Simulations show that DSEEDBR is 68% more delay-efficient than EEDBR which is highly suitable for applications requiring high network lifetime and low network delay. Figure 17 shows that DSEEDBR has decreased end-to-end delay than EEDBR. It is due to the fact that speed of received signal defines the holding time. Neighbors having high depth difference but low Euclidean distance are selected as the data forwarder of the source node. It has less holding time than the other neighbors which causes decrease in delay. As the number of nodes is 225, there is a large improvement in delay condition in DSEEDBR due to efficient holding time computation.Figure 17
Comparison of EEDBR and DSEEDBR in terms of delay.


## 8.2.3. Comparison of AMCTD and DSAMCTD

Figure18 shows the comparison of end-to-end delay between AMCTD and DSAMCTD. The delay in AMCTD is already less than that of DBR and EEDBR due to the involvement of courier nodes; however, there is a high variation in end-to-end delay of AMCTD which is removed in our proposed scheme by introducing WF. Sensor nodes having higher number of neighbors have a greater WF than the other nodes and they are selected as optimal data forwarders. This reduces distant transmissions towards BS and utilizes the courier nodes in the high-depth region of the network. DSAMCTD also maintains reasonable stability period by avoiding distant transmissions in the medium-depth region.Figure 18
End-to-End delay in AMCTD and DSAMCTD.Figure19 illustrates total energy consumption in the schemes of AMCTD and DSAMCTD. There is a continuous variation in results of AMCTD due to movement of courier nodes. Our scheme maintains energy consumption in entire lifetime by adaptive dths. It prioritizes depth information of sensor nodes to compute its WF.Figure 19
Total energy consumption in AMCTD and DSAMCTD.Figures18 and 20 clearly show the trade-off between the throughput and end-to-end delay of DSAMCTD. Moreover, AMCTD has much higher throughput in the stability period, however, high variation in energy consumption of sensor nodes. We employed the mobility of courier nodes to achieve minimal delay without increasing network throughput. However, higher network throughput is maintained in the later rounds. According to our computations, DSAMCTD is 56% more efficient than AMCTD in terms of end-to-end delay in the network. Figure 21 shows the comparison of delay in AMCTD and DSAMCTD with the change in number of nodes in the network. It also shows the improved performance of DSAMCTD. It shows the equally efficient performance of priority factors in high, medium, and low network density.Figure 20
Network throughput in AMCTD and DSAMCTD.Figure 21
Comparison of AMCTD and DSAMCTD in terms of delay.


## 9. Conclusion and Future Work

In this paper, we propose delay-sensitive protocols as an improvement to localization-free routing schemes of DBR, EEDBR, and AMCTD. We validate and verify the proposed schemes through extensive simulations in Wireless Sensor Networks (UASNs). In DSDBR, we useFi and WF to devise better forwarder selection. In DSEEDBR, we introduce dth variation and provide an analysis to estimate DSHT. It is observed that distant transmissions in the low-depth region are the major causes of high propagation delays. Therefore, we eliminate large number of transmissions caused by turbulence and thermal activities. In the improved version of AMCTD, we devise PF formulae for sensor nodes with varying network density and selecting a sensor node with higher neighbors as an optimal forwarder for data packets. We succeed in guaranteeing minimal end-to-end delay by employing adaptive mobility of courier nodes allowing a slight decrease in network throughput.In our future work, we aim to focus on the design of delay sensitive schemes for localization based routing protocols in order to achieve a realistic approach for time-critical applications of UWSNs.



---

*Source: 532676-2015-03-25.xml*