Data Acquisition through Mobile Sink for WSNs with Obstacles Using Support Vector Machine

J. Sensors Pub Date : 2022-08-25 DOI:10.1155/2022/4242740
G. Sulakshana, G. Kamatam
{"title":"Data Acquisition through Mobile Sink for WSNs with Obstacles Using Support Vector Machine","authors":"G. Sulakshana, G. Kamatam","doi":"10.1155/2022/4242740","DOIUrl":null,"url":null,"abstract":"Mobile sink-based data collection in wireless sensor networks has become an attractive research area to mitigate hotspot issues. It further increases the efficiency of the WSN, such as throughput, lifetime, and energy efficiency, while decreasing delay and packet losses. Mobile sink algorithms developed by many researchers in recent years have only contributed to obtain efficient path planning, and only a few researchers have focused on solving the problem of network environment with obstacles. Here, constructing an obstacle-aware path for the mobile sink to collect data in WSN is a challenging issue. In this context, we present the data acquisition through mobile sink for WSNs with obstacles using support vector machine (DAOSVM). The DAOSVM algorithm works in two phases: visiting point selection and path construction. The visiting point selection uses spanning tree approach, and the path selection uses SVM. The computational complexity of the proposed DAOSVM is estimated and compared using the existing techniques, and it is lower. The DAOSVM also outperforms traditional methods concerning multiple performance metrics under various scenarios.","PeriodicalId":14776,"journal":{"name":"J. Sensors","volume":"10 1","pages":"1-20"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Sensors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/4242740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Mobile sink-based data collection in wireless sensor networks has become an attractive research area to mitigate hotspot issues. It further increases the efficiency of the WSN, such as throughput, lifetime, and energy efficiency, while decreasing delay and packet losses. Mobile sink algorithms developed by many researchers in recent years have only contributed to obtain efficient path planning, and only a few researchers have focused on solving the problem of network environment with obstacles. Here, constructing an obstacle-aware path for the mobile sink to collect data in WSN is a challenging issue. In this context, we present the data acquisition through mobile sink for WSNs with obstacles using support vector machine (DAOSVM). The DAOSVM algorithm works in two phases: visiting point selection and path construction. The visiting point selection uses spanning tree approach, and the path selection uses SVM. The computational complexity of the proposed DAOSVM is estimated and compared using the existing techniques, and it is lower. The DAOSVM also outperforms traditional methods concerning multiple performance metrics under various scenarios.
基于支持向量机的障碍物无线传感器网络移动汇聚数据采集
无线传感器网络中基于移动接收器的数据采集已成为缓解热点问题的一个有吸引力的研究领域。它进一步提高了WSN的效率,如吞吐量、寿命和能源效率,同时减少了延迟和丢包。近年来许多研究人员开发的移动汇聚算法仅对获得高效的路径规划做出了贡献,很少有研究人员将重点放在解决有障碍物的网络环境问题上。在无线传感器网络中,为移动接收器构建障碍物感知路径是一个具有挑战性的问题。在此背景下,我们提出了使用支持向量机(DAOSVM)对带有障碍物的wsn进行移动sink数据采集。DAOSVM算法分为两个阶段:访问点选择和路径构建。访问点选择采用生成树方法,路径选择采用支持向量机方法。通过与现有方法的比较,估计了该方法的计算复杂度,得到了较低的结果。在各种场景下,DAOSVM在多个性能指标方面也优于传统方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信