Comparison of message passing algorithms for cooperative localization under NLOS conditions

S. V. D. Velde, H. Wymeersch, H. Steendam
{"title":"Comparison of message passing algorithms for cooperative localization under NLOS conditions","authors":"S. V. D. Velde, H. Wymeersch, H. Steendam","doi":"10.1109/WPNC.2012.6268729","DOIUrl":null,"url":null,"abstract":"For large wireless networks, there is a need for accurate localization in a distributed manner. Several algorithms have been developed in order to achieve this goal. However, comparing different algorithms is hard because of the use of different network topologies and measurement models. In this paper two promising message passing algorithms, called SPAWN and SLEEP, are compared in terms of accuracy, complexity, and network traffic. To enable a fair comparison, several alterations are made to SLEEP resulting in ASLEEP with reduced network traffic and the incorporation of reference nodes. Simulations, using measurement models from real ultra-wideband equipment, show that ASLEEP is able to achieve similar estimation quality as SPAWN at much lower complexity and network traffic.","PeriodicalId":399340,"journal":{"name":"2012 9th Workshop on Positioning, Navigation and Communication","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 9th Workshop on Positioning, Navigation and Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPNC.2012.6268729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

For large wireless networks, there is a need for accurate localization in a distributed manner. Several algorithms have been developed in order to achieve this goal. However, comparing different algorithms is hard because of the use of different network topologies and measurement models. In this paper two promising message passing algorithms, called SPAWN and SLEEP, are compared in terms of accuracy, complexity, and network traffic. To enable a fair comparison, several alterations are made to SLEEP resulting in ASLEEP with reduced network traffic and the incorporation of reference nodes. Simulations, using measurement models from real ultra-wideband equipment, show that ASLEEP is able to achieve similar estimation quality as SPAWN at much lower complexity and network traffic.
NLOS条件下协同定位的消息传递算法比较
对于大型无线网络,需要以分布式的方式进行精确的定位。为了实现这一目标,已经开发了几种算法。然而,由于使用不同的网络拓扑结构和测量模型,比较不同的算法是困难的。本文从准确性、复杂度和网络流量等方面比较了两种有前途的消息传递算法——SPAWN和SLEEP。为了进行公平的比较,对SLEEP进行了一些更改,导致在减少网络流量和合并参考节点的情况下使用ASLEEP。使用真实超宽带设备的测量模型进行的仿真表明,在更低的复杂度和网络流量下,ASLEEP能够达到与SPAWN相似的估计质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信