Ordinal MDS-based localisation for wireless sensor networks
by Vijayanth Vivekanandan, Vincent W.S. Wong
International Journal of Sensor Networks (IJSNET), Vol. 1, No. 3/4, 2006

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.

Online publication date: Fri, 12-Jan-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com