{"title":"基于最小跳数校正和重新评估跳距的改进DV-Hop算法","authors":"Wangsheng Fang, Haomin Xu, Geng Yang","doi":"10.1109/INFOMAN.2019.8714669","DOIUrl":null,"url":null,"abstract":"In the DV -HOP algorithm of the wireless sensor network, an inaccurate estimation of the minimum hop count and the average hop distance produces a positioning error. Therefore, this paper proposes an improved DV-HOP algorithm. The algorithm reevaluates the average hop distance of the anchor node and corrects the minimum hop count of the node to be located and the anchor node, which reduces the above error. First, the average hop distance of the anchor node closest to the positioned node is reassessed according to the error. Then, the minimum hop count is obtained by the average hop distance of the revaluation, and the correction coefficient of the ratio of the minimum hop count to the actual minimum hop count is obtained, and the minimum hop count of the node to be positioned is corrected by the correction coefficient. Finally, the distance between the node to be located and the anchor node is calculated, and the position of the node to be positioned is calculated by the least squares method. Simulation results show that the improved dv-hop algorithm can reduce the node positioning error and improve the positioning accuracy.","PeriodicalId":186072,"journal":{"name":"2019 5th International Conference on Information Management (ICIM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Improved DV-Hop Algorithm Based on Minimum Hops Correction and Reevaluate Hop Distance\",\"authors\":\"Wangsheng Fang, Haomin Xu, Geng Yang\",\"doi\":\"10.1109/INFOMAN.2019.8714669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the DV -HOP algorithm of the wireless sensor network, an inaccurate estimation of the minimum hop count and the average hop distance produces a positioning error. Therefore, this paper proposes an improved DV-HOP algorithm. The algorithm reevaluates the average hop distance of the anchor node and corrects the minimum hop count of the node to be located and the anchor node, which reduces the above error. First, the average hop distance of the anchor node closest to the positioned node is reassessed according to the error. Then, the minimum hop count is obtained by the average hop distance of the revaluation, and the correction coefficient of the ratio of the minimum hop count to the actual minimum hop count is obtained, and the minimum hop count of the node to be positioned is corrected by the correction coefficient. Finally, the distance between the node to be located and the anchor node is calculated, and the position of the node to be positioned is calculated by the least squares method. Simulation results show that the improved dv-hop algorithm can reduce the node positioning error and improve the positioning accuracy.\",\"PeriodicalId\":186072,\"journal\":{\"name\":\"2019 5th International Conference on Information Management (ICIM)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 5th International Conference on Information Management (ICIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOMAN.2019.8714669\",\"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 5th International Conference on Information Management (ICIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOMAN.2019.8714669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved DV-Hop Algorithm Based on Minimum Hops Correction and Reevaluate Hop Distance
In the DV -HOP algorithm of the wireless sensor network, an inaccurate estimation of the minimum hop count and the average hop distance produces a positioning error. Therefore, this paper proposes an improved DV-HOP algorithm. The algorithm reevaluates the average hop distance of the anchor node and corrects the minimum hop count of the node to be located and the anchor node, which reduces the above error. First, the average hop distance of the anchor node closest to the positioned node is reassessed according to the error. Then, the minimum hop count is obtained by the average hop distance of the revaluation, and the correction coefficient of the ratio of the minimum hop count to the actual minimum hop count is obtained, and the minimum hop count of the node to be positioned is corrected by the correction coefficient. Finally, the distance between the node to be located and the anchor node is calculated, and the position of the node to be positioned is calculated by the least squares method. Simulation results show that the improved dv-hop algorithm can reduce the node positioning error and improve the positioning accuracy.