4.8 Article

Anypath Routing Protocol Design via Q-Learning for Underwater Sensor Networks

期刊

IEEE INTERNET OF THINGS JOURNAL
卷 8, 期 10, 页码 8173-8190

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2020.3042901

关键词

Anypath routing protocol; holding time mechanism; Internet of Underwater Things (IoUT); Q-learning; underwater sensor networks (UWSNs)

资金

  1. National Natural Science Foundation of China [U2006211]
  2. National Key Research and Development Project of China [2020YFC1523204]

向作者/读者索取更多资源

This article proposes a Q-learning-based localization-free anypath routing (QLFR) protocol for UWSNs, aiming to prolong the network lifetime and reduce end-to-end delay. The protocol calculates Q-values to determine optimal routing policies by considering residual energy and depth information of sensor nodes. By defining reward functions and designing a holding time mechanism based on priority, the protocol shows superior performance in terms of end-to-end delay and network lifetime through mathematical analyses and simulation results.
As a promising technology in the Internet of Underwater Things, underwater sensor networks (UWSNs) have drawn a widespread attention from both academia and industry. However, designing a routing protocol for UWSNs is a great challenge due to high energy consumption and large latency in the underwater environment. This article proposes a Q-learning-based localization-free anypath routing (QLFR) protocol to prolong the lifetime as well as reduce the end-toend delay for UWSNs. Aiming at optimal routing policies, the Q-value is calculated by jointly considering the residual energy and depth information of sensor nodes throughout the routing process. More specifically, we define two reward functions (i.e., depth-related and energy-related rewards) for Q-learning with the objective of reducing latency and extending network lifetime. In addition, a new holding time mechanism for packet forwarding is designed according to the priority of forwarding candidate nodes. Furthermore, mathematical analyses are presented to analyze the performance and computational complexity of the proposed routing protocol. Extensive simulation results demonstrate the superiority performance of the proposed routing protocol in terms of the end-to-end delay and the network lifetime.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据