Ordinal MDS-Based Localization for Wireless Sensor Networks

TitleOrdinal MDS-Based Localization for Wireless Sensor Networks
Publication TypeConference Paper
Year of Publication2006
AuthorsVivekanandan, V., and V. W. S. Wong
Conference NameVehicular Technology Conference, 2006. VTC-2006 Fall. 2006 IEEE 64th
Pagination1 -5
Date Publishedsep.
KeywordsEuclidean distance, monotonicity constraint, multidimensional scaling, ordinal MDS-based localization, shortest path distance, telecommunication network topology, wireless sensor networks

There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Recently, there have been different localization algorithms proposed in the literature. The algorithms based on classical Multidimensional Scaling (MDS) only require 3 or 4 anchor nodes and can provide higher accuracy than some other schemes. In this paper, we propose and analyze another type of MDS (called ordinal MDS) for localization in wireless sensor networks. Ordinal MDS differs from classical MDS by that it only requires a monotonicity constraint between the shortest path distance and the Euclidean distance for each pair of nodes. We conduct simulation studies under square and C-shaped topologies with different connectivity levels and number of anchors. Results show that ordinal MDS provides a lower position estimation error than classical MDS.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia