A stateless opportunistic routing protocol for underwater sensor networks

Routing packets in Underwater Sensor Networks (UWSNs) face different challenges, the most notable of which is perhaps how to deal with void communication areas. While this issue is not addressed in some underwater routing protocols, there exist some partially state-full protocols which can guarantee the delivery of packets using excessive communication overhead. However, there is no fully stateless underwater routing protocol, to the best of our knowledge, which can detect and bypass trapped nodes. A trapped node is a node which only leads packets to arrive finally at a void node. In this paper, we propose a Stateless Opportunistic Routing Protocol (SORP), in which the void and trapped nodes are locally detected in the different area of network topology to be excluded during the routing phase using a passive participation approach. SORP also uses a novel scheme to employ an adaptive forwarding area which can be resized and replaced according to the local density and placement of the candidate forwarding nodes to enhance the energy efficiency and reliability. We also make a theoretical analysis on the routing performance in case of considering the shadow zone and variable propagation delays. The results of our extensive simulation study indicate that SORP outperforms other protocols regarding the routing performance metrics

Evaluation of the performance of underwater wireless sensor networks routing protocols under high-density network

Nowadays, research and development of Underwater Wireless Sensor Networks (UWSNs) widely supporting various available application such as oil/gas monitoring system, tsunami monitoring, disaster prevention, and environmental monitoring has become increasingly popular among academicians and industries. However, to develop efficient communication in UWSNs is a difficult duty due to the irregular nature of the underwater environment. In our previous review [14], we did an elaborate theoretical survey on UWSNs routing protocols. In this work, we are going to evaluate the performance of some of the UWSNs routing protocols under high-density network condition. To simulate a high-density UWSNs, we are placing hundreds of underwater nodes in a small three-dimensional topographical area and study the behavior of the routing protocol and the network. We have chosen to evaluate some of the frequently addressed underwater routing protocols such as Underwater Flooding (UWFlooding), Vector-Based Forwarding (VBF), and Hop by Hop Vector-Based Forwarding (HH-VBF) under this high-density network scenarios. The result of our study shows that VBF and HH-VBF perform better in term of the number of packets received, dropped packets and PDR, while UWFlooding performs better in term of cumulative delay

Evaluating the impact of storage capacity constraints on vehicular delay-tolerant networks

“Copyright © [2009] IEEE. Reprinted from Second International Conference on Communication Theory Reliability, and Quality of Service, 2009. CTRQ'09. ISBN:978-1-4244-4423-6. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Network (VDTN) was proposed as a particular application of a mobile Delay-Tolerant Network (DTN), where vehicles act as the communication infrastructure for the network, relaying messages between the network nodes. In this paper, we consider the use of a VDTN to provide low-cost asynchronous communication between sparse populations spread over a remote vast region. We analyze the influence of the VDTN network node’s storage capacity (buffer size), on the efficiency of four DTN routing protocols, in terms of message delivery probability. Our scenarios show that the routing protocols message replication strategies react differently to the increase of buffer size in specific network nodes. Epidemic and MaxProp protocols benefit from the increase of the storage capacity on all network nodes. Spray and Wait protocol only takes advantage on the increase of the vehicle’s buffer capacity. We expect that this paper will provide a deep understanding of the implications of storage constraints over the performance of a VDTN, leading to insights for future routing algorithm and buffer management theoretic studies and protocol design.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of Seven Framework Programme of EU

Improving vehicular delay-tolerant network performance with relay nodes

“Copyright © [2009] IEEE. Reprinted from Next Generation Internet Network. NGI '09). ISBN:978-1-4244-4244-7. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.”Vehicular Delay-Tolerant Networking (VDTN) is an extension of the Delay-Tolerant Network (DTN) architecture concept to transit networks. VDTN architecture handles non-real time applications, exploiting vehicles to enable connectivity under unreliable scenarios with unstable links and where an end-to-end path may not exist. Intuitively, the use of stationary store-and-forward devices (relay nodes) located at crossroads where vehicles meet them and should improve the message delivery probability. In this paper, we analyze the influence of the number of relay nodes, in urban scenarios with different numbers of vehicles. It was shown that relay nodes significantly improve the message delivery probability on studied DTN routing protocols.Part of this work has been supported by the Instituto de Telecomunicações, Next Generation Networks and Applications Group, Portugal, in the framework of the Project VDTN@Lab, and by the Euro-NF Network of Excellence of Seven Framework Programme of EU

Improving the design of wireless sensor networks using QoS-aware opportunistic techniques

The design of a Wireless Sensor Network with QoS is a challenging and complex topic especially when the post-deployment corrections are expensive. This paper proposes a design methodology of Wireless Sensor Networks to estimate network performance in terms of end-to-end delay and reliability. It uses a probabilistic model to determine the needed node density, then adopting a variant of geographic routing it lets to calculate the number of path hops. The introduced opportunistic mechanism offers a trade-off between low end-to-end delay and reliable packets delivery. The modeled network with the adopted Geographic Opportunistic Routing has been evaluated through simulations and some guidelines about its design in order to obtain desired performance are given

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

NB-JNCD Coding and Iterative Joint Decoding Scheme for a Reliable communication in Wireless sensor Networks with results

Privacy threat is a very serious issue in multi-hop wireless networks (MWNs) since open wireless channels are vulnerable to malicious attacks. A distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. Network coding has the potential to thwart traffic analysis attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. This paper proposes non-binary joint network-channel coding for reliable communication in wireless networks. NB-JNCC seamlessly combines non-binary channel coding and random linear network coding, and uses an iterative two-tier coding scheme that weproposed to jointly exploit redundancy inside packets and across packets for error recovery

An Environment-Friendly Multipath Routing Protocol for Underwater Acoustic Sensor Network

Underwater Acoustic Sensor Network (UASN) is a promising technique by facilitating a wide range of aquatic applications. However, routing scheme in UASN is a challenging task because of the characteristics of the nodes mobility, interruption of link, and interference caused by other underwater acoustic systems such as marine mammals. In order to achieve reliable data delivery in UASN, in this work, we present a disjoint multipath disruption-tolerant routing protocol for UASN (ENMR), which incorporates the Hue, Saturation, and Value color space (HSV) model to establish routing paths to greedily forward data packets to sink nodes. ENMR applies the mechanism to maintain the network topology. Simulation results show that, compared with the classic underwater routing protocols named PVBF, ENMR can improve packet delivery ratio and reduce network latency while avoiding introducing additional energy consumption