{"title":"An Improved DV-Hop Distributed Active Multihop Localization Algorithm","authors":"Wang Kun, Tian Yuzhen, Zhang Zhen, Shi Yinhua","doi":"10.1109/ICS.2016.0051","DOIUrl":null,"url":null,"abstract":"Localization information is important in underwater wireless sensor network applications. This paper improves the DV-Hop and presents a Distributed Active Multihop Localization Algorithm. It extends fake anchors to help localization and collects the average multihop distance in the whole network, which is used as the estimated distance between unknown nodes and anchor nodes to improve localization accuracy. Finally, the algorithm calculates unknown node's location coordinates with maximum likelihood estimation. In the improved algorithm, it develops flooding and presents a distributed pruning broadcast algorithm. It prunes the previous node's neighbors recursively in the next hop set to decrease the meaningless message forwarding counts. Simulation confirms its average localization error reduces from 80 to 20 meters approximately. The influence of anchor proportion on improved algorithm's localization accuracy is less than the original one's. The algorithm's convergence time drops from exponential to linear.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Computer Symposium (ICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICS.2016.0051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Localization information is important in underwater wireless sensor network applications. This paper improves the DV-Hop and presents a Distributed Active Multihop Localization Algorithm. It extends fake anchors to help localization and collects the average multihop distance in the whole network, which is used as the estimated distance between unknown nodes and anchor nodes to improve localization accuracy. Finally, the algorithm calculates unknown node's location coordinates with maximum likelihood estimation. In the improved algorithm, it develops flooding and presents a distributed pruning broadcast algorithm. It prunes the previous node's neighbors recursively in the next hop set to decrease the meaningless message forwarding counts. Simulation confirms its average localization error reduces from 80 to 20 meters approximately. The influence of anchor proportion on improved algorithm's localization accuracy is less than the original one's. The algorithm's convergence time drops from exponential to linear.