Node Deployment Optimization for Wireless Sensor Networks Based on Virtual Force-Directed Particle Swarm Optimization Algorithm and Evidence Theory.

IF 2
Liangshun Wu, Junsuo Qu, Haonan Shi, Pengfei Li
{"title":"Node Deployment Optimization for Wireless Sensor Networks Based on Virtual Force-Directed Particle Swarm Optimization Algorithm and Evidence Theory.","authors":"Liangshun Wu,&nbsp;Junsuo Qu,&nbsp;Haonan Shi,&nbsp;Pengfei Li","doi":"10.3390/e24111637","DOIUrl":null,"url":null,"abstract":"<p><p>Wireless sensor network deployment should be optimized to maximize network coverage. The D-S evidence theory is an effective means of information fusion that can handle not only uncertainty and inconsistency, but also ambiguity and instability. This work develops a node sensing probability model based on D-S evidence. When there are major evidence disputes, the priority factor is introduced to reassign the sensing probability, with the purpose of addressing the issue of the traditional D-S evidence theory aggregation rule not conforming to the actual scenario and producing an erroneous result. For optimizing node deployment, a virtual force-directed particle swarm optimization approach is proposed, and the optimization goal is to maximize network coverage. The approach employs the virtual force algorithm, whose virtual forces are fine-tuned by the sensing probability. The sensing probability is fused by D-S evidence to drive particle swarm evolution and accelerate convergence. The simulation results show that the virtual force-directed particle swarm optimization approach improves network coverage while taking less time.</p>","PeriodicalId":520609,"journal":{"name":"Entropy (Basel, Switzerland)","volume":" ","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9688961/pdf/","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy (Basel, Switzerland)","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e24111637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Wireless sensor network deployment should be optimized to maximize network coverage. The D-S evidence theory is an effective means of information fusion that can handle not only uncertainty and inconsistency, but also ambiguity and instability. This work develops a node sensing probability model based on D-S evidence. When there are major evidence disputes, the priority factor is introduced to reassign the sensing probability, with the purpose of addressing the issue of the traditional D-S evidence theory aggregation rule not conforming to the actual scenario and producing an erroneous result. For optimizing node deployment, a virtual force-directed particle swarm optimization approach is proposed, and the optimization goal is to maximize network coverage. The approach employs the virtual force algorithm, whose virtual forces are fine-tuned by the sensing probability. The sensing probability is fused by D-S evidence to drive particle swarm evolution and accelerate convergence. The simulation results show that the virtual force-directed particle swarm optimization approach improves network coverage while taking less time.

Abstract Image

Abstract Image

Abstract Image

基于虚拟力导向粒子群算法和证据理论的无线传感器网络节点部署优化。
优化无线传感器网络部署,实现网络覆盖最大化。D-S证据理论是一种既能处理不确定性和不一致性,又能处理模糊性和不稳定性的有效信息融合手段。本文建立了一个基于D-S证据的节点感知概率模型。在存在重大证据争议时,引入优先级因子对感知概率进行重新分配,以解决传统D-S证据理论聚合规则不符合实际场景而产生错误结果的问题。为优化节点部署,提出了一种虚拟力导向粒子群优化方法,优化目标为网络覆盖最大化。该方法采用虚拟力算法,通过感知概率对虚拟力进行微调。利用D-S证据对感知概率进行融合,驱动粒子群进化,加速收敛。仿真结果表明,虚拟力导向粒子群优化方法在提高网络覆盖率的同时,节省了时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书