Dcaro:针对高能效 UASN 的动态集群形成和 AUV 辅助路由优化

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Peer-To-Peer Networking and Applications Pub Date : 2024-07-12 DOI:10.1007/s12083-024-01756-1
Kammula Sunil Kumar, Deepak Singh, Veena Anand
{"title":"Dcaro:针对高能效 UASN 的动态集群形成和 AUV 辅助路由优化","authors":"Kammula Sunil Kumar, Deepak Singh, Veena Anand","doi":"10.1007/s12083-024-01756-1","DOIUrl":null,"url":null,"abstract":"<p>In Underwater Acoustic Sensor Networks (UASNs), optimizing energy efficiency and minimizing void occurrences in routing is paramount. Due to the energy constraints of sensor nodes, low-power transmission is essential for conserving energy. Previous research highlighted the effectiveness of clustering and routing to enhance energy efficacy in UASNs. Therefore, the clustering and routing processes can be considered as optimization problems that are nondeterministic polynomial-time (NP) hard. These challenges can be tackled through the application of machine learning algorithms and meta-heuristics. In this context, K-means clustering is employed to partition the network into clusters, designating the centroid as an ideal Cluster Head (CH) location. This ensures a one-hop proximity between the CH and cluster members, reducing transmitting power and enhancing network energy efficiency. Subsequently, a potential CH is selected using a marine predator optimization (MPA) algorithm based on the derived multi-objective fitness function. The MPA algorithm not only determines the optimal CH but also moves the elected CH to the K-means centroid location. Consequently, Autonomous Underwater Vehicles (AUVs) are utilized to collect and route packets from the CH to the Base Station (BS), minimizing the occurrence of void nodes and avoiding obstacle collisions. An optimal routing path for AUV is established through a way-point-based navigation scheme to achieve high packet reliability. Additionally, the proposed method (DCARo) dynamically determines the optimal number of clusters using the elbow method, ensuring scalability according to network size. Extensive simulations affirm the superiority of the DCARo across various performance metrics.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"247 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dcaro: Dynamic cluster formation and AUV-aided routing optimization for energy-efficient UASNs\",\"authors\":\"Kammula Sunil Kumar, Deepak Singh, Veena Anand\",\"doi\":\"10.1007/s12083-024-01756-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In Underwater Acoustic Sensor Networks (UASNs), optimizing energy efficiency and minimizing void occurrences in routing is paramount. Due to the energy constraints of sensor nodes, low-power transmission is essential for conserving energy. Previous research highlighted the effectiveness of clustering and routing to enhance energy efficacy in UASNs. Therefore, the clustering and routing processes can be considered as optimization problems that are nondeterministic polynomial-time (NP) hard. These challenges can be tackled through the application of machine learning algorithms and meta-heuristics. In this context, K-means clustering is employed to partition the network into clusters, designating the centroid as an ideal Cluster Head (CH) location. This ensures a one-hop proximity between the CH and cluster members, reducing transmitting power and enhancing network energy efficiency. Subsequently, a potential CH is selected using a marine predator optimization (MPA) algorithm based on the derived multi-objective fitness function. The MPA algorithm not only determines the optimal CH but also moves the elected CH to the K-means centroid location. Consequently, Autonomous Underwater Vehicles (AUVs) are utilized to collect and route packets from the CH to the Base Station (BS), minimizing the occurrence of void nodes and avoiding obstacle collisions. An optimal routing path for AUV is established through a way-point-based navigation scheme to achieve high packet reliability. Additionally, the proposed method (DCARo) dynamically determines the optimal number of clusters using the elbow method, ensuring scalability according to network size. Extensive simulations affirm the superiority of the DCARo across various performance metrics.</p>\",\"PeriodicalId\":49313,\"journal\":{\"name\":\"Peer-To-Peer Networking and Applications\",\"volume\":\"247 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Peer-To-Peer Networking and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12083-024-01756-1\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01756-1","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在水下声学传感器网络(UASN)中,优化能源效率和尽量减少路由过程中的空洞是至关重要的。由于传感器节点的能量限制,低功耗传输对节约能量至关重要。以往的研究强调了聚类和路由选择对提高 UASN 能源效率的有效性。因此,聚类和路由过程可视为非确定性多项式时间(NP)困难的优化问题。这些难题可以通过应用机器学习算法和元启发式来解决。在这种情况下,我们采用 K-means 聚类将网络划分为若干个簇,并将中心点指定为理想的簇头(CH)位置。这确保了 CH 和簇成员之间的一跳距离,降低了发射功率,提高了网络能效。随后,利用海洋捕食者优化(MPA)算法,根据推导出的多目标适合度函数选择潜在的 CH。MPA 算法不仅能确定最佳 CH,还能将选出的 CH 移至 K-means 中心点位置。因此,利用自主水下航行器(AUV)收集和路由从 CH 到基站(BS)的数据包,最大限度地减少无效节点的出现并避免障碍物碰撞。通过基于航点的导航方案为 AUV 建立最佳路由路径,以实现高数据包可靠性。此外,所提出的方法(DCARo)使用肘法动态确定最佳簇数,确保了根据网络规模的可扩展性。广泛的模拟证实了 DCARo 在各种性能指标上的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dcaro: Dynamic cluster formation and AUV-aided routing optimization for energy-efficient UASNs

In Underwater Acoustic Sensor Networks (UASNs), optimizing energy efficiency and minimizing void occurrences in routing is paramount. Due to the energy constraints of sensor nodes, low-power transmission is essential for conserving energy. Previous research highlighted the effectiveness of clustering and routing to enhance energy efficacy in UASNs. Therefore, the clustering and routing processes can be considered as optimization problems that are nondeterministic polynomial-time (NP) hard. These challenges can be tackled through the application of machine learning algorithms and meta-heuristics. In this context, K-means clustering is employed to partition the network into clusters, designating the centroid as an ideal Cluster Head (CH) location. This ensures a one-hop proximity between the CH and cluster members, reducing transmitting power and enhancing network energy efficiency. Subsequently, a potential CH is selected using a marine predator optimization (MPA) algorithm based on the derived multi-objective fitness function. The MPA algorithm not only determines the optimal CH but also moves the elected CH to the K-means centroid location. Consequently, Autonomous Underwater Vehicles (AUVs) are utilized to collect and route packets from the CH to the Base Station (BS), minimizing the occurrence of void nodes and avoiding obstacle collisions. An optimal routing path for AUV is established through a way-point-based navigation scheme to achieve high packet reliability. Additionally, the proposed method (DCARo) dynamically determines the optimal number of clusters using the elbow method, ensuring scalability according to network size. Extensive simulations affirm the superiority of the DCARo across various performance metrics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
期刊最新文献
Are neck pain, disability, and deep neck flexor performance the same for the different types of temporomandibular disorders? Enhancing cloud network security with a trust-based service mechanism using k-anonymity and statistical machine learning approach Towards real-time non-preemptive multicast scheduling in reconfigurable data center networks Homomorphic multi-party computation for Internet of Medical Things BPPKS: A blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1