Optimization of depth-based routing for underwater wireless sensor networks through intelligent assignment of initial energy

Underwater Wireless Sensor Networks (UWSNs) are extensively used to explore the diverse marine environment. Energy efficiency is one of the main concerns regarding performance of UWSNs. In a cooperative wireless sensor network, nodes with no energy are known as coverage holes. These coverage holes are created due to non-uniform energy utilization by the sensor nodes in the network. These coverage holes degrade the performance and reduce the lifetime of UWSNs. In this paper, we present an Intelligent Depth Based Routing (IDBR) scheme which addresses this issue and contributes towards maximization of network lifetime. In our proposed scheme, we allocate initial energy to the sensor nodes according to their usage requirements. This idea is helpful to balance energy consumption amongst the nodes and keep the network functional for a longer time as evidenced by the results provided

RMEER: Reliable Multi-path Energy Efficient Routing Protocol for Underwater Wireless Sensor Network

Underwater Wireless Sensor Networks (UWSNs) is interesting area for researchers.To extract the information from seabed to water surface the the majority numbers of routing protocols has been introduced. The design of routing protocols faces many challenges like deployment of sensor nodes, controlling of node mobility, development of efficient route for data forwarding, prolong the battery power of the sensor nodes, and removal of void nodes from active data forwarding paths. This research article focuses the design of the Reliable Multipath Energy Efficient Routing (RMEER) which develops the efficient route between sensor nodes, and prolongs the battery life of the nodes. RMEER is a scalable and robust protocol which utilizes the powerful fixed courier nodes in order to enhance the network throughput, data delivery ratio, network lifetime and reduces the end-to-end delay. RMEER is also an energy efficient routing protocol for saving the energy level of the nodes. We have used the NS2.30 simulator with AquaSim package for performance analysis of RMEER.We observed that the simulation performance of RMEER is better than D-DBR protocol

Review on Localization based Routing Protocols for Underwater Wireless Sensor Network

Underwater Wireless Sensor Network (UWSN) can enable many scientific, military, safety, commercial and environmental applications. Majority of the network models has been introduced for the deployment of sensor nodes through routing schemes and methodologies along with different algorithms but still the design of routing protocol for underwater environment is a challenging issue due to distinctive characteristics of underwater medium. The majority of the issues are also needed to fulfill the appropriate approach for the underwater medium like limited bandwidth, high bit error rates, propagation delay, and 3D deployment. This paper focuses the comparative analysis of the localization based routing protocols for UWSN. This comparative analysis plays a significant attention to construct a reliable routing protocol, which provides the effectual discovery of the route between the source node and the sink node. In addition this comparative analysis also focuses the data packets forwarding mechanism, the deployment of sensor nodes and location based routing for UWSN in different conditions

Energy efficient routing protocols for UWSN: A review

The Underwater Sensor Network (UWSN) is main interesting area due to its most valuable applications like: disaster preventions, distributed tactical surveillance, undersea exploration, seismic monitoring, environmental monitoring and many more. The design of energy efficient routing protocol however is a challenging issue because in underwater environment the batteries of the sensor nodes cannot be recharged easily. Majority of the researchers have adapted the terrestrial WSN methodologies to overcome this problem but in underwater environment the terrestrial WSN approach is not feasible due to the acoustic signaling and water current. This research paper focuses the key limitation of the current energy efficient routing protocols. The simulation results with comparative analysis for energy efficient routing protocols are also presented in this research article; which helps the researchers to find the further research gap in the field of energy efficient routing protocols

Void avoidance opportunistic routing density rank based for underwater sensor networks

Currently, the Underwater Sensor Networks (UWSNs) is mainly an attractive area due to its technological ability to gather valuable data from underwater environments such as tsunami monitoring sensors, military tactical applications, and environmental monitoring. However, UWSNs are suffering from limited energy, high packet loss, and the use of acoustic communication which have very limited bandwidth and slow transmission. In UWSNs, the energy consumption used is 125 times more during the forwarding of the packet data from source to destination as compare to during receiving data. For this reason, many researchers are keen to design an energy-efficient routing protocol to minimize the energy consumption in UWSNs while at the same time provide adequate packet delivery ratio and less cumulative delay. As such, the opportunistic routing (OR) is the most promising method to be used in UWSNs due to its unique characteristics such as high path loss, dynamic topology, high energy consumption, and high propagation delay. However, the OR algorithm had also suffered from as higher traffic load for selection next forwarding nodes in the progression area, which suppressed the redundant forwarding packet and caused communication void. There are three new proposed algorithms introduced to address all three issues which resulted from using the OR approach in UWSNs. Firstly, the higher traffic load for selection next forwarding nodes in the problematic progression area problem was addressed by using the Opportunistic Routing Density Based (ORDB) algorithm to minimize the traffic load by introducing a beaconless routing to update the neighbor node information protocol. Secondly, the algorithm Opportunistic Routing Density Rank Based (ORDRB) was developed to deal with redundant packet forwarding by introducing a new method to reduce the redundant packet forwarding while in dense or sparse conditions to improve the energy consumption effectively. Finally, the algorithm Void Avoidance Opportunistic Routing Density Rank Based (ORDRB) was developed to deal with the communication void by introducing a simple method to detect a void node and avoid it during the forwarding process. Simulation results showed that ORDB has improved the network performance in terms of energy tax average (25%, 40%), packet delivery ratio (43%, 23%), and cumulative delay (67%, -42%) compared to DBR and UWFlooding routing protocols. While for ORDRB, the network performance improved in terms of energy tax average (0.9%, 53%, 62%), packet delivery ratio (100%, 83%, 58%) and cumulative delay (-270%, -94%, 55%) compared to WDFAD-DBR, DBR and UWFlooding. Lastly, for VAORDRB, the network performance improved in terms of energy tax average (3%, 8%), packet delivery ratio (167%, 261%), and cumulative delay (68%, 57%) compared to EVA-DBR and WDFAD-DBR. Based on the findings of this study, the protocol VAORDRB is a suitable total solution to reduce the cumulative delay and increase the packet delivery ratio in sparse and dense network deployment

Enhanced reliable and energy efficient pressure based data forwarding schemes for underwater wireless sensor networks

Data collection in Underwater Wireless Sensor Networks (UWSN) requires highly optimized communication approach in order to achieve efficient data packet delivery. This approach consists of different communication layers of which routing protocol is an important consideration. Several issues including packet entrapment due to void region, selection of forwarding node with insufficient link quality and packet collision in congested forwarding area have emanated. Therefore, three different research problems were formulated to address the issue of reliability and energy efficiency in data forwarding in UWSN. First, void handling for packet entrapment in the void region, which generate delays and communication overhead. Second, non-optimal node selection that causes forwarding delays and non-reliable packet delivery. Third, collision due to congestion, which leads to packet drop and unreliable packet delivery. Thus, enhanced reliable and energy-efficient pressure-based data forwarding schemes for UWSN were developed, which are the Communication Void Avoidance (CVA) to estimate neighbour nodes availability outside a void region in order to avoid voids and reduce delay; a Multi-metric Evaluation mechanism for next forwarder Node Selection (MENS) for optimal packet delivery; and a Congestion Avoidance and MITigation (CAMIT) in data forwarding for congestion and collision reduction in order to achieve reliable data forwarding. Several experiments were performed through simulations to access the performance of the proposed mechanisms and the results of each scheme were compared with related previously published protocols. The obtained results depict that the proposed schemes outperformed the existing schemes and significantly improved overall performance. CVA improved Packet Delivery Ratio by 12.8% to 18.7% and reduced End-to-end delay by 7.3% to 12.5% on average. MENS improved communication Data Rate by 13.2% to 15.1% and Energy Consumption improved by 10.6% to 15.3% on average. Lastly, CAMIT reduced Packet Drop ratio by 10.2% to 13% on average. The findings demonstrate the improved efficiency has been achieved by the CVA, MENS and CAMIT in terms of optimal node selection and reliability in packet forwarding in UWSN

Review on energy efficient opportunistic routing protocol for underwater wireless sensor networks

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design

Self-organizing Fast Routing Protocols for Underwater Acoustic Communications Networks

To address this problem, in this thesis we propose a cross-layer proactive routing initialization mechanism that does not require additional measurements and, at the same time, is energy efficient. Two routing protocols are proposed: Self-Organized Fast Routing Protocol for Radial Underwater Networks (SOFRP) for radial topology and Self-organized Proactive Routing Protocol for Non-uniformly Deployed Underwater Networks (SPRINT) for a randomly deployed network. SOFRP is based on the algorithm to recreate a radial topology with a gateway node, such that packets always use the shortest possible path from source to sink, thus minimizing consumed energy. Collisions are avoided as much as possible during the path initialization. The algorithm is suitable for 2D or 3D areas, and automatically adapts to a varying number of nodes. In SPRINT the routing path to the gateway is formed on the basis of the distance, measured by the signal strength received. The data sending node prefers to choose the neighbor node which is closest to it. It is designed to achieve high data throughput and low energy consumption of the nodes. There is a tradeoff between the throughput and the energy consumption: more distance needs more transmission energy, and more relay nodes (hops) to the destination node affects the throughput. Each hop increases the packet delay and decreases the throughput. Hence, energy consumption requires nearest nodes to be chosen as forwarding node whereas the throughput requires farthest node to be selected to minimize the number of hops. Fecha de lectura de Tesis Doctoral: 11 mayo 2020Underwater Wireless Sensor Networks (UWSNs) constitute an emerging technology for marine surveillance, natural disaster alert and environmental monitoring. Unlike terrestrial Wireless Sensor Networks (WSNs), electromagnetic waves cannot propagate more than few meters in water (high absorption rate). However, acoustic waves can travel long distances in underwater. Therefore, acoustic waves are preferred for underwater communications, but they travel very slow compare to EM waves (typical speed in water is 1500 m/s against 2x10^8 m/s for EM waves). This physical effect makes a high propagation delay and cannot be avoided, but the end-to-end packet delay it can be reduced. Routing delay is one of the major factors in end-to-end packet delay. In reactive routing protocols, when a packet arrives to a node, the node takes some time to select the node to which the data packet would be forwarded. We may reduce the routing delay for time-critical applications by using proactive routing protocols. Other two critical issues in UWSNs are determining the position of the nodes and time synchronization. Wireless sensor nodes need to determine the position of the surrounding nodes to select the next node in the path to reach the sink node. A Global Navigation Satellite System (GNSS) cannot be used because of the very short underwater range of the GNSS signal. Timestamping to estimate the distance is possible but the limited mobility of the UWSN nodes and variation in the propagation speed of the acoustic waves make the time synchronization a challenging task. For these reasons, terrestrial WSN protocols cannot be readily used for underwater acoustic networks

Mathematical Models and Algorithms for Network Flow Problems Arising in Wireless Sensor Network Applications

We examine multiple variations on two classical network flow problems, the maximum flow and minimum-cost flow problems. These two problems are well-studied within the optimization community, and many models and algorithms have been presented for their solution. Due to the unique characteristics of the problems we consider, existing approaches cannot be directly applied. The problem variations we examine commonly arise in wireless sensor network (WSN) applications. A WSN consists of a set of sensors and collection sinks that gather and analyze environmental conditions. In addition to providing a taxonomy of relevant literature, we present mathematical programming models and algorithms for solving such problems. First, we consider a variation of the maximum flow problem having node-capacity restrictions. As an alternative to solving a single linear programming (LP) model, we present two alternative solution techniques. The first iteratively solves two smaller auxiliary LP models, and the second is a heuristic approach that avoids solving any LP. We also examine a variation of the maximum flow problem having semicontinuous restrictions that requires the flow, if positive, on any path to be greater than or equal to a minimum threshold. To avoid solving a mixed-integer programming (MIP) model, we present a branch-and-price algorithm that significantly improves the computational time required to solve the problem. Finally, we study two dynamic network flow problems that arise in wireless sensor networks under non-simultaneous flow assumptions. We first consider a dynamic maximum flow problem that requires an arc to transmit a minimum amount of flow each time it begins transmission. We present an MIP for solving this problem along with a heuristic algorithm for its solution. Additionally, we study a dynamic minimum-cost flow problem, in which an additional cost is incurred each time an arc begins transmission. In addition to an MIP, we present an exact algorithm that iteratively solves a relaxed version of the MIP until an optimal solution is found