An intelligent Q-learning-based tree routing method in underwater acoustic sensor networks

IF 8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Parisa Khoshvaght , Amir Haider , Amir Masoud Rahmani , May Altulyan , Monji Mohamed Zaidi , Mohammad Sadegh Yousefpoor , Efat Yousefpoor , Mehdi Hosseinzadeh
{"title":"An intelligent Q-learning-based tree routing method in underwater acoustic sensor networks","authors":"Parisa Khoshvaght ,&nbsp;Amir Haider ,&nbsp;Amir Masoud Rahmani ,&nbsp;May Altulyan ,&nbsp;Monji Mohamed Zaidi ,&nbsp;Mohammad Sadegh Yousefpoor ,&nbsp;Efat Yousefpoor ,&nbsp;Mehdi Hosseinzadeh","doi":"10.1016/j.engappai.2025.110753","DOIUrl":null,"url":null,"abstract":"<div><div>Nowadays, underwater acoustic sensor networks (UASNs) have emerged as an advanced and promising technology for developing various underwater applications. However, several routing protocols have been suggested for these networks in recent years. This subject is still facing many challenges such as low propagation speed, low bandwidth, and energy restrictions. To solve the above-mentioned challenges, this paper proposes an intelligent <u><strong>Q</strong></u>-learning-based <u><strong>t</strong></u>ree <u><strong>r</strong></u>outing method called QTRU for <u><strong>u</strong></u>nderwater acoustic sensor networks. The proposed scheme includes a network bootstrapping process to be aware of local network topology and calculate the neighboring table related to each node. QTRU also contains a Q-learning-based tree construction process to transmit data from sensor nodes to the sink node. In the routing tree construction process, the reward function in the Q-learning algorithm consists of four parameters, including the depth of the node, remaining energy, successful transmission probability, and the size of the candidate set. In addition, to calculate the state set in the Q-learning algorithm, each node carries out two screening operations on its neighboring nodes on the network. The first screening operation ensure that each node in the routing tree has the least number of hops to the sink node. The second screening operation is to avoid the formation of routing loops between sensor nodes and ensure a tree-based network topology. QTRU also designs a recovery mechanism and allows the sensor nodes present in the void area to select their best parent node in the routing tree. Finally, QTRU is implemented in network simulator version 2 (NS2), and its results are compared with three routing methods, namely reinforcement learning-based opportunistic routing protocol (RLOR), Q-learning-based multi-level routing protocol (MURAO), and energy-efficient depth-based routing protocol (EE-DBR). These results show that QTRU improves the packet delivery rate (about 8.94%), data integrity (about 5.95%), delay (about 7.31%), energy consumption (about 9.74%), and the number of hops in the communication route (about 5.03%).</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"152 ","pages":"Article 110753"},"PeriodicalIF":8.0000,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197625007535","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Nowadays, underwater acoustic sensor networks (UASNs) have emerged as an advanced and promising technology for developing various underwater applications. However, several routing protocols have been suggested for these networks in recent years. This subject is still facing many challenges such as low propagation speed, low bandwidth, and energy restrictions. To solve the above-mentioned challenges, this paper proposes an intelligent Q-learning-based tree routing method called QTRU for underwater acoustic sensor networks. The proposed scheme includes a network bootstrapping process to be aware of local network topology and calculate the neighboring table related to each node. QTRU also contains a Q-learning-based tree construction process to transmit data from sensor nodes to the sink node. In the routing tree construction process, the reward function in the Q-learning algorithm consists of four parameters, including the depth of the node, remaining energy, successful transmission probability, and the size of the candidate set. In addition, to calculate the state set in the Q-learning algorithm, each node carries out two screening operations on its neighboring nodes on the network. The first screening operation ensure that each node in the routing tree has the least number of hops to the sink node. The second screening operation is to avoid the formation of routing loops between sensor nodes and ensure a tree-based network topology. QTRU also designs a recovery mechanism and allows the sensor nodes present in the void area to select their best parent node in the routing tree. Finally, QTRU is implemented in network simulator version 2 (NS2), and its results are compared with three routing methods, namely reinforcement learning-based opportunistic routing protocol (RLOR), Q-learning-based multi-level routing protocol (MURAO), and energy-efficient depth-based routing protocol (EE-DBR). These results show that QTRU improves the packet delivery rate (about 8.94%), data integrity (about 5.95%), delay (about 7.31%), energy consumption (about 9.74%), and the number of hops in the communication route (about 5.03%).
基于智能q学习的水声传感器网络树形路由方法
目前,水声传感器网络(UASNs)作为一种先进的、有前途的技术,已成为开发各种水下应用的技术。然而,近年来已经为这些网络提出了几种路由协议。该课题还面临着低传播速度、低带宽、能量限制等诸多挑战。为了解决上述问题,本文提出了一种基于智能q学习的水声传感器网络树路由方法QTRU。该方案包括一个网络自举过程,用于感知本地网络拓扑并计算与每个节点相关的邻接表。QTRU还包含一个基于q学习的树构建过程,将数据从传感器节点传输到汇聚节点。在路由树构建过程中,Q-learning算法中的奖励函数由节点深度、剩余能量、成功传输概率和候选集大小四个参数组成。此外,为了计算Q-learning算法中的状态集,每个节点对网络上的相邻节点进行两次筛选操作。第一个筛选操作确保路由树中的每个节点到汇聚节点的跳数最少。第二个筛选操作是避免传感器节点之间形成路由环路,确保网络拓扑结构为树型。QTRU还设计了一种恢复机制,允许存在于空洞区域的传感器节点在路由树中选择最佳的父节点。最后,在网络模拟器版本2 (NS2)中实现了QTRU,并将其结果与基于强化学习的机会路由协议(RLOR)、基于q学习的多级路由协议(MURAO)和基于节能深度路由协议(EE-DBR)三种路由方法进行了比较。结果表明,QTRU提高了数据包投递率(约8.94%)、数据完整性(约5.95%)、延迟(约7.31%)、能耗(约9.74%)和通信路由跳数(约5.03%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信