An improved centroid DV hop based algorithm

Harshit Agarwal, Ananya Dwivedi, Amanpreet Kaur
{"title":"An improved centroid DV hop based algorithm","authors":"Harshit Agarwal, Ananya Dwivedi, Amanpreet Kaur","doi":"10.1109/RDCAPE.2017.8358242","DOIUrl":null,"url":null,"abstract":"To reduce the positioning error in localization algorithms, an improved DV Hop based localization algorithm is proposed which takes the influence of closest anchor. Firstly, the smallest number of hops is computed for all nodes from every anchor. Then, distance of every unknown node from each anchor node is determined. Then highly accurate 2D Hyperbolic Algorithm is applied to determine coordinates of all unknown nodes. In last step, every unknown node applies centroid method which uses impact of nearest anchor to get final coordinates. The proposed algorithm is implemented and simulated in Matlab and it is observed that it outperforms original algorithm in terms of localization error when varying anchor nodes, communication range, unknown nodes.","PeriodicalId":442235,"journal":{"name":"2017 Recent Developments in Control, Automation & Power Engineering (RDCAPE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Recent Developments in Control, Automation & Power Engineering (RDCAPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RDCAPE.2017.8358242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

To reduce the positioning error in localization algorithms, an improved DV Hop based localization algorithm is proposed which takes the influence of closest anchor. Firstly, the smallest number of hops is computed for all nodes from every anchor. Then, distance of every unknown node from each anchor node is determined. Then highly accurate 2D Hyperbolic Algorithm is applied to determine coordinates of all unknown nodes. In last step, every unknown node applies centroid method which uses impact of nearest anchor to get final coordinates. The proposed algorithm is implemented and simulated in Matlab and it is observed that it outperforms original algorithm in terms of localization error when varying anchor nodes, communication range, unknown nodes.
一种改进的质心DV跳算法
为了减小定位算法中的定位误差,提出了一种考虑最近锚点影响的改进DV Hop定位算法。首先,从每个锚出发计算所有节点的最小跳数。然后,确定每个未知节点到每个锚节点的距离。然后采用高精度二维双曲算法确定所有未知节点的坐标。最后一步对每个未知节点采用质心法,利用最近锚点的影响得到最终坐标。在Matlab中对该算法进行了实现和仿真,结果表明,在不同锚节点、通信范围、未知节点的情况下,该算法在定位误差方面优于原算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信