基于最优k近邻的移动锚节点wsn定位算法

Huijiao Wang, Kuilin Lyu, Hua Jiang, Yao Wu, Q. Yue, Qing Zhao
{"title":"基于最优k近邻的移动锚节点wsn定位算法","authors":"Huijiao Wang, Kuilin Lyu, Hua Jiang, Yao Wu, Q. Yue, Qing Zhao","doi":"10.1109/ICACI.2019.8778540","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of low accuracy of node location in the local scope, a location algorithm for wireless sensor network with a mobile anchor node was proposed based on the improved k-nearest neighbor classification algorithm. The algorithm used K most similar reference nodes to calculate the coordinates of the unknown nodes. The location of the reference node is important. The Received Signal Strength Indication relative value between the unknown node and the reference node was acquired by using chi-square distance optimization. The Fisher criterion is used to select the reference nodes with the strong ability within the communication scope of unknown nodes and evaluate the error. The different weights are assigned to the reference nodes distribution, and the reference nodes with low signal intensity are deleted, and the reference nodes with shortest distance is the best. The proposed algorithm optimizes the selection of reference nodes. Experimental results show that the positioning accuracy is optimized by 14.54% with a smaller error distribution range compared with the K-Nearest Neighbor positioning algorithm.","PeriodicalId":213368,"journal":{"name":"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Location Algorithm for WSNs with Mobile Anchor Node Based on Optimzed K-Nearest Neighbers\",\"authors\":\"Huijiao Wang, Kuilin Lyu, Hua Jiang, Yao Wu, Q. Yue, Qing Zhao\",\"doi\":\"10.1109/ICACI.2019.8778540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problem of low accuracy of node location in the local scope, a location algorithm for wireless sensor network with a mobile anchor node was proposed based on the improved k-nearest neighbor classification algorithm. The algorithm used K most similar reference nodes to calculate the coordinates of the unknown nodes. The location of the reference node is important. The Received Signal Strength Indication relative value between the unknown node and the reference node was acquired by using chi-square distance optimization. The Fisher criterion is used to select the reference nodes with the strong ability within the communication scope of unknown nodes and evaluate the error. The different weights are assigned to the reference nodes distribution, and the reference nodes with low signal intensity are deleted, and the reference nodes with shortest distance is the best. The proposed algorithm optimizes the selection of reference nodes. Experimental results show that the positioning accuracy is optimized by 14.54% with a smaller error distribution range compared with the K-Nearest Neighbor positioning algorithm.\",\"PeriodicalId\":213368,\"journal\":{\"name\":\"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI.2019.8778540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2019.8778540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

针对局部范围内节点定位精度低的问题,提出了一种基于改进的k近邻分类算法的移动锚节点无线传感器网络定位算法。该算法使用K个最相似的参考节点来计算未知节点的坐标。参考节点的位置很重要。采用卡方距离优化方法获得未知节点与参考节点之间的接收信号强度指示相对值。采用Fisher准则在未知节点的通信范围内选择能力较强的参考节点,并对误差进行评估。对参考节点分布赋予不同的权重,删除信号强度低的参考节点,以距离最短的参考节点为最佳。该算法优化了参考节点的选择。实验结果表明,与k -最近邻定位算法相比,定位精度优化了14.54%,误差分布范围更小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Location Algorithm for WSNs with Mobile Anchor Node Based on Optimzed K-Nearest Neighbers
Aiming at the problem of low accuracy of node location in the local scope, a location algorithm for wireless sensor network with a mobile anchor node was proposed based on the improved k-nearest neighbor classification algorithm. The algorithm used K most similar reference nodes to calculate the coordinates of the unknown nodes. The location of the reference node is important. The Received Signal Strength Indication relative value between the unknown node and the reference node was acquired by using chi-square distance optimization. The Fisher criterion is used to select the reference nodes with the strong ability within the communication scope of unknown nodes and evaluate the error. The different weights are assigned to the reference nodes distribution, and the reference nodes with low signal intensity are deleted, and the reference nodes with shortest distance is the best. The proposed algorithm optimizes the selection of reference nodes. Experimental results show that the positioning accuracy is optimized by 14.54% with a smaller error distribution range compared with the K-Nearest Neighbor positioning algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信