基于Salp群技术的iot - heat网络移动Sink路径规划

Anil Sharma, Manisha Sharma
{"title":"基于Salp群技术的iot - heat网络移动Sink路径规划","authors":"Anil Sharma, Manisha Sharma","doi":"10.1109/ICATIECE56365.2022.10046683","DOIUrl":null,"url":null,"abstract":"For this reason, mobile sinks (MS) have already seen extensive application due to their ability to provide network-wide energy consumption parity and offer implicit load balancing. These nodes form what is known as a cluster topology, and the process of constructing one is known as clustering. An effective route finding system is provided in this study that does more than just solve the aforementioned problem; it also pinpoints where the MS must make pit stops for the transmission of data to be completely trustworthy. Specifically, the Salp Swarm Optimal solution for IoT networks is used, whose primary goal is to reduce the overall grouping time required by the suggested system. The target sites that make up the MS's route are decided using the circumferential visit approach. The results of the performance study demonstrate that the suggested strategy extends the life of the network by decreasing the required number of cluster updates and the time it takes to complete each update.","PeriodicalId":199942,"journal":{"name":"2022 Second International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","volume":"68 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Path Plannning for Mobile Sink using Salp Swarm Technique in IoT-Het Networks\",\"authors\":\"Anil Sharma, Manisha Sharma\",\"doi\":\"10.1109/ICATIECE56365.2022.10046683\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For this reason, mobile sinks (MS) have already seen extensive application due to their ability to provide network-wide energy consumption parity and offer implicit load balancing. These nodes form what is known as a cluster topology, and the process of constructing one is known as clustering. An effective route finding system is provided in this study that does more than just solve the aforementioned problem; it also pinpoints where the MS must make pit stops for the transmission of data to be completely trustworthy. Specifically, the Salp Swarm Optimal solution for IoT networks is used, whose primary goal is to reduce the overall grouping time required by the suggested system. The target sites that make up the MS's route are decided using the circumferential visit approach. The results of the performance study demonstrate that the suggested strategy extends the life of the network by decreasing the required number of cluster updates and the time it takes to complete each update.\",\"PeriodicalId\":199942,\"journal\":{\"name\":\"2022 Second International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)\",\"volume\":\"68 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 Second International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICATIECE56365.2022.10046683\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Second International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICATIECE56365.2022.10046683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于这个原因,移动接收器(MS)已经看到了广泛的应用,因为它们能够提供网络范围的能耗平价和提供隐式负载平衡。这些节点形成了所谓的集群拓扑,构建集群的过程称为集群。本研究提供了一个有效的寻路系统,不仅解决了上述问题;它还精确地指出了MS必须在哪里进行停站才能使数据传输完全可信。具体来说,使用了物联网网络的Salp群最优解决方案,其主要目标是减少建议系统所需的总体分组时间。组成MS路线的目标站点是使用圆周访问方法确定的。性能研究的结果表明,建议的策略通过减少所需的集群更新次数和完成每次更新所需的时间来延长网络的生命周期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Path Plannning for Mobile Sink using Salp Swarm Technique in IoT-Het Networks
For this reason, mobile sinks (MS) have already seen extensive application due to their ability to provide network-wide energy consumption parity and offer implicit load balancing. These nodes form what is known as a cluster topology, and the process of constructing one is known as clustering. An effective route finding system is provided in this study that does more than just solve the aforementioned problem; it also pinpoints where the MS must make pit stops for the transmission of data to be completely trustworthy. Specifically, the Salp Swarm Optimal solution for IoT networks is used, whose primary goal is to reduce the overall grouping time required by the suggested system. The target sites that make up the MS's route are decided using the circumferential visit approach. The results of the performance study demonstrate that the suggested strategy extends the life of the network by decreasing the required number of cluster updates and the time it takes to complete each update.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信