MRC实现超级MDS,实现高效的2D定位

Alireza Ghods, S. Severi, G. Abreu
{"title":"MRC实现超级MDS,实现高效的2D定位","authors":"Alireza Ghods, S. Severi, G. Abreu","doi":"10.1109/WPNC.2017.8250052","DOIUrl":null,"url":null,"abstract":"We address the problem of localization using distance and angle information heterogeneously with the aim to create a robust algorithm with high accuracy and reduced complexity. In this paper, we propose a new localization algorithm, namely Maximum Ration Combining SMDS (MRC-SMDS) based on the fundamentals of two state of the art algorithms, namely Super MDS (SMDS) and Cholesky MDS (CMDS). The complex representation of the coordinates enables us to formulate the localization problem into a linear system of equations with a low complexity least square solution. The new algorithm shows to outperform the two state of the art in terms of localization accuracy and computation speed both under theoretical and practical scenarios. Therefore MRC-SMDS is shown to be a reliable candidate for localization specially for power constraint large networks with high mobility.","PeriodicalId":246107,"journal":{"name":"2017 14th Workshop on Positioning, Navigation and Communications (WPNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MRC implementation of super MDS for efficient 2D localization\",\"authors\":\"Alireza Ghods, S. Severi, G. Abreu\",\"doi\":\"10.1109/WPNC.2017.8250052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problem of localization using distance and angle information heterogeneously with the aim to create a robust algorithm with high accuracy and reduced complexity. In this paper, we propose a new localization algorithm, namely Maximum Ration Combining SMDS (MRC-SMDS) based on the fundamentals of two state of the art algorithms, namely Super MDS (SMDS) and Cholesky MDS (CMDS). The complex representation of the coordinates enables us to formulate the localization problem into a linear system of equations with a low complexity least square solution. The new algorithm shows to outperform the two state of the art in terms of localization accuracy and computation speed both under theoretical and practical scenarios. Therefore MRC-SMDS is shown to be a reliable candidate for localization specially for power constraint large networks with high mobility.\",\"PeriodicalId\":246107,\"journal\":{\"name\":\"2017 14th Workshop on Positioning, Navigation and Communications (WPNC)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 14th Workshop on Positioning, Navigation and Communications (WPNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPNC.2017.8250052\",\"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 14th Workshop on Positioning, Navigation and Communications (WPNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPNC.2017.8250052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们利用异构的距离和角度信息来解决定位问题,目的是创建一个具有高精度和低复杂度的鲁棒算法。本文在Super MDS (SMDS)和Cholesky MDS (CMDS)两种定位算法的基础上,提出了一种新的定位算法,即Maximum Ration combined SMDS (MRC-SMDS)。坐标的复杂表示使我们能够将定位问题表述为具有低复杂度最小二乘解的线性方程组。在理论和实际场景下,新算法在定位精度和计算速度方面都优于目前两种方法。因此,MRC-SMDS被证明是一种可靠的定位候选者,特别是对于具有高移动性的功率约束的大型网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MRC implementation of super MDS for efficient 2D localization
We address the problem of localization using distance and angle information heterogeneously with the aim to create a robust algorithm with high accuracy and reduced complexity. In this paper, we propose a new localization algorithm, namely Maximum Ration Combining SMDS (MRC-SMDS) based on the fundamentals of two state of the art algorithms, namely Super MDS (SMDS) and Cholesky MDS (CMDS). The complex representation of the coordinates enables us to formulate the localization problem into a linear system of equations with a low complexity least square solution. The new algorithm shows to outperform the two state of the art in terms of localization accuracy and computation speed both under theoretical and practical scenarios. Therefore MRC-SMDS is shown to be a reliable candidate for localization specially for power constraint large networks with high mobility.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信