# MuLSi-Co: Multilayer Sinks and Cooperation-Based Data Routing Techniques for Underwater Acoustic Wireless Sensor Networks (UA-WSNs)

Authors: Munsif Ali; Sahar Shah; Mahnoor Khan; Ihsan Ali; Roobaea Alroobaea; Abdullah M. Baqasah; Muneer Ahmad
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

Designing an efficient, reliable, and stable algorithm for underwater acoustic wireless sensor networks (UA-WSNs) needs immense attention. It is due to their notable and distinctive challenges. To address the difficulties and challenges, the article introduces two algorithms: the multilayer sink (MuLSi) algorithm and its reliable version MuLSi-Co using the cooperation technique. The first algorithm proposes a multilayered network structure instead of a solid single structure and sinks placement at the optimal position, which reduces multiple hops communication. Moreover, the best forwarder selection amongst the nodes based on nodes’ closeness to the sink is a good choice. As a result, it makes the network perform better. Unlike the traditional algorithms, the proposed scheme does not need location information about nodes. However, the MuLSi algorithm does not fulfill the requirement of reliable operation due to a single link. Therefore, the MuLSi-Co algorithm utilizes nodes’collaborative behavior for reliable information. In cooperation, the receiver has multiple copies of the same data. Then, it combines these packets for the purpose of correct data reception. The data forwarding by the relay without any latency eliminates the synchronization problem. Moreover, the overhearing of the data gets rid of duplicate transmissions. The proposed schemes are superior in energy cost and reliable exchanging of data and have more alive and less dead nodes.


---

## Body

## 1. Introduction

The network structure, reliability, and energy efficiency play an important role in the algorithm designing for UA-WSNs due to its tremendous applications and crucial challenges. A reliable, stable, and efficient algorithm with good network formation is used for many applications, such as military operations, mission, time, and data critical situations, locating and directing submarines and examining oil pipelines and cables [1, 2]. Moreover, addressing the unique and critical challenges during designing such an algorithm gets stringent attention of the researchers and academia. The acoustic communication amongst nodes tends to extreme latency than the optical and radio communication [3]. But optical and radio communication is not feasible for these networks. It is because of the scattering and absorption of these waves [4]. Attaining the location information of the nodes is also challenging due to the constraint of the global position system (GPS) in the water. It is due to the working of GPS on radio waves [5, 6]. Another way of getting location information is complex simulations. However, this is time and energy consuming, which also introduces computational complexity [7]. Moreover, nodes’ movement with water waves degrades the reliable and efficient operation of the algorithm [8]. Furthermore, energy-efficient operations are required due to the constraint of energy. The replacement and energizing of the nodes are hard [9]. The noisy environment in these networks also reduces reliable data exchanging between nodes. These challenges are given in Figure 1. Due to the mentioned reasons, limitations, and challenges, a good algorithm is required for operation of these networks.Figure 1
Challenges in UA-WSNs.Cooperative communication is the best solution in these networks to achieve reliable communication amongst the nodes and reduces data failure. The data advancement through multiple paths towards the destination for increasing the chances of correct data reception is called cooperation [10]. The data advancement every time by the relay for data reliability is called fixed cooperation. While in the incremental cooperation, the delivery is done when the receiver demands from it. Before advancing data to the forwarder/receiver, either it is boosted or decoded by the relay. Based on relay behavior, it is named as amplify forward (AF) and decode forward (DF) [11]. The DF is complex in computation than AF. The cooperative algorithms obtain greater data reception and less packet drop. However, excessive energy and time consumption make these challenging and difficult. In the case of acoustic waves, it is more challenging because of energy resources and the low speed of communication.In noncooperative algorithms, delivery through a single link consumes less energy and time than cooperative techniques. However, these algorithms are not reliable and have greater chances of packets loss [12]. A small obstacle may lead to data loss and failure. Moreover, noise sources also cause data corruption and have greater effects on data loss in noncooperative algorithms. The retransmission mechanism is not a suitable choice for data reception again over the same noisy link. Also, multiple antennas are costly and not feasible in underwater [13]. Cooperation is the best choice to achieve reliable and good communication in UA-WSNs.The network structure has greater effects on routing performance, especially in UA-WSNs. Poorly designed network leads to bad performance, while a well-designed network structure improves the results and performance. Furthermore, sink placement plays an important role in algorithm efficiency. Sink placement at the best position tends to perform enhancement. Many algorithms such as [14–17] designed network in a single solid structure and placed the sink on the top. Placement of the sink on such positions leads to high and imbalance data load. The high load tends to traffic congestion and data collision. The collision causes the packets to drop and forwards data with greater latency. Moreover, the life of the nodes near to the sink is less compared to the other nodes which are far away from the sink.Many cooperative algorithms exist in the literature [18–24]. Some of the existing cooperative algorithms, such as [25–27], are reliable but they compromise on energy, which leads to less stability and reduces the life of the network. In the case of poorly designed network architecture in cooperative algorithms, its stability is further reduced. Data and time synchronization are other issues in these algorithms. The nodes near to the sink have the highest data traffic. This traffic creates issues, like data collision, a greater amount of energy cost, and high time consumption.Considering the aforementioned challenges and difficulties, the article proposes two carefully designed algorithms. The first one is the MuLSi algorithm, and the second one is its extended version using the cooperation methodology for reliability enhancement of the MuLSi algorithm. The MuLSi technique proposes a network structure in layers instead of a single solid structure. The sinks are placed in the middle of each layer to reduce the multihop communication between nodes and sinks. Such placement of sinks also reduces the path length between the nodes and the final destination. Reduction in the path length tends to minimize the effects on the data. The next stage consists of data exchanging. The data is delivered to the sink using multihop communication. Therefore, the next forwarder selection is made upon the distance of the nodes from the sink. The node which is the nearest is selected as the next forwarder. In MuLSi algorithm, the data exchanges with the receiver/forwarder on a single link. The single link does not achieve the best and reliable results. Therefore, cooperation is one of the best solutions to intensify a reliable operation. The article proposes the extended version of the MuLSi algorithm named as MuLSi-Co algorithm. The MuLSi-Co algorithm provides reliable operation by utilizing the broadcast behavior of nodes. The relay forwards data to the destination without any latency. As a result, the forwarder/receiver receives the data along two paths and then combines the data to minimize the channel effects and ensure its reliable operation. The overall contributions of the article are summarized as follows:(i)
The network structure plays an important role in network performance improvement. Therefore, the suggested MuLSi algorithm in this article proposes the network structure in layers instead of a single solid structure. Moreover, the layered structure decreases the dependency on other nodes as compared to a single solid structure. Then in each layer, a sink is positioned in the top center. This reduces the multi-hop communication between nodes and tends to reliable and energy-efficient operation. Then instead of the receiver-based approach, the proposed scheme prefers the sender-based approach due to latency, synchronization between nodes, and reduction in computational cost. The sender decides its next forwarder upon nodes’ distance from the destination. Instead of complete information about the distance, a simple distance formula is utilized to reduce the computational complexity and cost. Moreover, the knowledge acquisition stage is designed in such a way that reduces the data overhead, traffic congestion, data overload, and energy expenses(ii)
Due to the high effects of the channel on a single link data in the MuLSi algorithm, the chance of data corruption is high. The single link breaking has high chances which affect the reliable transmission and sometimes leads to loss of data. So, this motivation leads to the extended version of the MuLSi algorithm termed as MuLSi-Co. In this, the cooperative behavior of the nodes makes the network reliable. The relay forwards the data to the forwarder/receiver and combines the copy and original packets to reduce its chances of being dropped(iii)
The redundant packet transmission and synchronization between nodes, sender, receiver, and forwarder, are two of the most important aspects of the cooperative techniques. In order to improve synchronization, a fixed cooperative behavior of the relay tends to eliminate such issues. The relay advances the data as it receives it without any time-wasting. The other nodes in the proximity of the sender discard the data after analyzing it, which leads to a reduction in duplicate data transmission. The suppression of such packets improves efficiency in terms of energy and data collision


## 2. Related Work

The two most important parameters, the power of sensor nodes and less noisy links to transmit data in the harsh environment of the UA-WSNs, are addressed in [28] by proposing two routing protocols. The first scheme “energy effective and reliable delivery (EERD)” deals with the battery consumption parameter, and the second scheme “cooperative energy effective and reliable delivery (CoEERD)” incorporates the noisy link issue. The EERD consists of only one single path, in order to deliver the data from one state to the next higher state. Initially, the source node generates information and advances it. Every source has its own transmission range. All those nodes which come in the range of transmitter receive the data. The source nominates a node (forwarder) amongst the nodes which are around the source for further transmission. The nominating criteria for the forwarder node depends on a weight function. The weight function includes the information of residual energy, bit error rate (BER), and distance. In other words, the node is selected as a forwarder that has maximum residual energy, less BER, and the lowest distance to the sink node. Due to a single link for data transmission, it has the maximum probability of data corruption. To avoid and tackle such issues, an extended version of the EERD is proposed, called CoEERD. In CoEERD, along with the forwarder, a relay is also selected for data advancement to the next stage. The selection criteria of the forwarder and relay nodes are similar as in the EERD mechanism. If the BER increases from the threshold value, then the relay node sends the data. This way improves data exchanging over the noisy links, and the original data is transmitted in a safe mode. The discussed routing schemes outperform, in terms of alive and dead nodes, the successful packet reception with the lowest a lower energy cost.A “reliable multipath energy-efficient routing protocol (RMEER)” is presented in [29]. This research work targets to enhance the network lifetime and set an optimal route to deliver the information to the desired target. The whole network is divided into five different and equal layers. The final destination node is placed at the top of the water surface, and static powerful carriers are deployed in the remaining layers. The last layer of the network contains ordinary sensor nodes. The multipath data routing mechanism is followed to deliver the information. In order to improve the packet delivery ratio multisinks with the multipath disjoint algorithm are used. In this algorithm, if any node dies, then an alternate route selection bypasses the died node route. The data forwarding process is defined by a routing table. A hello packet is sent by the courier node; after receiving this packet, every source node updates its routing table. This table contains the residual energy, link quality, and node ID. By analyzing all these parameters, an optimal forwarder node is selected for the data transmission towards the sink.Once the battery of sensor nodes dies, it is impossible to change it in a harsh environment. In addition, the noise degrades the quality of the information packets. These two major problems are incorporated in [30]. For these two problems, two different routing protocols are designed. One deals with a power consumption problem called SRSPR: “stable and reliable short-path routing”, and the second deals with the successful transmission of the data called Co-SRSPR. Initially, all the sensor nodes are not familiar with the basic information of the neighbor nodes. So, the hello packet is a method to collect records, all the necessary and basic information of the nodes like residual energy, signal to noise ratio, Euclidean distance, and a minimum number of hops. Information in the form of packets is generated and is not sent directly to the sink because of maximum energy consumption and noise. However, it is sent through a multihop mechanism. The best forwarder selection depends on the maximum residual energy, signal to noise ratio, the lowest Euclidean distance to the sink, and minimum hopes. The whole purpose of the mentioned article is to minimize energy consumption. However, this protocol is not able to enhance reliable operation; to do so, a new routing scheme is developed by adding the cooperation to the SRSPR protocol called Co-SRSPR. In Co-SRSPR, one extranode called relay takes part in data transmission in delivery. The relay is selected on the basis of the second largest value of the weight function. If the link is noisy and the BER crosses the limit, then the relay transmits the packet to the final destination. This mechanism minimizes the packet drop ratio and hence increases the successful transmission of the data. Experimental outcomes clearly indicate the best performance of the presented protocol in energy consumption and maximum packet delivery ratio.In [31], cooperation and multihop energy-efficient routing schemes are introduced for UA-WSNs. The information is generated by the nodes and directs this information towards the sinks through a multihop algorithm. To enhance the reliability of the network, a cooperation scheme is introduced to the one-hop communication. The data forwarding stage is accomplished in two phases. In the first phase, the forwarder node receives the information, and in the second phase, along with the forwarder node, one relay node is set to transmit the data. When both forwarders receive the information, then MRC technique is used which merges these two packets to make one reliable packet. To find the relative distance between nodes, the RSS algorithm is used. The outcomes of the proposed scheme show the best responses in terms of energy and stability of the network.The fuzzy vector technique is determined in [32] which copes with the delay minimization and battery life issues. This is an advanced version in which fuzzy logic technique (FLT) is utilized. The source generates information and then directs it towards the sink through a multihop mechanism and considers the maximum residual energy for data advancement. The best forwarder selection depends on the residual energy along with the node position. When the data packet generated by the source is broadcasted, all its neighbors receive the packet. Amongst all neighbors, one optimal node is chosen to deliver data to the next node. The residual energy of the selected node should be maximum so that it does not die soon and the position of this node should be minimum to sink node. The experimental results show the best responses in terms of fast data transmission and the network have maximum alive nodes.In [33], a new mechanism is introduced called “multimedia- and multiband-based adaptation layer techniques” which deals with the bandwidth limitation, propagation delay, and power constraint problems in UA-WSNs. In this routing scheme, the information is collected and transmitted in an effective way. The delivery of data to the sink is accomplished in a hierarchical manner. In order to choose the path, this task is divided into two different phases. The Manhattan approach determines the nodes which are nearer and away from the final destination and selects the medium for data exchanging. The RSSI technique also determines the distance. The modem used for multimedia is developed which supports the bandwidth of acoustic wave range from 70 to 140 KHz. Only one single bandwidth is used for infrared wavelength ranges from 700 nm to 1 mm. For visible light communication, the blue light with 450 to 485 nm wavelength is used. In the simulation results, the proposed scheme seems better in propagation delay, bandwidth, and energy consumption.To reduce the interference and undesired signals to the information signal and to use minimum energy by the nodes for transmission and reception of data are proposed in [34]. Multiple datasets are received with minimum or no interference. To control the power parameter of the nodes, a frequency-selective interference channel based on a noncooperative game-theoretic approach is discussed in which the uniqueness and existence of Nash equilibrium are proved. The throughput and cost function of the proposed network is defined by the utility function, in which the cost function indicates the power consumption record of the nodes. The utility function of the nodes changes with the noncooperative mechanism. Hence, increase the throughput and reduce the energy usage of nodes.Energy-efficient clustering algorithm is proposed in [35], to deal with the balancing and energy problems of the nodes in UWSNs. To reduce the overhead of energy problem during rotation in cluster heads (CHs), leomna, a dual cluster head mechanism, is introduced. To manage the energy of network nodes, a noncooperative game model is also discussed. In this approach, the whole workload in terms of energy is measured first. Then, equal distribution is carried out for each node in terms of energy. In this game model, the Nash equilibrium point is carried out and justified with solid proof. This means a single average value of the energy is defined which every node uses in transmission. Transmission of information amongst intracluster and intercluster domains is carried out in an efficient way to reduce energy usage; to do so, cluster-combined game theory and dual cluster head are proposed, which distribute the energy in an effective way. As a result, the overall network in balancing and energy consumption is optimal compared to existing techniques as shown in the simulation result section.In [36], network stability and noise awareness are the main concern. This routing called depth-based noise aware scheme targets these two parameters. Initially, the network is idle and knows nothing about nodes. Hello packet is issued from the sink and channel reciprocity obeys in this routing mechanism. By receiving this hello packet, every node puts its ID number, depth, and noise information. By doing this, all nodes become familiar with each other. When the source generates the information signal, every node in the source transmission range will receive this. If all nodes send this data to the final destination node called sink node, then there is huge energy crisis within the network. For this purpose, only one node has been selected to transmit the packet. This node selects the lowest depth and lowest noise parameters. Such node is selected up to complete successfully transferring of data to sink node. Hence, the selection of such node reduces the energy consumption, optimizing the path quality of the signal. Moreover, the reliability of the network increases, alive nodes increase, and dead nodes decrease.Due to the harsh and unpredictable atmosphere of the underwater networks, it hits the overall performance of the network in the aspect of packet delivery, battery life, and the error rate of data. In order to cope with these issues, new ideas have been presented in [37]. This protocol divided the whole network into 4 different regions based on the depth of the nodes. Three different depth-based regions are classified on the base of the depth of the sensor nodes, which are the lowest depth node region, medium depth node region, and highest depth node region. At the top of each region, a sink node is placed which directly communicates with the offshore sink node. Every region has different random nodes amongst which only one node is chosen to transmit the data towards the sink node of each region, respectively. The one forwarder node is selected on the base of the highest residual energy and the lowest depth value. This whole arrangement increases the network time and increases the throughput and reliability of the network.Due to the most frequent use of top nodes, the energy of those nodes ends which stops further transmission of data; this is called hole generation. The work in [38] avoids the hole generation. Sink nodes are placed far away from the region of interest; therefore, two routing schemes are discussed here, called distributed energy-efficient and connectivity-aware routing protocols. These schemes avoid the mostly used of overhead lowest depth nodes which are responsible to create a hole as a result of which blockage of data transmission in the underwater network takes place. In this protocol, the route changes to multihop. Although the burden of data transmission on the lowest depth nodes minimizes as the output of which the probability of dead ratio in upper surface nodes is reduced, the simulation result shows that the lifespan of the lowest depth nodes increases from 50 to 70 percent. Dead node ratio minimizes, and alive nodes are in maximum number.In [39], different issues are highlighted and tried to fix them when someone deals with underwater wireless sensor networks. These issues include delay in data processing, more energy usage, and noisy links. However, the most dominant problems are energy consumption and network reliability. An opportunistic energy-efficient routing scheme (EECOR) is proposed here to tackle these problems. In the opportunistic scheme, relay node is selected in cooperative mode with the forwarder node to deliver the data packet in an efficient way. With EECOR, fuzzy logic-based relay is chosen for energy usage and maximum data delivery probability. This scheme avoids the collision of the data packets which reduces the most energy usage of the nodes. The timer mechanism is fixed which notes the time of the already transmitted data packet, and after a fixed time, it sends another packet; in this way, the collision is controlled. The experimental graph shows that the average packet transmission ratio, average delay, and average network lifetime are optimal for the presented protocol compared to the rest schemes.A multilayer multipath data forwarding scheme is proposed in [40]. Three phases are defined to forwarding the data from bottom to top of the water surface. The first phase explain the network architecture, and in this model, nodes are randomly deployed. In the second phase, the whole routing mechanism is explained, how the data is forwarded to the next higher state nodes. In this phase, the seabed sources initialize the information signal; acoustic powerful nodes are fixed in the upper layer of the surface. The transmitter node is responsible to transmit the data to the acoustic powerful nodes from which the data is directed towards the sink nodes placed on the water surface. The forwarder node selects with lowest depth information; once the forwarder node is selected, this will receive and transmit the information data to powerful acoustic nodes. The RREQ/RREP algorithm is used to choose the best route for multipath transmission. The last phase clearly verifies the shortest distance node selection which sends the data from the source to the sink node. The outcomes show the best performance and maximum improvement in network lifetime, throughput.DIEER routing is proposed in [41]; it is a delay intolerant energy-efficient algorithm. This protocol can avoid the collision in data packet propagation delay and increase the PDR. No one routing protocol deals with all these problems except the DIEER protocol. The retransmission of data minimizes which reduces the energy usage of the network and hence decreases the delay of the network. The joint optimization framework for sink mobility, hold, and forwarding mechanism is introduced. To reduce the network delay, maximum data delivery, enhancing network life, minimizing energy usage, and the adaptive value of the threshold is fixed with data aggregation and pattern matching schemes. Three-dimensional underwater environment is designed with sink mobility and dense deployment of the nodes with varying communication radii. There is no retransmission of the data that occurs by the adaptation of the presented protocol.In [42], deep learning-coded index modulation-spread spectrum (DL-CIM-SS) technique is adopted to overcome the data rate issue for multiusers and hence remove the flaw that exists in multiuser direct sequence spread spectrum (DSSS). This mechanism sends the data via index of spreading code instead of sending data to all users physically. In this way, the energy usage is reduced, and the maximum data is transmitted. The algorithm proposed in [43] transmits data at a high rate which is the key parameter of underwater communication systems in order to reduce battery power, spreading, and scattering phenomena. The experimental results show the advancement in energy and spectral efficiency.Secure energy efficiency with cooperation setup is introduced in [18]. The security parameter is not only important for terrestrial networks but also for underwater networks. The security of the data is analyzed for combatting attacks. At the bottom of the network, information has been generated; the main task of the proposed scheme is how to make secure the generated data while transmitting it to the water surface. Along with this, to consume minimum energy in transmission and reception, a hello packet is transmitted to all nodes; every node can add the path loss, residual energy, and depth information to this hello packet. The depth threshold from 20 m to 40 m is included to avoid the flooding process in the underwater network. Attack of unauthentic signals is checking mechanism to secure the information packet. A duplicate copy of the data packet is already sent to the minisink. When the original data is sent to the sink by multihop process, this original data packet and already sent duplicate copy have been compared. In this way, this protocol ensures the security of the data. This protocol was best performed in terms of security network lifespan. Tables 1 and 2 show the analysis of these algorithms.Table 1
Related work comparison.
ProtocolEnergy costPDRPacket dropsDelayCo-EERDHighHighLowHighRMEERLowLowHighLowCo-RSPRLowHighLowLowCAEECLowHighLowLowFLVBLowLowHighLowMMMBBLowLowHighLowPCNCLowHighLowLowEECALowHighLowHighEBLFCNLowHighLowLowDEADSLowHighLowLowEEPEHLowLowHighHighEECORLowHighLowLowMLMPLowHighHighLowDIEERLowHighLowLowSEECRLowHighLowLowTable 2
Related work information.
ProtocolLocation informationCooperationEnergy efficientMultilayersCo-EERDNoYesYesNoRMEERNoNoYesYesCo-RSPRNoYesYesNoCAEECYesYesYesNoFLVBNoNoYesNoMMMBBNoNoYesYesPCNCNoNoYesNoEECANoNoYesNoEBLFCNYesYesYesNoDEADSYesYesYesYesEEPEHNoNoYesNoEECORNoYesYesNoMLMPNoNoYesYesDIEERNoNoYesNoSEECRNoYesYesNo


## 3. The Proposed Scheme

### 3.1. Multilayer Sink Algorithm

#### 3.1.1. Proposed Network Structure

The network structure has tremendous effects on the performance parameters, such as reliability, stability, scalability, delay, and energy efficiency. The poorly designed network model reduces the overall performance and does not complete the main objectives and aims of the network. So, the network structure plays an important and fundamental role in precise operation to achieve fair and worthy performances. On account of this, a multilayer network structure is proposed as shown in Figure2. The proposed network is partitioned into five equal layers called a multilayer network. The intention behind the multilayer network structure is to place the sinks on the optimal position, which motive is to accumulate data more efficiently and conveniently. The network comprises of a set S=Sn∪Ss of sensor nodes and sinks, where the set of sensor and sink nodes is represented by Sn and Ss, respectively.Figure 2
Proposed multilayer network structure.The set of nodesSn=n1,n2,n3,⋯nn is arranged irregularly in the network. These nodes have different sensors for monitoring and investigation of different environmental factors. For transmission of data, each node is equipped with an acoustic modem. The energy at the initial stage of every node is Eo. Therefore, the total energy of the network is n×Eo, where n represents the total number of nodes. Two nodes x and y are neighbors if their transmission range rt is less than its Euclidean distance. All nodes are identical in all aspects, such as energy consumption, data rate, and battery power.Nodes’ random distribution has a negligible effect on performance of the network, while the positioning of the sinks is very important and crucial for performance enhancement, improvement, and data accumulation. So, the sinksSs=s1,s2,s3,s4,s5 are placed in the middle top of each layer. The position of the first sink is given as
(1)s1x,y=xc,yo,where the yo is the value of y coordinate, and it is 0 for the first sink, while xc represents the center point of the x coordinate in the network and is obtained as
(2)xc=totallenghtofx−axis2.The positions of the second, third, fourth, and fifth sinks are(3)s2x,y=xc,yo+a,(4)s3x,y=xc,yo+2a,(5)s4x,y=xc,yo+3a,(6)s5x,y=xc,yo+4a,where a=100. The sink has a greater energy resource than the other nodes. The nodes communicate with each other or sink through acoustic waves with a data rate of m bit/sec and frequency f KHz. The base station collects all the data from the sinks for further processing and analysis as considered in [16].


#### 3.1.2. Knowledge Acquisition

After sinks’ and nodes’ placement, information about the nodes and sinks are exchanged with each other. In order to minimize the data overhead, traffic congestion, and energy expenditure, information acquisition takes place in parts. The purpose of information or knowledge acquisition is to find the distance of nodes from the sink and their neighbors to select the best candidates for data forwarding. In the first part, the sink broadcasts data of one bit in order to inform the nodes in its transmission area. The node within the transmission area of the sink receives the data. In response to this data, each node transmits INFO PACKET, which contains the ID of that node. As the node broadcasts the INFO PACKET, it set a timer and starts measuring the time. When the sink receives the INFO PACKET, it updates the INFO PACKET by embedding its own information and transmits it towards that node. When the node receives the updated INFO PACKET, it stops the timer and notes its one-way transmission timet. The node finds its distance d from the sink by d=vt, where v denotes the acoustic wave speed.In the second part, the other nodes send INFO PACKET and start time counting. In response to this, the nodes which have calculated their distance now respond to other nodes. The node then calculates its distance from each respondent node and its distance from the sink. The sink distance is added to nodes’ mutual distance. The INFO PACKET format is given in Figure3.Figure 3
Structure of INFO PACKET.In order to enhance network performances, further, updating of information is not done very frequently. However, information acquisition occurred after some interval of time. The updating process is necessary to find its recent and most suitable neighbor for data forwarding.


#### 3.1.3. Data Forwarding

To enhance the network performance, the sender-based approach is a preferred choice in the proposed algorithm. In a sender-based approach, the sender decides its next forwarder which reduces the data forwarding time and computational cost. The reduction of computational cost leads to less energy cost. The nodes near to the sink and lying in sink’s transmission area directly communicate with it as shown in Figure4. These nodes do not need any further route for data delivery. The nodes which are far away from the sink and cannot exchange data with the sink directly follow a multihop communication.Figure 4
Data exchanging directly with sink.In order to deliver the data quickly, the proposed algorithms follow the shortest route towards the sink by using distance from the destination. Before broadcasting of the data from the sender, it arranges all its neighbours in descending order based on distance information to assign priority to each neighbour. Another word, the nodes having the nearest to the sink, is assigned the first priority for data delivery. When the sender arrange all its neighbours, then it forwards the data packet. Figure5 depicts and elaborates the packet forwarding scenario. The packet header contains the complete information of the forwarder, final sink, and its own information. The header contains the sender ID, forwarder ID, and the sink ID. After the header data is appended with, they analyze the packet and look for its own ID. When the neighbour ID matches with the ID in the packet, then forward the data packet towards the next stage using the same procedure. The other nodes which receive the data from the sender holds the data for a while, because this data held by the nodes will be utilized in it improved cooperative version of the proposed MuLSi.Figure 5
Data exchanging with sink through forwarder.The nodes are far away from the sink and follow path to the sink. There are two scenarios of possible position of the neighbours. When these are at different distance from the same, then the sender gives priority to the node which is near to the sink. On another hand, when the nodes are the same distance from the sink, then the sender is free to select anyone of these nodes. Although the second scenario has low chances to occur, it is considered in the proposed algorithm.It is considered that each sink communicates and forwards its data to the sink placed in the upper layer. The sink placed at the top of the network communicates with the base station. It exchanges all its data with the base station for further processing and analyzing.


#### 3.1.4. Suppression of Redundant Packets and Acknowledgment

The proposed algorithms tries to control the redundant packet transmission by utilizing the broadcast nature of the nodes. When these nodes overhear the same packet, then they delete the packet from its memory. They consider that the data is delivered to the next destination. In order to reduce the traffic congestion, data overhead, and energy cost, the acknowledgment is not considered in the proposed algorithm.


### 3.2. MULSI-Co: Multilayer Sink Algorithm with Cooperation

In the unpredictable and high noise availability in the underwater, a single link is not feasible for communication. The retransmission of the data through the same link is not a good choice, because the data reception through the same link has high chances of data corruption again, which will tend to waste energy and high latency in the data exchanging. The proposed MuLSi algorithm follows a single link for exchanging of data. In order to increase the reliable data reception at the destination of the proposed MuLSi algorithm, the cooperation technique is added to it. Delivery of the same data over many paths towards the destination is known as cooperation. This increases the correct reception of the data with a cost of more energy and latency than the noncooperative methods. This section gives the details of the proposed MuLSi-Co algorithm.


#### 3.2.1. Cooperative Relay Identification

The important step in cooperation is the relay selection. The best relay selection amongst the neighbors tends to improve the performance. The cooperation technique is reliable, but its cost in terms of energy and delay are greater. So, to minimize the delay and reduce the channel effects, the proposed MuLSi-Co selects the relay which is the nearest to the final destination.During the knowledge acquisition phase in the MuLSi algorithm, each node has its neighbours list along with their distance information. If the sink is not reachable by the sender directly, then amongst these neighbours, the node which is the nearest to the sink is considered as the forwarder, and the nearer node is selected as relay by the sender. If the sender can exchange its data directly with the sink, then the nearest node is selected as the relay. These relays cooperate with forwarders and destinations to improve reliability.


#### 3.2.2. Data Exchanging and Synchronization

After identification of the relay and forwarder/destination by the sender, the next phase is about data exchanging. Whenever the sender wants to deliver its packet, it appends the information of the relay and forwarder/destination. The sender, relay, and forwarder/destination IDs are appended with the data. In case of the direct communication with the sink, the sender appends the ID to it. Otherwise, the node nearest to the sink works as a forwarder, and the sender declares it as a forwarder and appends its ID. And the next node ID is appended as a relay.Whenever the data is received by any node from any sender, then the node searches for its own ID in the packet. If it finds its own ID in the data as forwarder, this node can work as a forwarder for that sender. The relay also searches for its own ID and works as a relay. When the forwarder receives a packet, it waits for a while to receive its copy from the relay. The data received by the relay is delivered to the forwarder as it is received. The other nodes which hear the data ignore it and become silent. Whenever there is no relay, the forwarder does not wait and deliver it to the next stage without cooperation. The forwarder knows the relay by analyzing the packet.The time and data synchronization are one of the most challenging stage in cooperation. The delivery of the data by the relay in the exact time is important to improve performance. Therefore, for simplicity, the proposed MuLSi-Co routing is designed in a manner to handle the time synchronization between the relay and forwarder. Whenever the relay receives the data, it forwards it without any wait and holding. Due to the broadcast nature of the nodes, all neighbours hear the data. These neighbors check for its own ID in the data. If they do not find its ID, then they ignore the data. This reduces the duplicate packet transmission and improves the energy cost.


#### 3.2.3. Cooperation and Data Combining Model

In the proposed cooperative algorithm, the data advancement occurs in three steps. In the first step, the sender advances its data to the forwarder and relay. In the second step, the forwarder holds the data for a while and waits for the relay data. As the relay receives data, it sends it to the forwarder. In the third state, two copies of the same data are merged to make one reliable data packet from these.Considering three nodes, senderj, receiver or forwarder k, and relay l are depicted in Figure 6. In the first stage, the j broadcasts the generated data Tj towards the k and l. The received signal Rjk at k is given as
(7)Rjk=gjkTj+njk.Figure 6
Cooperation model.The channel noisenjk and the fading gjk affects the data when transmitting from the j to k. Likewise, putting a subscript jl to n and g indicates the noise and fading between j and l. The received data Rjl is represented as
(8)Rjl=gjlTj+njl.In the second stage, the forwarder/receiverk waits for the copy of the same data packet from the l. As l receives the data in the first stage, it analyze it. In case the l finds himself eligible for data forwarding, it forwards the data Tl to the k without any holding. The factors which influence the data transmission between l and k are the channel noise nlk and fading glk. The l receives the data Rlk and is given as
(9)Rlk=glkTl+nlk.In the third stage,k has a direct received packet Rjk and its copy Rlk received through l. Now, the k combines these data using maximal ratio combining. The combined data is given as
(10)Rk=Rjk+RjlRlk1+Rjl+Rlk.


## 3.1. Multilayer Sink Algorithm

### 3.1.1. Proposed Network Structure

The network structure has tremendous effects on the performance parameters, such as reliability, stability, scalability, delay, and energy efficiency. The poorly designed network model reduces the overall performance and does not complete the main objectives and aims of the network. So, the network structure plays an important and fundamental role in precise operation to achieve fair and worthy performances. On account of this, a multilayer network structure is proposed as shown in Figure2. The proposed network is partitioned into five equal layers called a multilayer network. The intention behind the multilayer network structure is to place the sinks on the optimal position, which motive is to accumulate data more efficiently and conveniently. The network comprises of a set S=Sn∪Ss of sensor nodes and sinks, where the set of sensor and sink nodes is represented by Sn and Ss, respectively.Figure 2
Proposed multilayer network structure.The set of nodesSn=n1,n2,n3,⋯nn is arranged irregularly in the network. These nodes have different sensors for monitoring and investigation of different environmental factors. For transmission of data, each node is equipped with an acoustic modem. The energy at the initial stage of every node is Eo. Therefore, the total energy of the network is n×Eo, where n represents the total number of nodes. Two nodes x and y are neighbors if their transmission range rt is less than its Euclidean distance. All nodes are identical in all aspects, such as energy consumption, data rate, and battery power.Nodes’ random distribution has a negligible effect on performance of the network, while the positioning of the sinks is very important and crucial for performance enhancement, improvement, and data accumulation. So, the sinksSs=s1,s2,s3,s4,s5 are placed in the middle top of each layer. The position of the first sink is given as
(1)s1x,y=xc,yo,where the yo is the value of y coordinate, and it is 0 for the first sink, while xc represents the center point of the x coordinate in the network and is obtained as
(2)xc=totallenghtofx−axis2.The positions of the second, third, fourth, and fifth sinks are(3)s2x,y=xc,yo+a,(4)s3x,y=xc,yo+2a,(5)s4x,y=xc,yo+3a,(6)s5x,y=xc,yo+4a,where a=100. The sink has a greater energy resource than the other nodes. The nodes communicate with each other or sink through acoustic waves with a data rate of m bit/sec and frequency f KHz. The base station collects all the data from the sinks for further processing and analysis as considered in [16].


### 3.1.2. Knowledge Acquisition

After sinks’ and nodes’ placement, information about the nodes and sinks are exchanged with each other. In order to minimize the data overhead, traffic congestion, and energy expenditure, information acquisition takes place in parts. The purpose of information or knowledge acquisition is to find the distance of nodes from the sink and their neighbors to select the best candidates for data forwarding. In the first part, the sink broadcasts data of one bit in order to inform the nodes in its transmission area. The node within the transmission area of the sink receives the data. In response to this data, each node transmits INFO PACKET, which contains the ID of that node. As the node broadcasts the INFO PACKET, it set a timer and starts measuring the time. When the sink receives the INFO PACKET, it updates the INFO PACKET by embedding its own information and transmits it towards that node. When the node receives the updated INFO PACKET, it stops the timer and notes its one-way transmission timet. The node finds its distance d from the sink by d=vt, where v denotes the acoustic wave speed.In the second part, the other nodes send INFO PACKET and start time counting. In response to this, the nodes which have calculated their distance now respond to other nodes. The node then calculates its distance from each respondent node and its distance from the sink. The sink distance is added to nodes’ mutual distance. The INFO PACKET format is given in Figure3.Figure 3
Structure of INFO PACKET.In order to enhance network performances, further, updating of information is not done very frequently. However, information acquisition occurred after some interval of time. The updating process is necessary to find its recent and most suitable neighbor for data forwarding.


### 3.1.3. Data Forwarding

To enhance the network performance, the sender-based approach is a preferred choice in the proposed algorithm. In a sender-based approach, the sender decides its next forwarder which reduces the data forwarding time and computational cost. The reduction of computational cost leads to less energy cost. The nodes near to the sink and lying in sink’s transmission area directly communicate with it as shown in Figure4. These nodes do not need any further route for data delivery. The nodes which are far away from the sink and cannot exchange data with the sink directly follow a multihop communication.Figure 4
Data exchanging directly with sink.In order to deliver the data quickly, the proposed algorithms follow the shortest route towards the sink by using distance from the destination. Before broadcasting of the data from the sender, it arranges all its neighbours in descending order based on distance information to assign priority to each neighbour. Another word, the nodes having the nearest to the sink, is assigned the first priority for data delivery. When the sender arrange all its neighbours, then it forwards the data packet. Figure5 depicts and elaborates the packet forwarding scenario. The packet header contains the complete information of the forwarder, final sink, and its own information. The header contains the sender ID, forwarder ID, and the sink ID. After the header data is appended with, they analyze the packet and look for its own ID. When the neighbour ID matches with the ID in the packet, then forward the data packet towards the next stage using the same procedure. The other nodes which receive the data from the sender holds the data for a while, because this data held by the nodes will be utilized in it improved cooperative version of the proposed MuLSi.Figure 5
Data exchanging with sink through forwarder.The nodes are far away from the sink and follow path to the sink. There are two scenarios of possible position of the neighbours. When these are at different distance from the same, then the sender gives priority to the node which is near to the sink. On another hand, when the nodes are the same distance from the sink, then the sender is free to select anyone of these nodes. Although the second scenario has low chances to occur, it is considered in the proposed algorithm.It is considered that each sink communicates and forwards its data to the sink placed in the upper layer. The sink placed at the top of the network communicates with the base station. It exchanges all its data with the base station for further processing and analyzing.


### 3.1.4. Suppression of Redundant Packets and Acknowledgment

The proposed algorithms tries to control the redundant packet transmission by utilizing the broadcast nature of the nodes. When these nodes overhear the same packet, then they delete the packet from its memory. They consider that the data is delivered to the next destination. In order to reduce the traffic congestion, data overhead, and energy cost, the acknowledgment is not considered in the proposed algorithm.


## 3.1.1. Proposed Network Structure

The network structure has tremendous effects on the performance parameters, such as reliability, stability, scalability, delay, and energy efficiency. The poorly designed network model reduces the overall performance and does not complete the main objectives and aims of the network. So, the network structure plays an important and fundamental role in precise operation to achieve fair and worthy performances. On account of this, a multilayer network structure is proposed as shown in Figure2. The proposed network is partitioned into five equal layers called a multilayer network. The intention behind the multilayer network structure is to place the sinks on the optimal position, which motive is to accumulate data more efficiently and conveniently. The network comprises of a set S=Sn∪Ss of sensor nodes and sinks, where the set of sensor and sink nodes is represented by Sn and Ss, respectively.Figure 2
Proposed multilayer network structure.The set of nodesSn=n1,n2,n3,⋯nn is arranged irregularly in the network. These nodes have different sensors for monitoring and investigation of different environmental factors. For transmission of data, each node is equipped with an acoustic modem. The energy at the initial stage of every node is Eo. Therefore, the total energy of the network is n×Eo, where n represents the total number of nodes. Two nodes x and y are neighbors if their transmission range rt is less than its Euclidean distance. All nodes are identical in all aspects, such as energy consumption, data rate, and battery power.Nodes’ random distribution has a negligible effect on performance of the network, while the positioning of the sinks is very important and crucial for performance enhancement, improvement, and data accumulation. So, the sinksSs=s1,s2,s3,s4,s5 are placed in the middle top of each layer. The position of the first sink is given as
(1)s1x,y=xc,yo,where the yo is the value of y coordinate, and it is 0 for the first sink, while xc represents the center point of the x coordinate in the network and is obtained as
(2)xc=totallenghtofx−axis2.The positions of the second, third, fourth, and fifth sinks are(3)s2x,y=xc,yo+a,(4)s3x,y=xc,yo+2a,(5)s4x,y=xc,yo+3a,(6)s5x,y=xc,yo+4a,where a=100. The sink has a greater energy resource than the other nodes. The nodes communicate with each other or sink through acoustic waves with a data rate of m bit/sec and frequency f KHz. The base station collects all the data from the sinks for further processing and analysis as considered in [16].


## 3.1.2. Knowledge Acquisition

After sinks’ and nodes’ placement, information about the nodes and sinks are exchanged with each other. In order to minimize the data overhead, traffic congestion, and energy expenditure, information acquisition takes place in parts. The purpose of information or knowledge acquisition is to find the distance of nodes from the sink and their neighbors to select the best candidates for data forwarding. In the first part, the sink broadcasts data of one bit in order to inform the nodes in its transmission area. The node within the transmission area of the sink receives the data. In response to this data, each node transmits INFO PACKET, which contains the ID of that node. As the node broadcasts the INFO PACKET, it set a timer and starts measuring the time. When the sink receives the INFO PACKET, it updates the INFO PACKET by embedding its own information and transmits it towards that node. When the node receives the updated INFO PACKET, it stops the timer and notes its one-way transmission timet. The node finds its distance d from the sink by d=vt, where v denotes the acoustic wave speed.In the second part, the other nodes send INFO PACKET and start time counting. In response to this, the nodes which have calculated their distance now respond to other nodes. The node then calculates its distance from each respondent node and its distance from the sink. The sink distance is added to nodes’ mutual distance. The INFO PACKET format is given in Figure3.Figure 3
Structure of INFO PACKET.In order to enhance network performances, further, updating of information is not done very frequently. However, information acquisition occurred after some interval of time. The updating process is necessary to find its recent and most suitable neighbor for data forwarding.


## 3.1.3. Data Forwarding

To enhance the network performance, the sender-based approach is a preferred choice in the proposed algorithm. In a sender-based approach, the sender decides its next forwarder which reduces the data forwarding time and computational cost. The reduction of computational cost leads to less energy cost. The nodes near to the sink and lying in sink’s transmission area directly communicate with it as shown in Figure4. These nodes do not need any further route for data delivery. The nodes which are far away from the sink and cannot exchange data with the sink directly follow a multihop communication.Figure 4
Data exchanging directly with sink.In order to deliver the data quickly, the proposed algorithms follow the shortest route towards the sink by using distance from the destination. Before broadcasting of the data from the sender, it arranges all its neighbours in descending order based on distance information to assign priority to each neighbour. Another word, the nodes having the nearest to the sink, is assigned the first priority for data delivery. When the sender arrange all its neighbours, then it forwards the data packet. Figure5 depicts and elaborates the packet forwarding scenario. The packet header contains the complete information of the forwarder, final sink, and its own information. The header contains the sender ID, forwarder ID, and the sink ID. After the header data is appended with, they analyze the packet and look for its own ID. When the neighbour ID matches with the ID in the packet, then forward the data packet towards the next stage using the same procedure. The other nodes which receive the data from the sender holds the data for a while, because this data held by the nodes will be utilized in it improved cooperative version of the proposed MuLSi.Figure 5
Data exchanging with sink through forwarder.The nodes are far away from the sink and follow path to the sink. There are two scenarios of possible position of the neighbours. When these are at different distance from the same, then the sender gives priority to the node which is near to the sink. On another hand, when the nodes are the same distance from the sink, then the sender is free to select anyone of these nodes. Although the second scenario has low chances to occur, it is considered in the proposed algorithm.It is considered that each sink communicates and forwards its data to the sink placed in the upper layer. The sink placed at the top of the network communicates with the base station. It exchanges all its data with the base station for further processing and analyzing.


## 3.1.4. Suppression of Redundant Packets and Acknowledgment

The proposed algorithms tries to control the redundant packet transmission by utilizing the broadcast nature of the nodes. When these nodes overhear the same packet, then they delete the packet from its memory. They consider that the data is delivered to the next destination. In order to reduce the traffic congestion, data overhead, and energy cost, the acknowledgment is not considered in the proposed algorithm.


## 3.2. MULSI-Co: Multilayer Sink Algorithm with Cooperation

In the unpredictable and high noise availability in the underwater, a single link is not feasible for communication. The retransmission of the data through the same link is not a good choice, because the data reception through the same link has high chances of data corruption again, which will tend to waste energy and high latency in the data exchanging. The proposed MuLSi algorithm follows a single link for exchanging of data. In order to increase the reliable data reception at the destination of the proposed MuLSi algorithm, the cooperation technique is added to it. Delivery of the same data over many paths towards the destination is known as cooperation. This increases the correct reception of the data with a cost of more energy and latency than the noncooperative methods. This section gives the details of the proposed MuLSi-Co algorithm.


### 3.2.1. Cooperative Relay Identification

The important step in cooperation is the relay selection. The best relay selection amongst the neighbors tends to improve the performance. The cooperation technique is reliable, but its cost in terms of energy and delay are greater. So, to minimize the delay and reduce the channel effects, the proposed MuLSi-Co selects the relay which is the nearest to the final destination.During the knowledge acquisition phase in the MuLSi algorithm, each node has its neighbours list along with their distance information. If the sink is not reachable by the sender directly, then amongst these neighbours, the node which is the nearest to the sink is considered as the forwarder, and the nearer node is selected as relay by the sender. If the sender can exchange its data directly with the sink, then the nearest node is selected as the relay. These relays cooperate with forwarders and destinations to improve reliability.


### 3.2.2. Data Exchanging and Synchronization

After identification of the relay and forwarder/destination by the sender, the next phase is about data exchanging. Whenever the sender wants to deliver its packet, it appends the information of the relay and forwarder/destination. The sender, relay, and forwarder/destination IDs are appended with the data. In case of the direct communication with the sink, the sender appends the ID to it. Otherwise, the node nearest to the sink works as a forwarder, and the sender declares it as a forwarder and appends its ID. And the next node ID is appended as a relay.Whenever the data is received by any node from any sender, then the node searches for its own ID in the packet. If it finds its own ID in the data as forwarder, this node can work as a forwarder for that sender. The relay also searches for its own ID and works as a relay. When the forwarder receives a packet, it waits for a while to receive its copy from the relay. The data received by the relay is delivered to the forwarder as it is received. The other nodes which hear the data ignore it and become silent. Whenever there is no relay, the forwarder does not wait and deliver it to the next stage without cooperation. The forwarder knows the relay by analyzing the packet.The time and data synchronization are one of the most challenging stage in cooperation. The delivery of the data by the relay in the exact time is important to improve performance. Therefore, for simplicity, the proposed MuLSi-Co routing is designed in a manner to handle the time synchronization between the relay and forwarder. Whenever the relay receives the data, it forwards it without any wait and holding. Due to the broadcast nature of the nodes, all neighbours hear the data. These neighbors check for its own ID in the data. If they do not find its ID, then they ignore the data. This reduces the duplicate packet transmission and improves the energy cost.


### 3.2.3. Cooperation and Data Combining Model

In the proposed cooperative algorithm, the data advancement occurs in three steps. In the first step, the sender advances its data to the forwarder and relay. In the second step, the forwarder holds the data for a while and waits for the relay data. As the relay receives data, it sends it to the forwarder. In the third state, two copies of the same data are merged to make one reliable data packet from these.Considering three nodes, senderj, receiver or forwarder k, and relay l are depicted in Figure 6. In the first stage, the j broadcasts the generated data Tj towards the k and l. The received signal Rjk at k is given as
(7)Rjk=gjkTj+njk.Figure 6
Cooperation model.The channel noisenjk and the fading gjk affects the data when transmitting from the j to k. Likewise, putting a subscript jl to n and g indicates the noise and fading between j and l. The received data Rjl is represented as
(8)Rjl=gjlTj+njl.In the second stage, the forwarder/receiverk waits for the copy of the same data packet from the l. As l receives the data in the first stage, it analyze it. In case the l finds himself eligible for data forwarding, it forwards the data Tl to the k without any holding. The factors which influence the data transmission between l and k are the channel noise nlk and fading glk. The l receives the data Rlk and is given as
(9)Rlk=glkTl+nlk.In the third stage,k has a direct received packet Rjk and its copy Rlk received through l. Now, the k combines these data using maximal ratio combining. The combined data is given as
(10)Rk=Rjk+RjlRlk1+Rjl+Rlk.


## 3.2.1. Cooperative Relay Identification

The important step in cooperation is the relay selection. The best relay selection amongst the neighbors tends to improve the performance. The cooperation technique is reliable, but its cost in terms of energy and delay are greater. So, to minimize the delay and reduce the channel effects, the proposed MuLSi-Co selects the relay which is the nearest to the final destination.During the knowledge acquisition phase in the MuLSi algorithm, each node has its neighbours list along with their distance information. If the sink is not reachable by the sender directly, then amongst these neighbours, the node which is the nearest to the sink is considered as the forwarder, and the nearer node is selected as relay by the sender. If the sender can exchange its data directly with the sink, then the nearest node is selected as the relay. These relays cooperate with forwarders and destinations to improve reliability.


## 3.2.2. Data Exchanging and Synchronization

After identification of the relay and forwarder/destination by the sender, the next phase is about data exchanging. Whenever the sender wants to deliver its packet, it appends the information of the relay and forwarder/destination. The sender, relay, and forwarder/destination IDs are appended with the data. In case of the direct communication with the sink, the sender appends the ID to it. Otherwise, the node nearest to the sink works as a forwarder, and the sender declares it as a forwarder and appends its ID. And the next node ID is appended as a relay.Whenever the data is received by any node from any sender, then the node searches for its own ID in the packet. If it finds its own ID in the data as forwarder, this node can work as a forwarder for that sender. The relay also searches for its own ID and works as a relay. When the forwarder receives a packet, it waits for a while to receive its copy from the relay. The data received by the relay is delivered to the forwarder as it is received. The other nodes which hear the data ignore it and become silent. Whenever there is no relay, the forwarder does not wait and deliver it to the next stage without cooperation. The forwarder knows the relay by analyzing the packet.The time and data synchronization are one of the most challenging stage in cooperation. The delivery of the data by the relay in the exact time is important to improve performance. Therefore, for simplicity, the proposed MuLSi-Co routing is designed in a manner to handle the time synchronization between the relay and forwarder. Whenever the relay receives the data, it forwards it without any wait and holding. Due to the broadcast nature of the nodes, all neighbours hear the data. These neighbors check for its own ID in the data. If they do not find its ID, then they ignore the data. This reduces the duplicate packet transmission and improves the energy cost.


## 3.2.3. Cooperation and Data Combining Model

In the proposed cooperative algorithm, the data advancement occurs in three steps. In the first step, the sender advances its data to the forwarder and relay. In the second step, the forwarder holds the data for a while and waits for the relay data. As the relay receives data, it sends it to the forwarder. In the third state, two copies of the same data are merged to make one reliable data packet from these.Considering three nodes, senderj, receiver or forwarder k, and relay l are depicted in Figure 6. In the first stage, the j broadcasts the generated data Tj towards the k and l. The received signal Rjk at k is given as
(7)Rjk=gjkTj+njk.Figure 6
Cooperation model.The channel noisenjk and the fading gjk affects the data when transmitting from the j to k. Likewise, putting a subscript jl to n and g indicates the noise and fading between j and l. The received data Rjl is represented as
(8)Rjl=gjlTj+njl.In the second stage, the forwarder/receiverk waits for the copy of the same data packet from the l. As l receives the data in the first stage, it analyze it. In case the l finds himself eligible for data forwarding, it forwards the data Tl to the k without any holding. The factors which influence the data transmission between l and k are the channel noise nlk and fading glk. The l receives the data Rlk and is given as
(9)Rlk=glkTl+nlk.In the third stage,k has a direct received packet Rjk and its copy Rlk received through l. Now, the k combines these data using maximal ratio combining. The combined data is given as
(10)Rk=Rjk+RjlRlk1+Rjl+Rlk.


## 4. Analysis and Simulation Results

Validation of the results and network implementation of the proposed schemes are accomplished using MATLAB simulations. The dimension of the network is taken 500 m. The network is further split into five layers having an equal size of 100 m2. The purpose of making such layers is to collect data with easiness and quickly. Moreover, it increases the stability and reliability of these networks. The sink at the top of every layer is placed for data collection and information acquisition of the nodes. The nodes are homogeneous in all aspects scattered randomly in the networks. The total amount of energy on each node is 20 J. These nodes are capable of detecting different environment parameters, for example, temperature and pressures. The LinkQuest UMW 2000 cite modem is coupled with every node for data exchanging. The energy expenditure according to the modem used is considered for transmission and reception are 2 W and 0.8 W, respectively, while the idle state or sleep mode energy exhaustion is 8 mW. Moreover, the data transmission rate is 9600 bps. For the sake of reducing the computational complexity, the data is considered dropped when the channel is busy. The proposed MuLSi and MuLSi-Co schemes are compared with some existing techniques DBR and CoDBR from the literature. The motivation behind choosing these competitive algorithms is the same network architecture, topology, and cooperative behavior of the nodes. An overview of all these algorithms are given in Table 3.Table 3
Analysis of the proposed and counterpart algorithms.
ProtocolRouting parameterRoutingNetwork structureDBRDepthMultihopSingleCoDBRDepthMultihop cooperationSingleMuLSiDistanceMultihopMulti layersMuLSi-CoDistanceMultihop cooperationMulti layers


### 4.1. Packet Delivery Ratio (PDR) or Packet Acceptance Ration (PAR)

The ratio of the number of correct packet reception to the total sent packets is termed as PDR or PAR. The PDR performance is give in Figure7. The order of algorithm based on PDR performance from highest to the lowest is MuLSi- Co, CoDBR, MuLSi, and then, DBR. The highest PDR of the proposed MuLSi-Co is due to the sink placement and cooperation. The sink placement in every layer ensures the data reception with the lowest delay than the other schemes, which tends to less effect of the data. Both the MuLSIi-Co and CoDBR are cooperative schemes. However, the sink placement in the proposed cooperative algorithm reduces the path losses and improves the packet reception. In result, the proposed cooperative technique has the highest PDR. Moreover, the best destination and cooperative node selection is another reason of the highest PDR in MuLSi-Co algorithm. The second reason behind the highest performance is the cooperation. Incorrect data are exchanged with the retransmitted data by the cooperative node, which makes sure the correct packet reception at the destination.Figure 7
Packet delivery ratio (PDR).The CoDBR algorithm PDR has the best performance than the noncooperative schemes, MuLSi and DBR, due to the cooperation and multiple paths are followed for data delivery. The same packets received through many paths are then combined to improve the packet reception and lead to the highest PDR than the noncooperative algorithms.The MuLSi has the higher PDR than the competitor scheme DBR. It is because of the network topology and node selection using distance parameter for data advancement towards the final destination. The sink placement in each layer and the distance parameter reduce the path for data delivery. This tends to reduce the effects of the channel attributes and increases the probability of correct data reception, while in DBR, the depth is utilized for data forwarding, and the sinks are at the top which are far away from the bottom nodes. Therefore, this increases the channel effect on the data and degrades the packet reception and tends to the lowest PDR. More detail PDR performance is given in Table4.Table 4
PDR.
ProtocolPDR at round 1PDR at round 100PDR at round 200PDR at round 300PDR at round 400PDR at round 500PDR at round 600PDR at round 700PDR at round 800PDR at round 900MuLSi-Co1.00000.69710.60350.54030.48460.44570.42990.42600.42550.4264MuLSi0.46670.49590.40450.37670.34530.32370.30750.29840.29510.2944CoDBR1.00000.62850.49720.42830.38890.36490.34920.34120.33830.3375DBR0.48000.44010.36740.31440.28080.26060.24880.24320.24070.2402


### 4.2. Correct Received Packets

The successful received packet results are shown in Figure8. The proposed cooperative algorithm has the highest number of received packets. It is due to the data forwarding on multiple paths towards the sink node. The same packet is received through multiple paths and then combined, which increases the probability of correct data reception. Moreover, the sink placement also enhances the probability of correct data reception. Most of the nodes are directly exchange data with the sink. All these parameters lead to the highest data packet reception.Figure 8
Received packets.The proposed MuLSi algorithm has the highest packet reception than the counterpart algorithms after 230 rounds, although it is a noncooperative algorithm due to well placement of sink nodes and the node selection for data forwarding. The sinks are near to the nodes which exchange data easily, and the channel effects are less on the data. Also, the distance parameter chooses the nearest node to destination. All these factors lead to the highest packet reception.The CoDBR has the highest packet reception up to 230 rounds. Due to the cooperation of the nodes, the packet reception probability is the highest at the start. Onward, the death ratio of the nodes in CoDBR is high due to the multiple forwards for a single-packet delivery. The multiple forwarders lead to excessive energy consumption and have less chance of cooperation at the end. Therefore, the packet reception becomes lower than the proposed MuLSi algorithm. On the other hand, the DBR has the lowest packet reception due the noncooperative algorithm. The analysis of the packet reception of all these schemes is shown in Table5.Table 5
Received packet analysis.
ProtocolReceived packets at round 1Received packets at round 100Received packets at round 200Received packets at round 300Received packets at round 400Received packets at round 500Received packets at round 600Received packets at round 700Received packets at round 800Received packets at round 900MuLSi-Co225155892575532361352103620837108378243840638902MuLSi105112521785024087278093002130750310303122931442CoDBR225136821907621361225022314823405235532361023610DBR10898891546518092190931942619638196781967819678


### 4.3. Energy Expenditure and Residual Energy Analysis

The energy expenditure is one of the most important parameter for performance evaluation especially in UA-WSNs. The corresponding results are given in Figure9. Due to the cooperation mechanism, the consumption of energy in CoDBR is the highest than all other schemes. In cooperation, the data is delivered through multiple paths to the destination. The multipath transmission of the same data tends to consume excessive energy and leads to increase the overall expenditure in terms of energy.Figure 9
Energy consumption.The DBR consumes the highest amount of energy than the remaining algorithms, due the involvement of many nodes for data advancement towards the sink leads to more energy consumption. Another reason of such high-energy expenditure is of the data burden on the top nodes in the network. The top nodes are selected again and again by the lowest nodes to deliver the data. In result, the consumption is the highest than MuLSi-Co and MuLSi. Although MuLSi-Co is a cooperative algorithm, its energy expenditure is lower than the noncooperative algorithm DBR. It is due to the longest route followed for data transmission, and sinks are far away from the bottom nodes in DBR.The MuLSi-Co has the higher energy consumption than MuLSi algorithm. In MuLSi-Co, for increasing the reliability of the network, the cooperative behaviour of the node is utilised. The cooperation of the nodes tends to consume excessive energy and leads to less network lifetime, while in MuLSi, the multilayer network structure and sink placement at the optimal position reduce the path length and node involvement in the data forwarding. Therefore, the resultant energy expenditure of the proposed MuLSi algorithm is the lowest than all other algorithms. The energy performance evaluation is given in detail in Table6. The above discussion is conversely true for the residual energy and is shown in Figure 10.Table 6
Residual energy analysis.
ProtocolResidual energy at round 1Residual energy at round 100Residual energy at round 200Residual energy at round 300Residual energy at round 400Residual energy at round 500Residual energy at round 600Residual energy at round 700Residual energy at round 800Residual energy at round 900MuLSi-Co2.2499×1031.5577×1031.0187×103592.5394307.6515151.772266.770130.849613.06752.4202MuLSi2.2499×1031.7196×1031.2608×103831.2838469.9592234.0915106.156141.896614.00332.8491CoDBR2.2499×1031.1205×103572.6635293.6711157.378776.124033.075710.18171.74830DBR2.2499×1031.3937×103804.4937412.6768200.110593.967933.872510.95211.86180.1186Figure 10
Residual energy.


### 4.4. Alive and Dead Node Analysis

The analysis of these algorithms with reference to dead nodes is shown in Figure11, also with more details in Table 7. The dead nodes in CoDBR algorithm are the highest than the rest of algorithms. As discussed, the network energy expenditure is the highest due to cooperation, and many nodes take part in single-packet delivery. Therefore, in the result, it is concluded that the nodes are spending high amount of energy and tends to greatest number of dead nodes. So, the overall performance of the dead nodes is the highest than the rest of the algorithms.Figure 11
Alive nodes.Table 7
Dead node analysis.
ProtocolDead nodes at round 1Dead nodes at round 100Dead nodes at round 200Dead nodes at round 300Dead nodes at round 400Dead nodes at round 500Dead nodes at round 600Dead nodes at round 700Dead nodes at round 800Dead nodes at round 900MuLSi-Co093177118154189208213217MuLSi03144378124172196211217CoDBR03381130158179197210221225DBR0134991138170196213222224The DBR has the highest number of dead nodes than the proposed algorithm. For a single-packet delivery, many nodes participate. Due to the involvement of many nodes, they consume a greater amount of energy and tend to increase its death ratio. Therefore, the resultant dead node in DBR is the highest than the proposed algorithm.On another hand, both the proposed algorithms have the lowest number of dead nodes than the competitor. Due to the well management of network architecture, sink placement and best node selection during data transmission lead to less energy consumption. The less amount of energy consumption also decreased the number of dead nodes in the network. Therefore, the resultant dead nodes are the highest than the counterpart, while, comparing the proposed noncooperative MuLSi with cooperative MuLSi-Co algorithm, the cooperative algorithm has the higher number of dead nodes. It is because of the greater number of forwarder nodes in the MuLSi-Co algorithm. This discussion is true conversely for the alive nodes and is shown in Figure12.Figure 12
Dead nodes.


## 4.1. Packet Delivery Ratio (PDR) or Packet Acceptance Ration (PAR)

The ratio of the number of correct packet reception to the total sent packets is termed as PDR or PAR. The PDR performance is give in Figure7. The order of algorithm based on PDR performance from highest to the lowest is MuLSi- Co, CoDBR, MuLSi, and then, DBR. The highest PDR of the proposed MuLSi-Co is due to the sink placement and cooperation. The sink placement in every layer ensures the data reception with the lowest delay than the other schemes, which tends to less effect of the data. Both the MuLSIi-Co and CoDBR are cooperative schemes. However, the sink placement in the proposed cooperative algorithm reduces the path losses and improves the packet reception. In result, the proposed cooperative technique has the highest PDR. Moreover, the best destination and cooperative node selection is another reason of the highest PDR in MuLSi-Co algorithm. The second reason behind the highest performance is the cooperation. Incorrect data are exchanged with the retransmitted data by the cooperative node, which makes sure the correct packet reception at the destination.Figure 7
Packet delivery ratio (PDR).The CoDBR algorithm PDR has the best performance than the noncooperative schemes, MuLSi and DBR, due to the cooperation and multiple paths are followed for data delivery. The same packets received through many paths are then combined to improve the packet reception and lead to the highest PDR than the noncooperative algorithms.The MuLSi has the higher PDR than the competitor scheme DBR. It is because of the network topology and node selection using distance parameter for data advancement towards the final destination. The sink placement in each layer and the distance parameter reduce the path for data delivery. This tends to reduce the effects of the channel attributes and increases the probability of correct data reception, while in DBR, the depth is utilized for data forwarding, and the sinks are at the top which are far away from the bottom nodes. Therefore, this increases the channel effect on the data and degrades the packet reception and tends to the lowest PDR. More detail PDR performance is given in Table4.Table 4
PDR.
ProtocolPDR at round 1PDR at round 100PDR at round 200PDR at round 300PDR at round 400PDR at round 500PDR at round 600PDR at round 700PDR at round 800PDR at round 900MuLSi-Co1.00000.69710.60350.54030.48460.44570.42990.42600.42550.4264MuLSi0.46670.49590.40450.37670.34530.32370.30750.29840.29510.2944CoDBR1.00000.62850.49720.42830.38890.36490.34920.34120.33830.3375DBR0.48000.44010.36740.31440.28080.26060.24880.24320.24070.2402


## 4.2. Correct Received Packets

The successful received packet results are shown in Figure8. The proposed cooperative algorithm has the highest number of received packets. It is due to the data forwarding on multiple paths towards the sink node. The same packet is received through multiple paths and then combined, which increases the probability of correct data reception. Moreover, the sink placement also enhances the probability of correct data reception. Most of the nodes are directly exchange data with the sink. All these parameters lead to the highest data packet reception.Figure 8
Received packets.The proposed MuLSi algorithm has the highest packet reception than the counterpart algorithms after 230 rounds, although it is a noncooperative algorithm due to well placement of sink nodes and the node selection for data forwarding. The sinks are near to the nodes which exchange data easily, and the channel effects are less on the data. Also, the distance parameter chooses the nearest node to destination. All these factors lead to the highest packet reception.The CoDBR has the highest packet reception up to 230 rounds. Due to the cooperation of the nodes, the packet reception probability is the highest at the start. Onward, the death ratio of the nodes in CoDBR is high due to the multiple forwards for a single-packet delivery. The multiple forwarders lead to excessive energy consumption and have less chance of cooperation at the end. Therefore, the packet reception becomes lower than the proposed MuLSi algorithm. On the other hand, the DBR has the lowest packet reception due the noncooperative algorithm. The analysis of the packet reception of all these schemes is shown in Table5.Table 5
Received packet analysis.
ProtocolReceived packets at round 1Received packets at round 100Received packets at round 200Received packets at round 300Received packets at round 400Received packets at round 500Received packets at round 600Received packets at round 700Received packets at round 800Received packets at round 900MuLSi-Co225155892575532361352103620837108378243840638902MuLSi105112521785024087278093002130750310303122931442CoDBR225136821907621361225022314823405235532361023610DBR10898891546518092190931942619638196781967819678


## 4.3. Energy Expenditure and Residual Energy Analysis

The energy expenditure is one of the most important parameter for performance evaluation especially in UA-WSNs. The corresponding results are given in Figure9. Due to the cooperation mechanism, the consumption of energy in CoDBR is the highest than all other schemes. In cooperation, the data is delivered through multiple paths to the destination. The multipath transmission of the same data tends to consume excessive energy and leads to increase the overall expenditure in terms of energy.Figure 9
Energy consumption.The DBR consumes the highest amount of energy than the remaining algorithms, due the involvement of many nodes for data advancement towards the sink leads to more energy consumption. Another reason of such high-energy expenditure is of the data burden on the top nodes in the network. The top nodes are selected again and again by the lowest nodes to deliver the data. In result, the consumption is the highest than MuLSi-Co and MuLSi. Although MuLSi-Co is a cooperative algorithm, its energy expenditure is lower than the noncooperative algorithm DBR. It is due to the longest route followed for data transmission, and sinks are far away from the bottom nodes in DBR.The MuLSi-Co has the higher energy consumption than MuLSi algorithm. In MuLSi-Co, for increasing the reliability of the network, the cooperative behaviour of the node is utilised. The cooperation of the nodes tends to consume excessive energy and leads to less network lifetime, while in MuLSi, the multilayer network structure and sink placement at the optimal position reduce the path length and node involvement in the data forwarding. Therefore, the resultant energy expenditure of the proposed MuLSi algorithm is the lowest than all other algorithms. The energy performance evaluation is given in detail in Table6. The above discussion is conversely true for the residual energy and is shown in Figure 10.Table 6
Residual energy analysis.
ProtocolResidual energy at round 1Residual energy at round 100Residual energy at round 200Residual energy at round 300Residual energy at round 400Residual energy at round 500Residual energy at round 600Residual energy at round 700Residual energy at round 800Residual energy at round 900MuLSi-Co2.2499×1031.5577×1031.0187×103592.5394307.6515151.772266.770130.849613.06752.4202MuLSi2.2499×1031.7196×1031.2608×103831.2838469.9592234.0915106.156141.896614.00332.8491CoDBR2.2499×1031.1205×103572.6635293.6711157.378776.124033.075710.18171.74830DBR2.2499×1031.3937×103804.4937412.6768200.110593.967933.872510.95211.86180.1186Figure 10
Residual energy.


## 4.4. Alive and Dead Node Analysis

The analysis of these algorithms with reference to dead nodes is shown in Figure11, also with more details in Table 7. The dead nodes in CoDBR algorithm are the highest than the rest of algorithms. As discussed, the network energy expenditure is the highest due to cooperation, and many nodes take part in single-packet delivery. Therefore, in the result, it is concluded that the nodes are spending high amount of energy and tends to greatest number of dead nodes. So, the overall performance of the dead nodes is the highest than the rest of the algorithms.Figure 11
Alive nodes.Table 7
Dead node analysis.
ProtocolDead nodes at round 1Dead nodes at round 100Dead nodes at round 200Dead nodes at round 300Dead nodes at round 400Dead nodes at round 500Dead nodes at round 600Dead nodes at round 700Dead nodes at round 800Dead nodes at round 900MuLSi-Co093177118154189208213217MuLSi03144378124172196211217CoDBR03381130158179197210221225DBR0134991138170196213222224The DBR has the highest number of dead nodes than the proposed algorithm. For a single-packet delivery, many nodes participate. Due to the involvement of many nodes, they consume a greater amount of energy and tend to increase its death ratio. Therefore, the resultant dead node in DBR is the highest than the proposed algorithm.On another hand, both the proposed algorithms have the lowest number of dead nodes than the competitor. Due to the well management of network architecture, sink placement and best node selection during data transmission lead to less energy consumption. The less amount of energy consumption also decreased the number of dead nodes in the network. Therefore, the resultant dead nodes are the highest than the counterpart, while, comparing the proposed noncooperative MuLSi with cooperative MuLSi-Co algorithm, the cooperative algorithm has the higher number of dead nodes. It is because of the greater number of forwarder nodes in the MuLSi-Co algorithm. This discussion is true conversely for the alive nodes and is shown in Figure12.Figure 12
Dead nodes.


## 5. Conclusion

To design and configure an efficient, reliable, and stable algorithm for underwater acoustic wireless sensor networks (UA-WSNs) needs great attention on account of its notable and distinctive challenges and amazing applications. The energy-efficient operation of these networks takes care of their working and running for a longer time and tends to have more stability. The best network structure reduces the number of multiple hops between the sender and destination; this leads to less energy cost and minimized effects of the channel on data. To increase the reliable data exchanging, the cooperation is the best and suitable choice instead of other costly and complex techniques. However, in cooperative techniques, the excessive expenditure of energy makes it challenging. Moreover, the time and data synchronization are also crucial issues in cooperation. To address these difficulties, the article introduces two algorithms: multilayer sink (MuLSi) algorithm and its reliable version MuLSi-Co using the cooperation technique. The first algorithm proposes a multiple-layered network structure instead of a solid single structure and sink placement at the optimal position. This reduces the multiple hops between the sender and sink. Moreover, the best forwarder selection amongst nodes based on the node closeness to sink makes the network performances more better and valuable. The node closest to the sink is a good choice for choosing the best forwarder. However, the MuLSi algorithm does not fulfil the requirement of reliable operation due to a single link for data exchanging. Unlike the traditional algorithms, the proposed scheme does not need the location information about nodes.



---

*Source: 4840481-2022-01-15.xml*