{"title":"Velocity-assisted multidimensional scaling","authors":"Sandeep Kumar, K. Rajawat","doi":"10.1109/SPAWC.2015.7227102","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of cooperative localization in mobile networks. In static networks, node locations can be obtained from pairwise distance measurements using the classical multidimensional scaling (MDS) approach. This paper introduces a modified MDS framework that also incorporates relative velocity measurements available in mobile networks. The proposed cost function is minimized via a provably convergent, low complexity majorization algorithm similar to SMACOF. The algorithm incurs low computational and communication cost, and allows practical constraints such as missing measurements and variable node velocities. Simulation results corroborate the performance gains obtained by the proposed algorithm over state-of-the-art localization algorithms.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2015.7227102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper considers the problem of cooperative localization in mobile networks. In static networks, node locations can be obtained from pairwise distance measurements using the classical multidimensional scaling (MDS) approach. This paper introduces a modified MDS framework that also incorporates relative velocity measurements available in mobile networks. The proposed cost function is minimized via a provably convergent, low complexity majorization algorithm similar to SMACOF. The algorithm incurs low computational and communication cost, and allows practical constraints such as missing measurements and variable node velocities. Simulation results corroborate the performance gains obtained by the proposed algorithm over state-of-the-art localization algorithms.