{"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}
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.