SSMA: simplified slime mould algorithm for optimization wireless sensor network coverage problem

IF 3.2 Q2 AUTOMATION & CONTROL SYSTEMS
Yuanye Wei, Xiuxi Wei, Huajuan Huang, Jian Bi, Yongquan Zhou, Yanlian Du
{"title":"SSMA: simplified slime mould algorithm for optimization wireless sensor network coverage problem","authors":"Yuanye Wei, Xiuxi Wei, Huajuan Huang, Jian Bi, Yongquan Zhou, Yanlian Du","doi":"10.1080/21642583.2022.2084650","DOIUrl":null,"url":null,"abstract":"Wireless sensor network (WSN) coverage problem is to think about how to maximize the network coverage to obtain reliable monitoring and tracking services with guaranteed quality of service. In this paper, a simplified slime mould algorithm (SSMA) for solving the WSN coverage problem is proposed. In SSMA, we mainly conducted 13 groups of WSNs coverage optimization experiments and compared them with six well-known meta-heuristic optimization algorithms. The experimental results and Wilcoxon rank-sum test show that the proposed SSMA is generally competitive, outstanding performance and effectiveness. We proposed SSMA algorithm could be helpful to effectively control the network nodes energy, improve the perceived quality of services and extend the network survival time.","PeriodicalId":46282,"journal":{"name":"Systems Science & Control Engineering","volume":null,"pages":null},"PeriodicalIF":3.2000,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems Science & Control Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/21642583.2022.2084650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 6

Abstract

Wireless sensor network (WSN) coverage problem is to think about how to maximize the network coverage to obtain reliable monitoring and tracking services with guaranteed quality of service. In this paper, a simplified slime mould algorithm (SSMA) for solving the WSN coverage problem is proposed. In SSMA, we mainly conducted 13 groups of WSNs coverage optimization experiments and compared them with six well-known meta-heuristic optimization algorithms. The experimental results and Wilcoxon rank-sum test show that the proposed SSMA is generally competitive, outstanding performance and effectiveness. We proposed SSMA algorithm could be helpful to effectively control the network nodes energy, improve the perceived quality of services and extend the network survival time.
SSMA:用于优化无线传感器网络覆盖问题的简化黏菌算法
无线传感器网络(WSN)覆盖问题是考虑如何最大限度地扩大网络覆盖范围,以获得可靠的监测和跟踪服务,并保证服务质量。本文提出了一种求解WSN覆盖问题的简化黏菌算法(SSMA)。在SSMA中,我们主要进行了13组无线传感器网络覆盖优化实验,并将其与六种著名的元启发式优化算法进行了比较。实验结果和Wilcoxon秩和检验表明,所提出的SSMA总体上具有竞争力,性能和有效性突出。我们提出的SSMA算法有助于有效控制网络节点能量,提高感知服务质量,延长网络生存时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Systems Science & Control Engineering
Systems Science & Control Engineering AUTOMATION & CONTROL SYSTEMS-
CiteScore
9.50
自引率
2.40%
发文量
70
审稿时长
29 weeks
期刊介绍: Systems Science & Control Engineering is a world-leading fully open access journal covering all areas of theoretical and applied systems science and control engineering. The journal encourages the submission of original articles, reviews and short communications in areas including, but not limited to: · artificial intelligence · complex systems · complex networks · control theory · control applications · cybernetics · dynamical systems theory · operations research · systems biology · systems dynamics · systems ecology · systems engineering · systems psychology · systems theory
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信