大规模无线传感器网络中基于Cat群优化的移动sink调度

IF 1 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Srinivasulu Boyineni, K. Kavitha, Meruva Sreenivasulu
{"title":"大规模无线传感器网络中基于Cat群优化的移动sink调度","authors":"Srinivasulu Boyineni, K. Kavitha, Meruva Sreenivasulu","doi":"10.1504/ijcnds.2023.127475","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks (WSNs), the hotspot problem is one of the major challenging issues because it isolates some network parts and interrupts the data routing. The hotspot problem is mitigated through a mobile sink, where it visits a set of nodes in the network called rendezvous points, whereas the remaining nodes traverse their data to it. In large-scale WSNs, the travelling distance of MS is longer, and it increases the delay of reaching an RP. So, the data overflow may occur due to a limited buffer of sensor nodes. This problem is avoided by increasing the number of mobile sinks in the WSNs. In this context, a cat-swarm optimisation algorithm is used to decide the optimal set of mobile sinks and a simple geometric method to determine the optimal visiting order for each mobile sink. The proposed work is compared with start-of-art literature, and the proposed work outperforms them.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":1.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cat swarm optimisation-based mobile sinks scheduling in large-scale wireless sensor networks\",\"authors\":\"Srinivasulu Boyineni, K. Kavitha, Meruva Sreenivasulu\",\"doi\":\"10.1504/ijcnds.2023.127475\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless sensor networks (WSNs), the hotspot problem is one of the major challenging issues because it isolates some network parts and interrupts the data routing. The hotspot problem is mitigated through a mobile sink, where it visits a set of nodes in the network called rendezvous points, whereas the remaining nodes traverse their data to it. In large-scale WSNs, the travelling distance of MS is longer, and it increases the delay of reaching an RP. So, the data overflow may occur due to a limited buffer of sensor nodes. This problem is avoided by increasing the number of mobile sinks in the WSNs. In this context, a cat-swarm optimisation algorithm is used to decide the optimal set of mobile sinks and a simple geometric method to determine the optimal visiting order for each mobile sink. The proposed work is compared with start-of-art literature, and the proposed work outperforms them.\",\"PeriodicalId\":45170,\"journal\":{\"name\":\"International Journal of Communication Networks and Distributed Systems\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Communication Networks and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijcnds.2023.127475\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Communication Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijcnds.2023.127475","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

摘要

在无线传感器网络(WSNs)中,热点问题是一个具有挑战性的主要问题之一,因为它隔离了网络的某些部分并中断了数据路由。热点问题通过移动接收器得到缓解,移动接收器访问网络中称为会合点的一组节点,而其余节点将其数据遍历到它。在大规模WSNs中,MS的传播距离较长,这增加了到达RP的延迟。因此,由于传感器节点的缓冲区有限,可能会发生数据溢出。通过增加无线传感器网络中移动接收器的数量可以避免这个问题。在这种情况下,使用猫群优化算法来确定最优的移动汇集,并使用简单的几何方法来确定每个移动汇的最优访问顺序。建议的工作与艺术开始的文献进行比较,建议的工作优于它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cat swarm optimisation-based mobile sinks scheduling in large-scale wireless sensor networks
In wireless sensor networks (WSNs), the hotspot problem is one of the major challenging issues because it isolates some network parts and interrupts the data routing. The hotspot problem is mitigated through a mobile sink, where it visits a set of nodes in the network called rendezvous points, whereas the remaining nodes traverse their data to it. In large-scale WSNs, the travelling distance of MS is longer, and it increases the delay of reaching an RP. So, the data overflow may occur due to a limited buffer of sensor nodes. This problem is avoided by increasing the number of mobile sinks in the WSNs. In this context, a cat-swarm optimisation algorithm is used to decide the optimal set of mobile sinks and a simple geometric method to determine the optimal visiting order for each mobile sink. The proposed work is compared with start-of-art literature, and the proposed work outperforms them.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.50
自引率
46.20%
发文量
57
期刊介绍: IJCNDS aims to improve the state-of-the-art of worldwide research in communication networks and distributed systems and to address the various methodologies, tools, techniques, algorithms and results. It is not limited to networking issues in telecommunications; network problems in other application domains such as biological networks, social networks, and chemical networks will also be considered. This feature helps in promoting interdisciplinary research in these areas.
×
引用
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学术官方微信