By Topic

Extending the Classical Multidimensional Scaling Algorithm Given Partial Pairwise Distance Measurements

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Amar, A. ; Fac. of Electr. Eng., Delft Univ. of Technol., Delft, Netherlands ; Yiyin Wang ; Leus, G.

We consider the problem of node localization given partial pairwise distance measurements. Current solutions first complete the missing distances and then apply the classical multidimensional scaling (MDS) algorithm. Instead, we extend the classical MDS to a setup where the sensor network is composed of a fully connected group of nodes that communicate with each other (e.g., beacons), and a group of nodes that cannot communicate with each other, but each one of them communicates with each node in the first group. The positions of all nodes are unknown. We localize the fully connected nodes by exploiting their distance measurements to the disconnected nodes. At the same time, the positions of the disconnected nodes are obtained up to a translation relative to the positions of the connected nodes. Recovering this translation, can be obtained with an additional step. Simulation results show that the proposed algorithm outperforms current MDS-like solutions to the problem.

Published in:

Signal Processing Letters, IEEE  (Volume:17 ,  Issue: 5 )