一种改进的基于通信半径动态调整的dv跳定位算法

Jing Zhang, Linghua Zhang
{"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}
引用次数: 2

摘要

DV-Hop节点定位算法是无线传感器网络中具有代表性的无距离节点定位算法之一。在实际测量中,我们发现如果在距离小于等于通信半径的情况下,将跳数定义为一跳,将会产生很大的定位误差。为此,改进算法引入多个通信半径对跳数进行细分,推导出随半径数变化的跳数公式,通过修正加权值修正平均跳距离。仿真结果表明,与传统算法和常用加权算法相比,该算法有效地降低了相同网络拓扑下的定位误差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信