Abstract

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Highlights

  • A group of interconnected sensor nodes through acoustic channel form a underwater wireless sensor network (UWSN)

  • Sender-based underwater routing protocols relying on geographic information for routing purpose are relative distance based forwarding (RDBF) [13], routing and multi-cast tree-based geo-casting (RMTG) [14], and adaptive routing protocol (ARP)

  • There is a particular cost associated with the mechanical movement of sinks but mobile sinks come to the water surface to deliver data and get recharged, sinks have no constraint of energy to perform network operations

Read more

Summary

Introduction

A group of interconnected sensor nodes through acoustic channel form a underwater wireless sensor network (UWSN). The stateless nature of geographic routing allows it to communicate without establishing entire path from source to destination This algorithm only computes one eligible neighbor which acts as a potential forwarder to relay the data packet. To avoid the transmission of duplicate packets, control message exchange or holding time mechanism is used in opportunistic routing strategy. In the former approach, node with minimum distance and shorter route from the destination compared to nominated neighbors of the sender, is elected to deliver the data by acknowledging with control message that data is delivered successfully.

Geographic Routing
Sender-Based Geographic Routing
Receiver-Based Geographic Routing Algorithms
Opportunistic Routing Protocols
Network Architecture
Beacon Message Types
Potential Neighbor Set Selection
Geospatial Division Model
Target Cube Selection
Next-Hop Forwarder Set Selection Criterion
GRMC-SM
Data Forwarding and Routing in GRMC-SM
Recovery Mode via Sink Mobility
Energy Consumption Minimization
PDR Maximization
Minimization of Average Delay
Simulation Results and Discussion
Simulation Settings
Analysis of Proposed Scheme Results against Existing State of the Art
Fraction of Void Nodes
Depth Adjustment
Energy Consumption
End-To-End Delay
Performance Trade-Offs
Performance Analysis Based on Varying Traffic Loads
Performance Analysis of GRMC-SM by Varying Number of Sinks
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.