RESUMEN

Energy efficiency is important for underwater sensor networks. Designing such networks is challenging due to underwater environmental traits that hinder network lifespan extension. Unlike terrestrial protocols, underwater settings require novel protocols due to slower signal propagation. To enhance energy efficiency in underwater sensor networks, ongoing research concentrates on developing innovative solutions. Thus, in this paper, an intelligent bio-inspired autonomous surveillance system using underwater sensor networks is proposed as an efficient method for data communication. The tunicate swarm algorithm is used for the election of the cluster heads by considering different parameters such as energy, distance, and density. Each layer has several clusters, each of which is led by a cluster head that continuously rotates in response to the fitness values of the SNs using the tunicate swarm algorithm. The performance of the proposed protocol is compared with existing methods such as EE-LHCR, EE-DBR, and DBR, and results show the network's lifespan is improved by the proposed work. Due to the effective fitness parameters during cluster head elections, our suggested protocol may more effectively achieve energy balance, resulting in a longer network lifespan.

RESUMEN

Underwater sensor nodes are usually deployed by ships, aircraft, etc., in random drops, and there is current movement in the underwater environment, which results in an uneven distribution of sensor nodes and thus, different energy consumption in each area of the network. In addition, the underwater sensor network also has a "hot zone" problem. To address the uneven energy consumption of the network caused by the above problem, the non-uniform clustering algorithm for energy equalization is put forward. Considering the residual energy, density and coverage redundancy of nodes, this algorithm selects the cluster heads and makes them more reasonably distributed. Additionally, according to the selected cluster heads, the size of each cluster is designed to equalize the energy consumption of the network during multi-hop routing. In this process, the residual energy of cluster heads and the mobility of nodes are considered, and real-time maintenance is performed for each cluster. The simulation results demonstrate that the proposed algorithm is effective in prolonging the network lifetime and balancing the network energy consumption; moreover, the network coverage maintenance is better than that of other algorithms.

Asunto(s)

RESUMEN

Considering underwater environments, this paper tackles flocking of multiple swarm robots utilizing one leader. The mission of swarm robots is to reach their goal while not colliding with a priori unknown 3D obstacles. In addition, the communication link among the robots needs to be preserved during the maneuver. Only the leader has sensors for localizing itself while accessing the global goal position. Every robot, except for the leader, can measure the relative position and the ID of its neighboring robots by utilizing proximity sensors such as Ultra-Short BaseLine acoustic positioning (USBL) sensors. Under the proposed flocking controls, multiple robots flock inside a 3D virtual sphere while preserving communication connectivity with the leader. If necessary, all robots rendezvous at the leader to increase connectivity among the robots. The leader herds all robots to reach the goal safely, while the network connectivity is maintained in cluttered underwater environments. To the best of our knowledge, our article is novel in developing underwater flocking controls utilizing one leader, so that a swarm of robots can safely flock to the goal in a priori unknown cluttered environments. MATLAB simulations were utilized to validate the proposed flocking controls in underwater environments with many obstacles.

Asunto(s)

RESUMEN

Underwater wireless sensor networks (UWSNs) comprise numerous underwater wireless sensor nodes dispersed in the marine environment, which find applicability in several areas like data collection, navigation, resource investigation, surveillance, and disaster prediction. Because of the usage of restricted battery capacity and the difficulty in replacing or charging the inbuilt batteries, energy efficiency becomes a challenging issue in the design of UWSN. Earlier studies reported that clustering and routing are considered effective ways of attaining energy efficacy in the UWSN. Clustering and routing processes can be treated as nondeterministic polynomial-time (NP) hard optimization problems, and they can be addressed by the use of metaheuristics. This study introduces an improved metaheuristics-based clustering with multihop routing protocol for underwater wireless sensor networks, named the IMCMR-UWSN technique. The major aim of the IMCMR-UWSN technique is to choose cluster heads (CHs) and optimal routes to a destination. The IMCMR-UWSN technique incorporates two major processes, namely the chaotic krill head algorithm (CKHA)-based clustering and self-adaptive glow worm swarm optimization algorithm (SA-GSO)-based multihop routing. The CKHA technique selects CHs and organizes clusters based on different parameters such as residual energy, intra-cluster distance, and inter-cluster distance. Similarly, the SA-GSO algorithm derives a fitness function involving four parameters, namely residual energy, delay, distance, and trust. Utilization of the IMCMR-UWSN technique helps to significantly boost the energy efficiency and lifetime of the UWSN. To ensure the improved performance of the IMCMR-UWSN technique, a series of simulations were carried out, and the comparative results reported the supremacy of the IMCMR-UWSN technique in terms of different measures.

Asunto(s)

RESUMEN

In this paper, we investigate how to efficiently utilize channel bandwidth in heterogeneous hybrid optical and acoustic underwater sensor networks, where sensor nodes adopt different Media Access Control (MAC) protocols to transmit data packets to a common relay node on optical or acoustic channels. We propose a new MAC protocol based on deep reinforcement learning (DRL), referred to as optical and acoustic dual-channel deep-reinforcement learning multiple access (OA-DLMA), in which the sensor nodes utilizing the OA-DLMA protocol are called agents, and the remainder are non-agents. The agents can learn the transmission patterns of coexisting non-agents and find an optimal channel access strategy without any prior information. Moreover, in order to further enhance network performance, we develop a differentiated reward policy that rewards specific actions over optical and acoustic channels differently, with priority compensation being given to the optical channel to achieve greater data transmission. Furthermore, we have derived the optimal short-term sum throughput and channel utilization analytically and conducted extensive simulations to evaluate the OA-DLMA protocol. Simulation results show that our protocol performs with near-optimal performance and significantly outperforms other existing protocols in terms of short-term sum throughput and channel utilization.

Asunto(s)

RESUMEN

Underwater Wireless Sensor Networks (UWSNs) are subjected to a multitude of real-life challenges. Maintaining adequate power consumption is one of the critical ones, for obvious reasons. This includes proper energy consumption due to nodes close to and far from the sink node (gateway), which affect the overall energy efficiency of the system. These wireless sensors gather and route the data to the onshore base station through the gateway at the sea surface. However, finding an optimum and efficient path from the source node to the gateway is a challenging task. The common reasons for the loss of energy in existing routing protocols for underwater are (1) a node shut down due to battery drainage, (2) packet loss or packet collision which causes re-transmission and hence affects the performance of the system, and (3) inappropriate selection of sensor node for forwarding data. To address these issues, an energy efficient packet forwarding scheme using fuzzy logic is proposed in this work. The proposed protocol uses three metrics: number of hops to reach the gateway node, number of neighbors (in the transmission range of a node) and the distance (or its equivalent received signal strength indicator, RSSI) in a 3D UWSN architecture. In addition, the performance of the system is also tested with adaptive and non-adaptive transmission ranges and scalable number of nodes to see the impact on energy consumption and number of hops. Simulation results show that the proposed protocol performs better than other existing techniques or in terms of parameters used in this scheme.

RESUMEN

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.

Asunto(s)

RESUMEN

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.

RESUMEN

In this study, the problem of dynamic channel access in distributed underwater acoustic sensor networks (UASNs) is considered. First, we formulate the dynamic channel access problem in UASNs as a multi-agent Markov decision process, wherein each underwater sensor is considered an agent whose objective is to maximize the total network throughput without coordinating with or exchanging messages among different underwater sensors. We then propose a distributed deep Q-learning-based algorithm that enables each underwater sensor to learn not only the behaviors (i.e., actions) of other sensors, but also the physical features (e.g., channel error probability) of its available acoustic channels, in order to maximize the network throughput. We conduct extensive numerical evaluations and verify that the performance of the proposed algorithm is similar to or even better than the performance of baseline algorithms, even when implemented in a distributed manner.

RESUMEN

The domain of underwater wireless sensor networks (UWSNs) had received a lot of attention recently due to its significant advanced capabilities in the ocean surveillance, marine monitoring and application deployment for detecting underwater targets. However, the literature have not compiled the state-of-the-art along its direction to discover the recent advancements which were fuelled by the underwater sensor technologies. Hence, this paper offers the newest analysis on the available evidences by reviewing studies in the past five years on various aspects that support network activities and applications in UWSN environments. This work was motivated by the need for robust and flexible solutions that can satisfy the requirements for the rapid development of the underwater wireless sensor networks. This paper identifies the key requirements for achieving essential services as well as common platforms for UWSN. It also contributes a taxonomy of the critical elements in UWSNs by devising a classification on architectural elements, communications, routing protocol and standards, security, and applications of UWSNs. Finally, the major challenges that remain open are presented as a guide for future research directions.

RESUMEN

Underwater sensor networks (UWSNs) have recently attracted much attention due to their ability to discover and monitor the aquatic environment. However, acoustic communication has posed some significant challenges, such as high propagation delay, low available bandwidth, and high bit error rate. Therefore, proposing a cross-layer protocol is of high importance to the field to integrate different communication functionalities (i.e, an interaction between data link layer and network layer) to interact in a more reliable and flexible manner to overcome the consequences of applying acoustic signals. In this paper, a novel Cross-Layer Mobile Data gathering (CLMD) scheme for Underwater Sensor Networks (UWSNs) is presented to improve the performance by providing the interaction between the MAC and routing layers. In CLMD, an Autonomous Underwater Vehicle (AUV) is used to periodically visit a group of clusters which are responsible for data collection from members. The communications are managed by using a distributed cross-layer solution to enhance network performance in terms of packet delivery and energy saving. The cluster heads are replaced with other candidate members at the end of each operational phase to prolong the network lifetime. The effectiveness of CLMD is verified through an extensive simulation study which reveals the performance improvement in the energy-saving, network lifetime, and packet delivery ratio with varying number of nodes. The effects of MAC protocols are also studied by studying the network performance under various MAC protocols in terms of packet delivery ratio, goodput, and energy consumption with varying density of nodes.

RESUMEN

In underwater acoustic modem design, pure asynchrony can contribute to improved wake-up coordination, thus avoiding energy-inefficient synchronization mechanisms. Nodes are designed with a pre-receptor and an acoustically adapted Radio Frequency Identification system, which wakes up the node when it receives an external tone. The facts that no synchronism protocol is necessary and that the time between waking up and packet reception is narrow make pure asynchronism highly efficient for energy saving. However, handshaking in the Medium Control Access layer must be adapted to maintain the premise of pure asynchronism. This paper explores different models to carry out this type of adaptation, comparing them via simulation in ns-3. Moreover, because energy saving is highly important to data gathering driven by underwater vehicles, where nodes can spend long periods without connection, this paper is focused on multi-hop topologies. When a vehicle appears in a 3D scenario, it is expected to gather as much information as possible in the minimum amount of time. Vehicle appearance is the event that triggers the gathering process, not only from the nearest nodes but from every node in the 3D volume. Therefore, this paper assumes, as a requirement, a topology of at least three hops. The results show that classic handshaking will perform better than tone reservation because hidden nodes annulate the positive effect of channel reservation. However, in highly dense networks, a combination model with polling will shorten the gathering time.

RESUMEN

Underwater sensor networks (UWSNs) have witnessed significant R&D attention in both academia and industry due to their growing application domains, such as border security, freight via sea or river, natural petroleum production and the fishing industry. Considering the deep underwater-oriented access constraints, energy-centric communication for the lifetime maximization of tiny sensor nodes in UWSNs is one of the key research themes in this domain. Existing literature on green UWSNs are majorly adapted from the existing techniques in traditional wireless sensor network relying on geolocation and the quality of service-centric underwater relay node selection, without paying much attention to the dynamic underwater network environments. To this end, this paper presents an adapted whale and wolf optimization-based energy and delay-centric green underwater networking framework (W-GUN). It focuses on exploiting dynamic underwater network characteristics by effectively utilizing underwater whale-centric optimization in relay node selection. Firstly, an underwater relay node optimization model is mathematically derived, focusing on underwater whale dynamics for incorporating realistic underwater characteristics in networking. Secondly, the optimization model is used to develop an adapted whale and grey wolf optimization algorithm for selecting optimal and stable relay nodes for centric underwater communication paths. Thirdly, a complete workflow of the W-GUN framework is presented with an optimization flowchart. The comparative performance evaluation attests to the benefits of the proposed framework and is compared to state-of-the-art techniques considering various metrics related to underwater network environments.

RESUMEN

Precise and robust localization in three-dimensional underwater sensor networks is still an important research problem. This problem is particularly challenging if there are some malicious anchors among ordinary anchor nodes that will broadcast their locations falsely and deliberately. In this paper, we study how to self-localize large teams of underwater sensor nodes under the condition that some malicious anchor nodes mixed with ordinary anchors. Due to malicious characteristic of some deliberate anchor nodes, an iterative and cooperative 3D-localization algorithm for underwater sensor networks in the existence of malicious anchors is proposed in this paper. The proposed robust localization algorithm takes advantage of distributed reputation voting method within 1-Hop neighboring reference nodes to detect and eliminate malicious anchor nodes. Moreover, one kind of Minimum Mean Squared Error estimation based iterative localization method is applied to determine accurate location information. Additionally, we analyze and prove that our localization algorithm would have a bounded error when the number of malicious anchors is smaller than a certain threshold. Extensive simulation results are provided to demonstrate performance improvements comparing to traditional Minimum Mean Squared Error and Attack Resistant Minimum Mean Squared Error based localization methods in terms of localization accuracy and coverage ratio.

RESUMEN

Underwater Sensor Networks (UWSN) have attracted huge attention due to their significance in oceanic observation and exploration. They offer a vast number of applications, many of which require routing the sensed data to a centralized location. This makes routing an important part of the design of such applications. In this paper, we present a comprehensive survey of recently proposed routing protocols for UWSNs. We evaluate the proposed schemes through an extensive set of parameters that define the core characteristics of a routing protocol. Moreover, we present a summary of the methods used by each scheme to familiarize readers with the basic operations of the schemes. We also present our view of the strengths and weakness of each scheme. For ease of description, the addressed routing protocols are divided into two categories: localization-based, and localization-free routing schemes. Each of the two categories is further divided into the protocols that consider node mobility, and those that do not. Lastly, we present our view on open research topics.

RESUMEN

Preservation of privacy of users' personal data has always been a critical issue to deal with. This issue in the Internet of Things (IoT), which facilitates millions of applications, has become even more challenging. Currently, several approaches and methods are available to safeguard privacy but each of them suffers from one or more anomalies. In particular, Trusted Third-Party approach relies on the trust of a third-party server, Cooperation needs the trust of other peers, Obfuscation is known to return inaccurate results, and Dummy generates too much overhead. Moreover, these and most of the other well-known approaches deal only with specific types of applications linked to the location-based services. In this paper, we present two new methods, namely: Blind Third Party (BTP) and Blind Peers ( B L P ), and combine them to form a new one to be known as the Blind Approach ( B L A ). With the help of simulation results we shall demonstrate the effectiveness and superiority of B L A over the other available methods. The simulation results also exhibit that B L A is free from all the existing problems of the other approaches. However, B L A causes a slight increase in the average (response) time, which we consider to be a minor issue. We shall also discuss the capability and superiority of the Blind Approach in the cases of E-health, Smart Transportation, and Smart Home systems.

RESUMEN

The combination of Wireless Sensor Networks (WSNs) and edge computing not only enhances their capabilities, but also motivates a series of new applications. As a typical application, 3D Underwater Wireless Sensor Networks (UWSNs) have become a hot research issue. However, the coverage of underwater sensor networks problem must be solved, for it has a great significance for the network's capacity for information acquisition and environment perception, as well as its survivability. In this paper, we firstly study the minimal number of sensor nodes needed to build a diverse k-coverage sensor network. We then propose a k-Equivalent Radius enhanced Virtual Force Algorithm (called k-ERVFA) to achieve an uneven regional coverage optimization for different k-coverage requirements. Theoretical analysis and simulation experiments are carried out to demonstrate the effectiveness of our proposed algorithm. The detailed performance comparisons show that k-ERVFA acquires a better coverage rate in high k-coverage sub-regions, thus achieving a desirable diverse k-coverage deployment. Finally, we perform sensitivity analysis of the simulation parameters and extend k-ERVFA to special cases such as sensor-sparse regions and time-variant situations.

RESUMEN

We study the problem of three-dimensional localization of the underwater mobile sensor networks using only range measurements without GPS devices. This problem is challenging because sensor nodes often drift with unknown water currents. Consequently, the moving direction and speed of a sensor node cannot be predicted. Moreover, the motion devices of the sensor nodes are not accurate in underwater environments. Therefore, we propose an adaptive localization scheme, ProLo, taking these uncertainties into consideration. This scheme applies the rigidity theory and maintains a virtual rigid structure through projection. We have proved the correctness of this three-dimensional localization scheme and also validated it using simulation. The results demonstrate that ProLo is promising for real mobile underwater sensor networks with various noises and errors.

RESUMEN

3D topology control in underwater sensor networks is of great significance to ensuring reliable and efficient operation of the network. In this paper, by analyzing the characteristics of an underwater sensor network, we take the cube as the basic unit to perform 3D partition of the monitoring area, define the 3D partition unit and basic cluster structure of the underwater sensor network, and arrange rotating temporary control nodes in the cluster. Then, a cluster sleep-wake scheduling algorithm is proposed that compares the remaining node energy. It selects the node with the largest remaining energy as the working node, and the remaining nodes complete the transition of dormancy and waiting states as long as they reach the preset dormancy time. The node state settings of this phase are completed by the temporary control node. Temporary control nodes selecting and sleep-wake scheduling are used in the algorithm through 3D topology control, which reduces energy consumption and guarantees maximum sensing coverage of the entire network and the connection rate of active nodes. Simulation results further verify the effectiveness of the proposed algorithm.

RESUMEN

In underwater sensor networks (UWSNs), the unique characteristics of acoustic channels have posed great challenges for the design of medium access control (MAC) protocols. The long propagation delay problem has been widely explored in recent literature. However, the long preamble problem with acoustic modems revealed in real experiments brings new challenges to underwater MAC design. The overhead of control messages in handshaking-based protocols becomes significant due to the long preamble in underwater acoustic modems. To address this problem, we advocate the receiver-initiated handshaking method with parallel reservation to improve the handshaking efficiency. Despite some existing works along this direction, the data polling problem is still an open issue. Without knowing the status of senders, the receiver faces two challenges for efficient data polling: when to poll data from the sender and how much data to request. In this paper, we propose a traffic estimation-based receiver-initiated MAC (TERI-MAC) to solve this problem with an adaptive approach. Data polling in TERI-MAC depends on an online approximation of traffic distribution. It estimates the energy efficiency and network latency and starts the data request only when the preferred performance can be achieved. TERI-MAC can achieve a stable energy efficiency with arbitrary network traffic patterns. For traffic estimation, we employ a resampling technique to keep a small computation and memory overhead. The performance of TERI-MAC in terms of energy efficiency, channel utilization, and communication latency is verified in simulations. Our results show that, compared with existing receiver-initiated-based underwater MAC protocols, TERI-MAC can achieve higher energy efficiency at the price of a delay penalty. This confirms the strength of TERI-MAC for delay-tolerant applications.