Authors: Vijayanth Vivekanandan, Vincent W.S. Wong
Addresses: Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC V6T 1Z4, Canada. ' Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC V6T 1Z4, Canada
Abstract: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been different localisation algorithms proposed in the literature. The algorithms based on classical Multi-Dimensional Scaling (MDS) only require 3 or 4 anchor nodes and can provide higher accuracy than some other schemes. In this paper, we propose and analyse another type of MDS (called ordinal MDS) for localisation in wireless sensor networks. Ordinal MDS differs from classical MDS in 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 in both hop-based and range-based scenarios.
Keywords: wireless sensor networks; WSNs; localisation; multi-dimensional scaling; MDS; wireless networks; simulation; position estimation errors.
International Journal of Sensor Networks, 2006 Vol.1 No.3/4, pp.169 - 178
Published online: 12 Jan 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article