An improvement of DV-Hop Algorithm Based on Collinearity

Lingfei Wu, M.Q.-H. Meng, Jian Huang, Huawei Liang, Zijing Lin
{"title":"An improvement of DV-Hop Algorithm Based on Collinearity","authors":"Lingfei Wu, M.Q.-H. Meng, Jian Huang, Huawei Liang, Zijing Lin","doi":"10.1109/ICINFA.2009.5204899","DOIUrl":null,"url":null,"abstract":"In order to fully consider the topology relationship among the anchor nodes and the topology relationship between the anchor nodes and unknown nodes, an Improvement of DV-Hop Algorithm Based on Collinearity is proposed. The main principle of the proposed scheme is to introduce the concept of normalized colinearity (NC) into the selection phase of beacon nodes. Based on DV-Hop, best available anchor terns are elected to accomplish more accurate localization by using NC. The experimental results show that the location accuracy of the proposed algorithm outweighs significantly the DV-Hop algorithm, especially in the cases where the connectivity is lower than 10.","PeriodicalId":223425,"journal":{"name":"2009 International Conference on Information and Automation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Information and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINFA.2009.5204899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In order to fully consider the topology relationship among the anchor nodes and the topology relationship between the anchor nodes and unknown nodes, an Improvement of DV-Hop Algorithm Based on Collinearity is proposed. The main principle of the proposed scheme is to introduce the concept of normalized colinearity (NC) into the selection phase of beacon nodes. Based on DV-Hop, best available anchor terns are elected to accomplish more accurate localization by using NC. The experimental results show that the location accuracy of the proposed algorithm outweighs significantly the DV-Hop algorithm, especially in the cases where the connectivity is lower than 10.
基于共线性的DV-Hop算法改进
为了充分考虑锚节点之间的拓扑关系以及锚节点与未知节点之间的拓扑关系,提出了一种基于共线性的DV-Hop改进算法。该方案的主要原理是将归一化共线(NC)的概念引入信标节点的选择阶段。在DV-Hop的基础上,选择最佳可用锚项,通过NC实现更精确的定位。实验结果表明,该算法的定位精度明显优于DV-Hop算法,特别是在连接数小于10的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信