507 research outputs found

    A novel cooperative opportunistic routing scheme for underwater sensor networks

    Get PDF
    Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance

    A stateless opportunistic routing protocol for underwater sensor networks

    Get PDF
    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

    Co-EEORS : cooperative energy efficient optimal relay selection protocol for underwater wireless sensor networks

    Get PDF
    Cooperative routing mitigates the adverse channel effects in the harsh underwater environment and ensures reliable delivery of packets from the bottom to the surface of water. Cooperative routing is analogous to sparse recovery in that faded copies of data packets are processed by the destination node to extract the desired information. However, it usually requires information about the two or three position coordinates of the nodes. It also requires the synchronization of the source, relay, and destination nodes. These features make the cooperative routing a challenging task as sensor nodes move with water currents. Moreover, the data packets are simply discarded if the acceptable threshold is not met at the destination. This threatens the reliable delivery of data to the final destination. To cope with these challenges, this paper proposes a cooperative energy-efficient optimal relay selection protocol for underwater wireless sensor networks. Unlike the existing routing protocols involving cooperation, the proposed scheme combines location and depth of the sensor nodes to select the destination nodes. Combination of these two parameters does not involve knowing the position coordinates of the nodes and results in selection of the destination nodes closest to the water surface. As a result, data packets are less affected by the channel properties. In addition, a source node chooses a relay node and a destination node. Data packets are sent to the destination node by the relay node as soon as the relay node receives them. This eliminates the need for synchronization among the source, relay, and destination nodes. Moreover, the destination node acknowledges the source node about the successful reception or retransmission of the data packets. This overcomes the packets drop. Based on simulation results, the proposed scheme is superior in delivering packets to the final destination than some existing techniques. © 2013 IEEE

    Maximize resource utilization based channel access model with presence of reactive jammer for underwater wireless sensor network

    Get PDF
    Underwater sensor networks (UWSNs) are vulnerable to jamming attacks. Especially, reactive jamming which emerged as a greatest security threat to UWSNs. Reactive jammer are difficult to be removed, defended and identified. Since reactive jammer can control and regulate (i.e., the duration of the jam signal) the probability of jamming for maintaining high vulnerability with low detection probability. The existing model are generally designed considering terrestrial wireless sensor networks (TWSNs). Further, these models are limited in their ability to detect jamming correctly, distinguish between the corrupted and uncorrupted parts of a packet, and be adaptive with the dynamic environment. Cooperative jamming model has presented in recent times to utilize resource efficiently. However, very limited work is carried out using cooperative jamming detection. For overcoming research challenges, this work present Maximize Resource Utilization based Channel Access (MRUCA). The MRUCA uses cross layer design for mitigating reactive jammer (i.e., MRUCA jointly optimizes the cooperative hopping probabilities and channel accessibility probabilities of authenticated sensor device). Along with channel, load capacity of authenticated sensor device is estimated to utilize (maximize) resource efficiently. Experiment outcome shows the proposed MRUCA model attain superior performance than state-of-art model in terms of packet transmission, BER and Detection rate

    Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks

    Full text link
    For improving the efficiency and the reliability of the opportunistic routing algorithm, in this paper, we propose the cross-layer and reliable opportunistic routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the improved efficiency fuzzy logic and humoral regulation inspired topology control into the opportunistic routing algorithm. In CBRT, the inputs of the fuzzy logic system are the relative variance (rv) of the metrics rather than the values of the metrics, which reduces the number of fuzzy rules dramatically. Moreover, the number of fuzzy rules does not increase when the number of inputs increases. For reducing the control cost, in CBRT, the node degree in the candidate relays set is a range rather than a constant number. The nodes are divided into different categories based on their node degree in the candidate relays set. The nodes adjust their transmission range based on which categories that they belong to. Additionally, for investigating the effection of the node mobility on routing performance, we propose a link lifetime prediction algorithm which takes both the moving speed and moving direction into account. In CBRT, the source node determines the relaying priorities of the relaying nodes based on their utilities. The relaying node which the utility is large will have high priority to relay the data packet. By these innovations, the network performance in CBRT is much better than that in ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201

    Routing Protocols for Underwater Acoustic Sensor Networks: A Survey from an Application Perspective

    Get PDF
    Underwater acoustic communications are different from terrestrial radio communications; acoustic channel is asymmetric and has large and variable end‐to‐end propagation delays, distance‐dependent limited bandwidth, high bit error rates, and multi‐path fading. Besides, nodes’ mobility and limited battery power also cause problems for networking protocol design. Among them, routing in underwater acoustic networks is a challenging task, and many protocols have been proposed. In this chapter, we first classify the routing protocols according to application scenarios, which are classified according to the number of sinks that an underwater acoustic sensor network (UASN) may use, namely single‐sink, multi‐sink, and no‐sink. We review some typical routing strategies proposed for these application scenarios, such as cross‐layer and reinforcement learning as well as opportunistic routing. Finally, some remaining key issues are highlighted

    PB-ACR: Node Payload Balanced Ant Colony Optimal Cooperative Routing for Multi-Hop Underwater Acoustic Sensor Networks

    Get PDF
    For a given source-destination pair in multi-hop underwater acoustic sensor networks (UASNs), an optimal route is the one with the lowest energy consumptions that usually consists of the same relay nodes even under different transmission tasks. However, this will lead to the unbalanced payload of the relay nodes in the multi-hop UASNs and accelerate the loss of the working ability for the entire system. In this paper, we propose a node payload balanced ant colony optimal cooperative routing (PB-ACR) protocol for multi-hop UASNs, through combining the ant colony algorithm and cooperative transmission. The proposed PB-ACR protocol is a relay node energy consumption balanced scheme, which considers both data priority and residual energy of each relay node, aiming to reduce the occurrence of energy holes and thereby prolong the lifetime of the entire UASNs. We compare the proposed PB-ACR protocol with the existing ant colony algorithm routing (ACAR) protocol to verify its performances in multi-hop UASNs, in terms of network throughput, energy consumption, and algorithm complexity. The simulation results show that the proposed PB-ACR protocol can effectively balance the energy consumption of underwater sensor nodes and hence prolong the network lifetime
    corecore