{"title":"一种改进的基于通信半径动态调整的dv跳定位算法","authors":"Jing Zhang, Linghua Zhang","doi":"10.1109/ICAIT.2017.8388926","DOIUrl":null,"url":null,"abstract":"DV-Hop node localization algorithm is one of representative node positioning algorithms that are ranged-free in wireless sensor network. in actual measurement, we discover that if we define the hop number as one hop in the case of the distance that is less than or equal to communication radius, it will cause great positioning error. So, the improved algorithm introduces multiple communication radius in order to subdivide hop numbers and deduces a formula of hop numbers with the numbers of radius changing, amends average hop distance by correcting the weighted value. Simulation results proof that the algorithm availably cuts down the positioning error under the same network topology, comparing to traditional algorithm and the common weighted algorithm.","PeriodicalId":376884,"journal":{"name":"2017 9th International Conference on Advanced Infocomm Technology (ICAIT)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A modified DV-hop localization algorithm based on communication radius dynamic adjustment\",\"authors\":\"Jing Zhang, Linghua Zhang\",\"doi\":\"10.1109/ICAIT.2017.8388926\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"DV-Hop node localization algorithm is one of representative node positioning algorithms that are ranged-free in wireless sensor network. in actual measurement, we discover that if we define the hop number as one hop in the case of the distance that is less than or equal to communication radius, it will cause great positioning error. So, the improved algorithm introduces multiple communication radius in order to subdivide hop numbers and deduces a formula of hop numbers with the numbers of radius changing, amends average hop distance by correcting the weighted value. Simulation results proof that the algorithm availably cuts down the positioning error under the same network topology, comparing to traditional algorithm and the common weighted algorithm.\",\"PeriodicalId\":376884,\"journal\":{\"name\":\"2017 9th International Conference on Advanced Infocomm Technology (ICAIT)\",\"volume\":\"142 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 9th International Conference on Advanced Infocomm Technology (ICAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIT.2017.8388926\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 9th International Conference on Advanced Infocomm Technology (ICAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIT.2017.8388926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A modified DV-hop localization algorithm based on communication radius dynamic adjustment
DV-Hop node localization algorithm is one of representative node positioning algorithms that are ranged-free in wireless sensor network. in actual measurement, we discover that if we define the hop number as one hop in the case of the distance that is less than or equal to communication radius, it will cause great positioning error. So, the improved algorithm introduces multiple communication radius in order to subdivide hop numbers and deduces a formula of hop numbers with the numbers of radius changing, amends average hop distance by correcting the weighted value. Simulation results proof that the algorithm availably cuts down the positioning error under the same network topology, comparing to traditional algorithm and the common weighted algorithm.