No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Virtual chain based routing protocol for underwater wireless sensor networks
Abstract
In this paper, we present a virtual chain based routing (VCBR) protocol for underwater wireless sensor networks (UWSNs). Due to sparse deployment of sensor nodes and dynamic network topology in UWSNs, void hole problem occurs. In VCBR, we build a virtual chains between sensor nodes and sink nodes to avoid void hole problem. VCBR also minimizes collision probability due to channel interference in the network. The proposed VCBR protocol, introduces a mechanism to forward data packet through the shortest virtual chain in order to manage the energy resources of sensor nodes. The shortest virtual chain between source node and destination is calculated based on the local knowledge of sensor nodes.
ResearchGate has not been able to resolve any citations for this publication.
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.
Underwater Sensor Network (UWSN) is a representative three-dimensional wireless sensor network. Due to the unique characteristics of underwater acoustic communication, providing energy-efficient and low-latency routing protocols for UWSNs is challenging. Major challenges are water currents, limited resources, and long acoustic propagation delay. Network topology of UWSNs is dynamic and complex as sensors have always been moving with currents. Some proposed protocols adopt geographic routing to address this problem, but three-dimensional localization is hard to obtain in underwater environment. As depth-based routing protocol (DBR) uses depth information only which is much more easier to obtain, it is more practical for UWSNs. However, depth information is not enough to restrict packets to be forwarded within a particular area. Packets may be forwarded through multiple paths which might cause energy waste and increase end-to-end delay. In this paper, we introduce underwater time of arrival (ToA) ranging technique to address the problem above. To maintain all the original advantages of DBR, we make the following contributions: energy-efficient depth-based routing protocol that reduces redundancy energy cost in some blind zones; low-latency depth-based routing protocol that is able to deliver a packet through an optimal path. The proposed protocols are validated through extensive simulations.
Underwater wireless sensor networks (UWSNs) have been showed as a promising technology to monitor and explore the oceans in lieu of traditional undersea wireline instruments. Nevertheless, the data gathering of UWSNs is still severely limited because of the acoustic channel communication characteristics. One way to improve the data collection in UWSNs is through the design of routing protocols considering the unique characteristics of the underwater acoustic communication and the highly dynamic network topology. In this paper, we propose the GEDAR routing protocol for UWSNs. GEDAR is an anycast, geographic and opportunistic routing protocol that routes data packets from sensor nodes to multiple sonobuoys (sinks) at the sea's surface. When the node is in a communication void region, GEDAR switches to the recovery mode procedure which is based on topology control through the depth adjustment of the void nodes, instead of the traditional approaches using control messages to discover and maintain routing paths along void regions. Simulation results show that GEDAR significantly improves the network performance when compared with the baseline solutions, even in hard and difficult mobile scenarios of very sparse and very dense networks and for high network traffic loads.
Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention from both academia and industry, in order to explore the vast underwater environment. UWSNs have peculiar characteristics; that is, they have large propagation delay, high error rate, low bandwidth, and limited energy. Therefore, designing network/routing protocols for UWSNs is very challenging. Also, in UWSNs, improving the energy efficiency is one of the most important issues since the replacement of the batteries of underwater sensor nodes is very expensive due to the unpleasant underwater environment. In this paper, we therefore propose an energy efficient routing protocol, named (energy-efficient depth-based routing protocol) EEDBR for UWSNs. EEDBR utilizes the depth of sensor nodes for forwarding data packets. Furthermore, the residual energy of sensor nodes is also taken into account in order to improve the network lifetime. Based on the comprehensive simulation using NS2, we observe that EEDBR contributes to the performance improvements in terms of the network lifetime, energy consumption, and end-to-end delay. A previous version of this paper was accepted in AST-2011 conference.
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.
In underwater sensor networks (UWSNs), determining the location of every sensor is important and the process of estimating the location of each node in a sensor network is known as localization. While various localization algorithms have been proposed for terrestrial sensor networks, there are relatively few localization schemes for UWSNs. The characteristics of underwater sensor networks are fundamentally different from that of terrestrial networks. Underwater acoustic channels are characterized by harsh physical layer environments with stringent bandwidth limitations. The variable speed of sound and the long propagation delays under water pose a unique set of challenges for localization in UWSN. This paper explores the different localization algorithms that are relevant to underwater sensor networks, and the challenges in meeting the requirements posed by emerging applications for such networks, e.g. offshore engineering.
The salient features of acoustic communications render many schemes that have been designed for terrestrial sensor networks unusable underwater. We therefore propose a novel virtual sink architecture for underwater sensor networks that aims to achieve robustness and energy efficiency under harsh underwater channel conditions. To overcome the long propagation delay and adverse link conditions in such environments, we make use of multipath data delivery. While conventional multipath routing tends to lead to contention near the sink, we avoid this caveat with the virtual sink design involving a group of spatially diverse physical sinks. Hence, we are able to exploit the reliability achieved from redundancy provided by multipath data delivery while mitigating the contention between the nodes.
In this paper, we propose a reliable and interference-aware routing protocol for underwater wireless sensor networks (UWSNs). Proposed protocol follows end-to-end path from source node to sink and selects next forwarder node of a data packet on the basis, having already established a path to sink. In this way, the problem of encounters void hole in depth based routing protocol is eliminated. Furthermore, during the selection of forwarding node, channel interference is also considered as routing metric to provide reliable communication. Therefore, proposed scheme reduces the probability of collision at the network layer, by selecting a neighbor node as the next forwarder of the data packet from the source node to the destination where the chance of channel interference is minimum. Simulation results verify the effectiveness of the proposed scheme in term of energy consumption, end-to-end delay and packet delivery ratio especially in a sparse network.
Due to the limited battery capacity of sensor nodes, a minimization of energy consumption is a potential research area in underwater wireless sensor networks (UWSNs). However, energy hole and coverage hole creations lead performance degradation of UWSNs in terms of network lifetime and throughput. In this paper, we address the energy hole creation issue in depth-based routing techniques, and devise a technique to overcome the deficiencies in existing techniques. Besides addressing the energy hole issue, the proposition of a coverage hole repair technique is also part of this paper. In areas of the dense deployment, sensing ranges of nodes redundantly overlap. Our proposed technique takes a benefit of redundant overlapping and repairs a coverage hole during network operation. Simulation results show that our two techniques cohesively conserve nodes' energy, which ultimately maximizes the network lifetime and throughput at the cost of increased delay.
In underwater acoustic networks, a transmission is done by means of acoustic wave. However, acoustic transmissions suffer long propagation delay and high bit error rate, especially for real time applications. Since speed of sound and underwater noises are varied with water depth, therefore, this paper takes sound speed and underwater noises into account and proposes a channel-aware depth-adaptive routing protocol, named CDRP, for underwater acoustic sensor networks to relief propagation delay and transmission error rate. In CDRP, the source constructs a virtual ideal path to the sink while it has data to send. According to its one-hop neighbor information, the source then chooses one or several proper forwarders to relay the data. Likewise, the forwarders select next forwarders in the same way until the data is sent to the sink. To our best knowledge, CDRP is the first routing protocol considering the effects of underwater noise and sound speed with depth variation. The simulation results show that CDRP has better performance in end-to-end delay and packet delivery ratio.
The design of routing protocols for Underwater Acoustic Sensor Networks (UASNs) poses many challenges due to long propagation, high mobility, limited bandwidth, multi-path and Doppler effect. Because of the void-hole caused by the uneven distribution of nodes and sparse deployment, the selection of next hop forwarding nodes only based on the state of current node may result in the failure of forwarding in the local sparse region. In order to reduce the probability of encountering void holes in the sparse networks, in this paper we present weighting depth and forwarding area division DBR routing protocol, called WDFAD-DBR. The novelties of WDFAD-DBR lie in: firstly, next forwarding nodes are selected according to the weighting sum of depth difference of two hops, which considers not only the current depth but also the depth of expected next hop. In this way, the probability of meeting void holes is effectively reduced. Secondly, the mechanisms for forwarding area division and neighbor node prediction are designed to reduce the energy consumption caused by duplicated packets and neighbors' requests, respectively. Thirdly, we make theoretical analyses on routing performance in case of considering channel contending with respect to delivery ratio, energy consumption and average end-to-end delay. Finally we conduct extensive simulations using NS-3 simulator to verify the effectiveness and validity of WDFAD-DBR.
With the advance of the Internet of Underwater Things, smart things are deployed under the water and form the underwater wireless sensor networks (UWSNs), to facilitate the discovery of vast unexplored ocean volume. A routing protocol, which is not expensive in packets forwarding and energy consumption, is fundamental for sensory data gathering and transmitting in UWSNs. To address this challenge, this paper proposes E-CARP, which is an enhanced version of the Channel-Aware Routing Protocol (CARP) developed by S. Basagni et al., to achieve the location-free and greedy hop-by-hop packet forwarding strategy. Generally, CARP does not consider the reusability of previously collected sensory data to support certain domain applications afterwards, which induces data packets forwarding which may not be beneficial to applications. Besides, the PING-PONG strategy in CARP can be simplified for selecting the most appropriate relay node at each time point, when the network topology is relatively steady. These two research problems have been addressed by our E-CARP. Simulation results validate that our technique can decrease the communication cost significantly and increase the network capability to a certain extent.
The unique characteristics of Underwater Wireless Sensor Networks (UWSNs) attracted the research community to explore different aspects of these networks. Routing is one of the most important and challenging function in UWSNs, for efficient data communication and longevity of sensor node's battery timing. Sensor nodes have energy constraint because replacing the batteries of sensor nodes is an expensive and tough task in harsh aqueous environment. Also interference is a major performance influencing factor. Providing solutions for interference-free communication are also essential. In this paper, we propose three energy-efficient and interference-aware routing protocols named as Inverse Energy Efficient Depth-Based Routing protocol (IEEDBR), Interference-Aware Energy Efficient Depth-Based Routing protocol (IA-EEDBR) and Interference-Aware Inverse Energy Efficient Depth-Based Routing protocol (IA-IEEDBR). Unlike EEDBR, IEEDBR protocol uses depth and minimum residual energy information for selecting data for-warder. While IA-EEDBR takes minimum number of neighbors for forwarder selection. IA-IEEDBR considers depth, minimum residual energy along with minimum number of neighbors for selection of forwarder. Our proposed schemes are validated through simulation and the results demonstrate better performance in terms of improved network lifetime, maximized throughput and reduced path loss.
The paper concerns the definition and performance evaluation of a new multi-hop routing protocol for underwater wireless sensor networks. Our solution, termed CARP for Channel-aware Routing Protocol, exploits link quality information for data forwarding, in that nodes are selected as relays if they exhibit recent history of successful transmissions to their neighbors. CARP avoids loops and can successfully route around connectivity voids and shadow zones by using simple topology information, such as hop count. The protocol is also designed to take advantage of power control for selecting robust links. The performance of CARP has been compared with that of two other protocols for underwater routing, namely, the Focused Beam Routing (FBR) and a flooding-based solution (EFlood). Metrics of interest include packet delivery ratio, end-to-end packet latency and energy consumption, which have been investigated through ns2-based simulations and experiments at sea. The in-field trials have been conducted at two European locations, namely, a Norwegian fjord and the Mediterranean Sea. The tests in the Mediterranean Sea have been performed jointly with the NATO Science and Technology Organization Centre for Maritime Research and Experimentation (STO CMRE), under a collaboration agreement between the University of Roma and CMRE. Our results show that CARP robust mechanism for relay selection doubles the packet delivery ratio of FBR and EFlood. CARP also outperforms FBR and EFlood in terms of energy consumption, and delivers packets significantly faster than FBR.
Design of efficient routing protocols for underwater sensor networks is challenging because of the distinctive characteristics of the water medium. Currently, many routing protocols are available for terrestrial wireless sensor networks. However, specific properties of underwater medium such as limited bandwidth, high propagation delay, high bit error rates, and 3D deployment make the existing routing protocols inappropriate for underwater sensor networks. In this paper, we provide a guideline on use of existing underwater routing protocols, identify their shortcomings, and give an insight on what is needed to design an efficient and reliable underwater routing protocol.
The widespread adoption of the Wireless Sensor Networks (WSNs) in various applications in the terrestrial environment and the rapid advancement of the WSN technology have motivated the development of Underwater Acoustic Sensor Networks (UASNs). UASNs and terrestrial WSNs have several common properties while there are several challenges particular to UASNs that are mostly due to acoustic communications, and inherent mobility. These challenges call for novel architectures and protocols to ensure successful operation of the UASN. Localization is one of the fundamental tasks for UASNs which is required for data tagging, node tracking, target detection, and it can be used for improving the performance of medium access and network protocols. Recently, various UASN architectures and a large number of localization techniques have been proposed. In this paper, we present a comprehensive survey of these architectures and localization methods. To familiarize the reader with the UASNs and localization concepts, we start our paper by providing background information on localization, state-of-the-art oceanographic systems, and the challenges of underwater communications. We then present our detailed survey, followed by a discussion on the performance of the localization techniques and open research issues.
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.
Hydrocast: pressure routing for underwater sensor networks
- Y Noh
- U Lee
- S Lee
- P Wang
- L F Vieira
- J H Cui
- K Kim
Noh, Y., Lee, U., Lee, S., Wang, P., Vieira, L. F., Cui, J. H., and Kim,
K. "Hydrocast: pressure routing for underwater sensor networks." IEEE
Transactions on Vehicular Technology, 65, no.1, 2016: 333-347.
VAPR: void-aware pressure routing for underwater sensor networks
- Y Noh
- U Lee
- P Wang
- B Choi
- M Gerla
Noh, Y., Lee, U., Wang, P., Choi, B., and Gerla, M. "VAPR: void-aware
pressure routing for underwater sensor networks." IEEE Transactions on
Mobile Computing, 12(5), 2013: 895-908.