The Potential of Deep Learning in Underwater Wireless Sensor Networks and Noise Canceling for the Effective Monitoring of Aquatic Life.

This paper describes a revolutionary design paradigm for monitoring aquatic life. This unique methodology addresses issues such as limited memory, insufficient bandwidth, and excessive noise levels by combining two approaches to create a comprehensive predictive filtration system, as well as multiple-transfer route analysis. This work focuses on proposing a novel filtration learning approach for underwater sensor nodes. This model was created by merging two adaptive filters, the finite impulse response (FIR) and the adaptive line enhancer (ALE). The FIR integrated filter eliminates unwanted noise from the signal by obtaining a linear response phase and passes the signal without distortion. The goal of the ALE filter is to properly separate the noise signal from the measured signal, resulting in the signal of interest. The cluster head level filters are the adaptive cuckoo filter (ACF) and the Kalman filter. The ACF assesses whether an emitter node is part of a set or not. The Kalman filter improves the estimation of state values for a dynamic underwater sensor networking system. It uses distributed learning long short-term memory (LSTM-CNN) technology to ensure that the anticipated value of the square of the gap between the prediction and the correct state is the smallest possible. Compared to prior methods, our suggested deep filtering-learning model achieved 98.5% of the sensory filtration method in the majority of the obtained data and close to 99.1% of an adaptive prediction method, while also consuming little energy during lengthy monitoring.

GTR: GAN-Based Trusted Routing Algorithm for Underwater Wireless Sensor Networks.

The transmission environment of underwater wireless sensor networks is open, and important transmission data can be easily intercepted, interfered with, and tampered with by malicious nodes. Malicious nodes can be mixed in the network and are difficult to distinguish, especially in time-varying underwater environments. To address this issue, this article proposes a GAN-based trusted routing algorithm (GTR). GTR defines the trust feature attributes and trust evaluation matrix of underwater network nodes, constructs the trust evaluation model based on a generative adversarial network (GAN), and achieves malicious node detection by establishing a trust feature profile of a trusted node, which improves the detection performance for malicious nodes in underwater networks under unlabeled and imbalanced training data conditions. GTR combines the trust evaluation algorithm with the adaptive routing algorithm based on Q-Learning to provide an optimal trusted data forwarding route for underwater network applications, improving the security, reliability, and efficiency of data forwarding in underwater networks. GTR relies on the trust feature profile of trusted nodes to distinguish malicious nodes and can adaptively select the forwarding route based on the status of trusted candidate next-hop nodes, which enables GTR to better cope with the changing underwater transmission environment and more accurately detect malicious nodes, especially unknown malicious node intrusions, compared to baseline algorithms. Simulation experiments showed that, compared to baseline algorithms, GTR can provide a better malicious node detection performance and data forwarding performance. Under the condition of 15% malicious nodes and 10% unknown malicious nodes mixed in, the detection rate of malicious nodes by the underwater network configured with GTR increased by 5.4%, the error detection rate decreased by 36.4%, the packet delivery rate increased by 11.0%, the energy tax decreased by 11.4%, and the network throughput increased by 20.4%.

Energy-Efficient Data Transmission for Underwater Wireless Sensor Networks: A Novel Hierarchical Underwater Wireless Sensor Transmission Framework.

The complexity of the underwater environment enables significant energy consumption of sensor nodes for communication with base stations in underwater wireless sensor networks (UWSNs), and the energy consumption of nodes in different water depths is unbalanced. How to improve the energy efficiency of sensor nodes and meanwhile balance the energy consumption of nodes in different water depths in UWSNs are thus urgent concerns. Therefore, in this paper, we first propose a novel hierarchical underwater wireless sensor transmission (HUWST) framework. We then propose a game-based, energy-efficient underwater communication mechanism in the presented HUWST. It improves the energy efficiency of the underwater sensors personalized according to the various water depth layers of sensor locations. In particular, we integrate the economic game theory in our mechanism to trade off variations in communication energy consumption due to sensors in different water depth layers. Mathematically, the optimal mechanism is formulated as a complex nonlinear integer programming (NIP) problem. A new energy-efficient distributed data transmission mode decision algorithm (E-DDTMD) based on the alternating direction method of multipliers (ADMM) is thus further proposed to tackle this sophisticated NIP problem. The systematic simulation results demonstrate the effectiveness of our mechanism in improving the energy efficiency of UWSNs. Moreover, our presented E-DDTMD algorithm achieves significantly superior performance to the baseline schemes.

Void Avoiding Opportunistic Routing Protocols for Underwater Wireless Sensor Networks: A Survey.

One of the most challenging issues in the routing protocols for underwater wireless sensor networks (UWSNs) is the occurrence of void areas (communication void). That is, when void areas are present, the data packets could be trapped in a sensor node and cannot be sent further to reach the sink(s) due to the features of the UWSNs environment and/or the configuration of the network itself. Opportunistic routing (OR) is an innovative prototype in routing for UWSNs. In routing protocols employing the OR technique, the most suitable sensor node according to the criteria adopted by the protocol rules will be elected as a next-hop forwarder node to forward the data packets first. This routing method takes advantage of the broadcast nature of wireless sensor networks. OR has made a noticeable improvement in the sensor networks' performance in terms of efficiency, throughput, and reliability. Several routing protocols that utilize OR in UWSNs have been proposed to extend the lifetime of the network and maintain its connectivity by addressing void areas. In addition, a number of survey papers were presented in routing protocols with different points of approach. Our paper focuses on reviewing void avoiding OR protocols. In this paper, we briefly present the basic concept of OR and its building blocks. We also indicate the concept of the void area and list the reasons that could lead to its occurrence, as well as reviewing the state-of-the-art OR protocols proposed for this challenging area and presenting their strengths and weaknesses.

Energy-Efficient Routing Protocol for Selecting Relay Nodes in Underwater Sensor Networks Based on Fuzzy Analytical Hierarchy Process.

The use of underwater sensor networks (UWSNs) offers great advantages in many automatic observation services such as water monitoring (ocean, sea, etc.) and registering of geological events (landslides, earthquakes). However, UWSNs have many more limitations than terrestrial sensor networks (smaller bandwidth, higher delays, etc.) with new requirements such as low power consumption by nodes or being able to select appropriate routes in a dynamic topology due to water currents and movements. To cope with these problems, the use of a routing protocol is very important. In this paper we propose a routing technique that adapts to changes in the network topology, avoiding multiple retransmissions that would affect its overall performance. This protocol is energy-efficient and is implemented using a fuzzy analytical hierarchical process (FAHP) under multi-criteria decision making (MCDM) to make an intelligent routing decision based on objectives, criteria and alternatives. To select the next node on the route, several comparison matrices are used: number of hops, distances to the sink node, and number of neighbors. The results show that the proposed setup behaves similarly to other existing underwater sensor network routing schemes using fuzzy schemes such as SPRINT.

Cooperative Energy-Efficient Routing Protocol for Underwater Wireless Sensor Networks.

Underwater wireless sensor networks (UWSNs) contain sensor nodes that sense the data and then transfer them to the sink node or base station. Sensor nodes are operationalized through limited-power batteries. Therefore, improvement in energy consumption becomes critical in UWSNs. Data forwarding through the nearest sensor node to the sink or base station reduces the network's reliability and stability because it creates a hotspot and drains the energy early. In this paper, we propose the cooperative energy-efficient routing (CEER) protocol to increase the network lifetime and acquire a reliable network. We use the sink mobility scheme to reduce energy consumption by eliminating the hotspot issue. We have divided the area into multiple sections for better deployment and deployed the sink nodes in each area. Sensor nodes generate the data and send it to the sink nodes to reduce energy consumption. We have also used the cooperative technique to achieve reliability in the network. Based on simulation results, the proposed scheme performed better than existing routing protocols in terms of packet delivery ratio (PDR), energy consumption, transmission loss, and end-to-end delay.

EP-ADTA: Edge Prediction-Based Adaptive Data Transfer Algorithm for Underwater Wireless Sensor Networks (UWSNs).

The underwater wireless sensor network is an important component of the underwater three-dimensional monitoring system. Due to the high bit error rate, high delay, low bandwidth, limited energy, and high dynamic of underwater networks, it is very difficult to realize efficient and reliable data transmission. Therefore, this paper posits that it is not enough to design the routing algorithm only from the perspective of the transmission environment; the comprehensive design of the data transmission algorithm should also be combined with the application. An edge prediction-based adaptive data transmission algorithm (EP-ADTA) is proposed that can dynamically adapt to the needs of underwater monitoring applications and the changes in the transmission environment. EP-ADTA uses the end-edge-cloud architecture to define the underwater wireless sensor networks. The algorithm uses communication nodes as the agents, realizes the monitoring data prediction and compression according to the edge prediction, dynamically selects the transmission route, and controls the data transmission accuracy based on reinforcement learning. The simulation results show that EP-ADTA can meet the accuracy requirements of underwater monitoring applications, dynamically adapt to the changes in the transmission environment, and ensure efficient and reliable data transmission in underwater wireless sensor networks.

Adaptive Node Clustering for Underwater Sensor Networks.

Monitoring of an underwater environment and communication is essential for many applications, such as sea habitat monitoring, offshore investigation and mineral exploration, but due to underwater current, low bandwidth, high water pressure, propagation delay and error probability, underwater communication is challenging. In this paper, we proposed a sensor node clustering technique for UWSNs named as adaptive node clustering technique (ANC-UWSNs). It uses a dragonfly optimization (DFO) algorithm for selecting ideal measure of clusters needed for routing. The DFO algorithm is inspired by the swarming behavior of dragons. The proposed methodology correlates with other algorithms, for example the ant colony optimizer (ACO), comprehensive learning particle swarm optimizer (CLPSO), gray wolf optimizer (GWO) and moth flame optimizer (MFO). Grid size, transmission range and nodes density are used in a performance matrix, which varies during simulation. Results show that DFO outperform the other algorithms. It produces a higher optimized number of clusters as compared to other algorithms and hence optimizes overall routing and increases the life span of a network.

Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks.

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption.

A Co-Design-Based Reliable Low-Latency and Energy-Efficient Transmission Protocol for UWSNs.

Recently, underwater wireless sensor networks (UWSNs) have been considered as a powerful technique for many applications. However, acoustic communications in UWSNs bring in huge QoS issues for time-critical applications. Additionally, excessive control packets and multiple copies during the data transmission process exacerbate this challenge. Faced with these problems, we propose a reliable low-latency and energy-efficient transmission protocol for dense 3D underwater wireless sensor networks to improve the QoS of UWSNs. The proposed protocol exploits fewer control packets and reduces data-packet copies effectively through the co-design of routing and media access control (MAC) protocols. The co-design method is divided into two steps. First, the number of handshakes in the MAC process will be greatly reduced via our forwarding-set routing strategy under the guarantee of reliability. Second, with the help of information from the MAC process, network-update messages can be used to replace control packages through mobility prediction when choosing a route. Simulation results show that the proposed protocol has a considerably higher reliability, and lower latency and energy consumption in comparison with existing transmission protocols for a dense underwater wireless sensor network.

An Absorption Mitigation Technique for Received Signal Strength-Based Target Localization in Underwater Wireless Sensor Networks.

Localization is an indispensable technology for underwater wireless sensor networks (UWSNs). In what concerns UWSNs, the accurate location information is not only the requirement of the marine field applications but also the basis of the other corresponding research, for instance, network routing and topology control. Recently, an astonishing surge of interest has been drawn in the received signal strength (RSS)-based scheme due to cost-effectiveness and synchronization-free compared with others. However, unlike the terrestrial wireless sensor networks (WSNs), the acoustic signal may suffer the absorption loss in the underwater environment besides the path loss, which degrades the localization accuracy and limits the capability of the RSS-based technology in UWSNs. In this context, a robust localization method with an absorption mitigation technique (AMT) is developed. First, an RSS-based analytically tractable measurement model is conducted, where the maximum likelihood estimator (MLE) is derived. Nevertheless, it is quite challenging to solve the problem using MLE under a non-convex expression. Therefore, by exploiting certain approximations, the considered localization problem is converted into an optimization expression with a maximum absorption loss involved. A min-max strategy is then presented, with which the problem is turned to minimize the worst situation of the absorption loss. After a simple manipulation, the problem is further investigated as a generalized trust region sub-problem (GTRS) framework. Although the GTRS is a non-convex scheme, the solution can be obtained through an iteration method by introducing a multiplier. In addition, the closed-form expression of the Cramer-Rao lower bound (CRLB) of the analytically tractable measurement model is derived. Numerical simulations demonstrate the effectiveness of the proposed method compared with the state-of-the-art approaches in different scenarios.

A Mobile Anchor Node Assisted RSSI Localization Scheme in Underwater Wireless Sensor Networks.

In this paper, a mobile anchor node assisted RSSI localization scheme in underwater wireless sensor networks (UWSNs) is proposed, which aims to improve location accuracy and shorten location time. First, to improve location accuracy, we design a support vector regression (SVR) based interpolation method to estimate the projection of sensor nodes on the linear trajectory of the mobile anchor node. The proposed method increases the accuracy of the nonlinear regression model of noisy measured data and synchronously decreases the estimation error caused by the discreteness of measured data. Second, to shorten location time, we develop a curve matching method to obtain the perpendicular distance from sensor nodes to the linear trajectory of the mobile anchor node. The location of the sensor node can be calculated based on the projection and the perpendicular distance. Compared with existing schemes that require the anchor node to travel at least two trajectories, the proposed scheme only needs one-time trajectory to locate sensor nodes, and the location time is shortened with the reduction in the number of trajectories. Finally, simulation results prove that the proposed scheme can obtain more accurate sensor node location in less time compared with the existing schemes.

RSS-Based Target Localization in Underwater Acoustic Sensor Networks via Convex Relaxation.

The received signal strength (RSS) based target localization problem in underwater acoustic wireless sensor networks (UWSNs) is considered. Two cases with respect to target transmit power are considered. For the first case, under the assumption that the reference of the target transmit power is known, we derive a novel weighted least squares (WLS) estimator by using an approximation to the RSS expressions, and then transform the originally non-convex problem into a mixed semi-definite programming/second-order cone programming (SD/SOCP) problem for reaching an efficient solution. For the second case, there is no knowledge on the target transmit power, and we treat the reference power as an additional unknown parameter. In this case, we formulate a WLS estimator by using a further approximation, and present an iterative ML and mixed SD/SOCP algorithm for solving the derived WLS problem. For both cases, we also derive the closed form expressions of the Cramer-Rao Lower Bounds (CRLBs) on root mean square error (RMSE). Computer simulation results show the superior performance of the proposed methods over the existing ones in the underwater acoustic environment.

A Dynamic Surface Gateway Placement Scheme for Mobile Underwater Networks.

Deployment of surface-level gateways holds potential as an effective method to alleviate high-propagation delays and high-error probability in an underwater wireless sensor network (UWSN). This promise comes from reducing distances to underwater nodes and using radio waves to forward information to a control station. In an UWSN, a dynamic energy efficient surface-level gateway deployment is required to cope with the mobility of underwater nodes while considering the remote and three-dimensional nature of marine space. In general, deployment problems are usually modeled as an optimization problem to satisfy multiple constraints given a set of parameters. One previously published static deployment optimization framework makes assumptions about network workload, routing, medium access control performance, and node mobility. However, in real underwater environments, all these parameters are dynamic. Therefore, the accuracy of performance estimates calculated through static UWSN deployment optimization framework tends to be limited by nature. This paper presents the Prediction-Assisted Dynamic Surface Gateway Placement (PADP) algorithm to maximize the coverage and minimize the average end-to-end delay of a mobile underwater sensor network over a specified period. PADP implements the Interacting Multiple Model (IMM) tracking scheme to predict the positions of sensor nodes. The deployment is determined based on both current and predicted positions of sensor nodes, which enables better coverage and shorter end-to-end delay. PADP uses a branch-and-cut approach to solve the optimization problem efficiently, and employs a disjoint-set data structure to ensure connectivity. Simulation results illustrate that PADP significantly outperforms a static gateway deployment scheme.

Geographic and Opportunistic Recovery with Depth and Power Transmission Adjustment for Energy-Efficiency and Void Hole Alleviation in UWSNs.

Underwater Wireless Sensor Networks (UWSNs) are promising and emerging frameworks having a wide range of applications. The underwater sensor deployment is beneficial; however, some factors limit the performance of the network, i.e., less reliability, high end-to-end delay and maximum energy dissipation. The provisioning of the aforementioned factors has become a challenging task for the research community. In UWSNs, battery consumption is inevitable and has a direct impact on the performance of the network. Most of the time energy dissipates due to the creation of void holes and imbalanced network deployment. In this work, two routing protocols are proposed to avoid the void hole and extra energy dissipation problems which, due to which lifespan of the network increases. To show the efficacy of the proposed routing schemes, they are compared with the state of the art protocols. Simulation results show that the proposed schemes outperform the counterparts.

An Efficient Routing Protocol Based on Stretched Holding Time Difference for Underwater Wireless Sensor Networks.

Underwater Wireless Sensors Networks (UWSNs) use acoustic waves as a communication medium because of the high attenuation to radio and optical waves underwater. However, acoustic signals lack propagation speed as compared to radio or optical waves. In addition, the UWSNs also pose various intrinsic challenges, i.e., frequent node mobility with water currents, high error rate, low bandwidth, long delays, and energy scarcity. Various UWSN routing protocols have been proposed to overcome the above-mentioned challenges. Vector-based routing protocols confine the communication within a virtual pipeline for the sake of directionality and define a fixed pipeline radius between the source node and the centerline station. Energy-Scaled and Expanded Vector-Based Forwarding (ESEVBF) protocol limits the number of duplicate packets by expanding the holding time according to the propagation delay, and thus reduces the energy consumption via the remaining energy of Potential Forwarding Nodes (PFNs) at the first hop. The holding time mechanism of ESEVBF is restricted only to the first-hop PFNs of the source node. The protocol fails when there is a void or energy hole at the second hop, affecting the reliability of the system. Our proposed protocol, Extended Energy-Scaled and Expanded Vector-Based Forwarding Protocol (EESEVBF), exploits the holding time mechanism to suppress duplicate packets. Moreover, the proposed protocol tackles the hidden terminal problem due to which a reasonable reduction in duplicate packets initiated by the reproducing nodes occurs. The holding time is calculated based on the following four parameters: (i) the distance from the boundary of the transmission area relative to the PFNs' inverse energy at the 1st and 2nd hop, (ii) distance from the virtual pipeline, (iii) distance from the source to the PFN at the second hop, and (iv) distance from the first-hop PFN to its destination. Therefore, the proposed protocol stretches the holding time difference based on two hops, resulting in lower energy consumption, decreased end-to-end delay, and increased packet delivery ratio. The simulation results demonstrate that compared to ESEVBF, our proposed protocol EESEVBF experiences 20.2 % lesser delay, approximately 6.66 % more energy efficiency, and a further 11.26 % reduction in generating redundant packets.

RECRP: An Underwater Reliable Energy-Efficient Cross-Layer Routing Protocol.

A reliable energy-efficient routing protocol plays a key role in underwater data transmission. In the face of acoustic communication challenges in underwater wireless sensor networks (UWSNs), including long propagation delay, topology change, limited energy, and communication voids, we propose RECRP, a Reliable Energy-efficient Cross-layer Routing Protocol to achieve high data delivery rate. RECRP is a location-free single-copy protocol. The information of the physical layer such as Doppler scale shift measurement, Received Signal Strength Indication (RSSI), etc. are adopted to estimate the distance, thus no extra hardware is needed for localization. Moreover, the overhead introduced by redundant packets is avoided with the single-copy mechanism. To improve the two-hop packet delivery rate and balance energy consumption among adjacent nodes, an optimal max⁻min method is proposed that dynamically controls transmission power and channel frequency. Furthermore, a surface to bottom routing establishment method is also adopted to handle communication voids. Compared with depth-based routing (DBR) and hop-by-hop vector-based forwarding (HH-VBF) , RECRP is more energy-efficient with a higher delivery rate.

Challenges, Threats, Security Issues and New Trends of Underwater Wireless Sensor Networks.

With the advances in technology, there has been an increasing interest from researchers and industrial institutions in the use of underwater wireless sensor networks (UWSNs). Constrained by the open acoustic channel, harsh underwater environment, and their own particularities, UWSNs are vulnerable to a wide class of security threats and malicious attacks. However, most existing research into UWSNs has not taken security into consideration. Moreover, the existing relatively mature security mechanisms for WSNs cannot be directly utilized in UWSNs. For these reasons, this article aims to present a comprehensive overview of the particularities, constraints, attacks, challenges and current security mechanisms of UWSNs. In addition, challenging, open and hot research topics are outlined.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described merit(s). Finally, open challenges and research directions are presented for future investigation.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.