Conference Paper

Geospatial division based geographic routing for interference avoidance in Underwater WSNs

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

In Underwater wireless sensor networks (UWSNs), geographic routing paradigm seems promising choice for data transmission in severely limited acoustic communication channel conditions. The main challenge of geographic routing in sparse network conditions is communication void. In this context, we propose geospatial division based geo-opportunistic routing scheme for interference avoidance (GDGOR-IA) focusing on interference in the network. The scheme is two fold, selection of target cube and selection of optimal next hop forwarder node in the target cube.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
Underwater wireless sensor network (UWSN) features many unique characteristics, including slow propagation speed, high end-to-end delay, low available bandwidth, variable link quality, and energy constraint. All these problems pose a big challenge to devise a transmission efficient, energy-saving, and low delay routing protocol for UWSNs. In this paper we devise a relative distance based forwarding (RDBF) routing protocol, which aims to provide transmission efficient, energy-saving, and low delay routing. We utilize a fitness factor to measure and judge the degree of appropriateness for a node to forward the packets. Under the limitations of the fitness factor, RDBF can confine the scope of the candidate forwarders and find the beneficial relays to forward packets. In this way, only a small fraction of nodes are involved in forwarding process, which can distinctly reduce the energy consumption. Moreover, using only the selected beneficial nodes as forwarders can both enhance the transmission efficiency and reduce the end-to-end delay. This is because the distances of these nodes to the sink are the shortest and the hop counts of routing paths consisted by these nodes are minimum. We use the ns-2 based simulator to conduct our experiment; the results show that RDBF performs better in terms of packet delivery ratio, end-to-end delay, and energy efficiency.
Article
Full-text available
In Underwater Acoustic Sensor Networks (UASNs), fundamental difference between operational methodologies of routing schemes arises due to the requirement of time-critical applications therefore, there is a need for the design of delay-sensitive techniques. In this paper, Delay-Sensitive Depth-Based Routing (DSDBR), Delay-Sensitive Energy Efficient Depth-Based Routing (DSEEDBR) and Delay-Sensitive Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (DSAMCTD) protocols are proposed to empower the depth-based routing schemes. The proposed approaches formulate delay-efficient Priority Factors (PF) and Delay-Sensitive Holding time (DS HT) to minimize end-to-end delay with a small decrease in network throughput. These schemes also employ an optimal weight function WF for the computation of transmission loss and speed of received signal. Furthermore, solution for delay lies in efficient data forwarding, minimal relative transmissions in low-depth region and better forwarder selection. Simulations are performed to assess the proposed protocols and the results indicate that the three schemes largely minimize end-to-end delay of network.
Article
Full-text available
Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols while considering the unique characteristics of underwater communication. Several routing protocols are proposed for this issue and can be classified into geographic and non-geographic routing protocols. In this paper we focus on the geographic routing protocols. We introduce a review and comparison of different algorithms proposed recently in the literature. We also presented a novel taxonomy of these routing in which the protocols are classified into three categories (greedy, restricted directional flooding and hierarchical) according to their forwarding strategies
Article
Full-text available
Underwater sensor nodes will find applications in oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation and tactical surveillance applications. Moreover, unmanned or autonomous underwater vehicles (UUVs, AUVs), equipped with sensors, will enable the exploration of natural undersea resources and gathering of scientific data in collaborative monitoring missions. Underwater acoustic networking is the enabling technology for these applications. Underwater networks consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area.In this paper, several fundamental key aspects of underwater acoustic communications are investigated. Different architectures for two-dimensional and three-dimensional underwater sensor networks are discussed, and the characteristics of the underwater channel are detailed. The main challenges for the development of efficient networking solutions posed by the underwater environment are detailed and a cross-layer approach to the integration of all communication functionalities is suggested. Furthermore, open research issues are discussed and possible solution approaches are outlined.
Conference Paper
Most of the work on geocasting has been done for mobile ad-hoc networks and vehicular ad-hoc networks. This paper presents a novel Geocast technique with the hole detection in the geocast region for underwater environment. The proposed model named as Routing and Multicast Tree based Geocasting (RMTG) has been designed for underwater sensor networks. Here we propose a theoretical model for underwater geocasting RMTG that uses greedy forwarding and previous hop handshaking to route the packets towards the geocast region. This technique further disseminates the data within the geocast region by creating a multicast shortest path tree. The technique also proposes a method of hole detection inside the geocast region and a virtual area based routing around the boundaries of the geocast region to reach the geocast region from opposite side. This model provides an efficient geocast technique in terms of node mobility handling, lesser memory utilization, lesser calculations and a better end to end latency. In addition to this the proposed model does not use flooding inside the geocast region that is used in most of the geocasting techniques and also for guaranteed data delivery inside the geocast region, the proposed model does not use the planarization graph concepts.
Conference Paper
Providing scalable and ecient routing services in underwater sensor net- works (UWSNs) is very challenging due to the unique characteristics of UWSNs. Firstly, UWSNs often employ acoustic channels for communications because radio signals do not work well in water. Compared with radio-frequency channels, acous- tic channels feature much lower bandwidths and several orders of magnitudes longer propagation delays. Secondly, UWSNs usually have very dynamic topology as sen- sors move passively with water currents. Some routing protocols have been proposed to address the challenging problem in UWSNs. However, most of them assume that the full-dimensional location information of all sensor nodes in a network is known in prior through a localization process, which is yet another challenging issue to be solved in UWSNs. In this paper, we propose a depth-based routing (DBR) protocol. DBR does not require full-dimensional location information of sensor nodes. Instead, it needs only local depth information, which can be easily obtained with an inex- pensive depth sensor that can be equipped in every underwater sensor node. A key advantage of our protocol is that it can handle network dynamics eciently with- out the assistance of a localization service. Moreover, our routing protocol can take advantage of a multiple-sink underwater sensor network architecture without intro- ducing extra cost. We conduct extensive simulations. The results show that DBR can achieve very high packet delivery ratios (at least 95%) for dense networks with only small communication cost.
Conference Paper
As an emerging technique, underwater sensor network (UWSN) will enable a wide range of aquatic applications. However, due to the adverse underwater environmental conditions as well as some system constraints, an underwater sensor network is usually viewed as an intermittently connected network (ICN) (or delay/disruption tolerant network (DTN)), which requires specialized routing protocols. Moreover, applications may have different requirements for different types of messages, as demands a smart protocol to handle packets adaptively. In this paper, we propose a novel routing protocol where routing is performed adaptively based on the types of messages and application requirements. This is obtained by exploiting message redundancy and resource reallocation in order to achieve different performance requirements. We demonstrate through simulations that our protocol can satisfy different application requirements and achieve a good trade-off among delivery ratio, end-to-end delay and energy consumption.
Article
The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs