MDS- MAP Algorithm For Localization

Authors

  • Lalita Baburao Choudhary PG Student, Dept. of PG, M.B.S.E. College of Engineering, Ambejogai, India
  • V.V.Yerigeri Assistant Professor, Dept. of PG, M.B.S.E. College of Engineering, Ambejogai, India

Keywords:

Position estimation, node localization, multilateration, multidimensional scaling, ad-hoc networks, and sensor networks

Abstract

We propose an approach that uses connectivity information—who is within communications range of
whom—to derive the locations of nodes in a network. The approach can take advantage of additional information, such
as estimated distances between neighbours or known positions anchor nodes, if it is available. It is based on
multidimensional scaling (MDS), an efficient data analysis technique that takes O(n)3
time for a network of n nodes.
Unlike previous approaches, MDS takes full advantage of connectivity or distance information between nodes that have
yet to be localized. We examined the performance of our algorithm for parameters by conducting simulation.

Downloads

Published

2018-03-25

How to Cite

Lalita Baburao Choudhary, & V.V.Yerigeri. (2018). MDS- MAP Algorithm For Localization. International Journal of Advance Engineering and Research Development (IJAERD), 5(3), 495–503. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/2712

Issue

Vol. 5 No. 3 (2018): Volume 5 Issue 3 March 2018

Section

Articles