Journal Article10.1016/J.ADHOC.2015.08.023
Wdfad-dbr
Haitao Yu,Nianmin Yao,Tong Wang,Guangshun Li,Zhenguo Gao,Guozhen Tan +5 more
- 01 Feb 2016
- Vol. 37, Iss: 37, pp 256-282
151
TL;DR: Weighting depth and forwarding area division DBR routing protocol, called WDFAD-DBR, which considers not only the current depth but also the depth of expected next hop to reduce the probability of encountering void holes in the sparse networks.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Void-Handling Techniques for Routing Protocols in Underwater Sensor Networks: Survey and Challenges
TL;DR: The state of the art of void-handling techniques proposed by underwater geographic greedy routing protocols, along with the recent advances, are reviewed and a qualitative comparison of these techniques is presented.
Reliable Data Collection Techniques in Underwater Wireless Sensor Networks: A Survey
TL;DR: To provide readers with an overview of reliable data collection techniques in UWSNs, this paper categorizes them according to their ability to enhance reliability at all the key stages of data collection.
On Underwater Wireless Sensor Networks Routing Protocols: A Review
TL;DR: The routing protocols are characterized into three main categories; localization-based, localization-free and cooperative schemes and the performance of these protocols are discussed with respect to various network parameters such as energy consumption, network lifetime, delay, reliability, and communication overheads.
117
Reinforcement Learning-Based Opportunistic Routing Protocol for Underwater Acoustic Sensor Networks
TL;DR: In this article, a reinforcement learning-based opportunistic routing protocol (RLOR) is proposed by combining the advantages of opportunistic and reinforcement learning algorithm for underwater acoustic sensor networks, which comprehensively considers nodes' peripheral status to select the appropriate relay nodes.
90
A Multi-Layer Cluster Based Energy Efficient Routing Scheme for UWSNs
TL;DR: A multi-layer cluster-based Energy Efficient (MLCEE) protocol for UWSNs to address the issue of hotspot and energy consumption and the simulation results have revealed that MLCEE achieves superior performance than the other techniques with regard to the network lifetime, energy consumption, and data transmission amount.
References
•Book
Probability, random variables, and stochastic processes
Athanasios Papoulis,S. Unnikrishna Pillai +1 more
- 01 Jan 2002
TL;DR: In this paper, the meaning of probability and random variables are discussed, as well as the axioms of probability, and the concept of a random variable and repeated trials are discussed.
12.7K
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Charles E. Perkins,Pravin Bhagwat +1 more
- 01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Related Papers (5)
Hai Yan,Zhijie Jerry Shi,Jun-Hong Cui +2 more
- 05 May 2008
Ian F. Akyildiz,Dario Pompili,Tommaso Melodia +2 more
- 01 May 2005
Peng Xie,Jun-Hong Cui,Li Lao +2 more
- 15 May 2006