mN/2 Algorithm to Resolve Uncertainty of Sensors Localization

Yıldız D., Karagöl S., Özgönenel O., Tadiparthi S., Bikdash M.

39th International Conference on Telecommunications and Signal Processing (TSP), Vienna, Austria, 27 - 29 June 2016, pp.112-115 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/tsp.2016.7760840
  • City: Vienna
  • Country: Austria
  • Page Numbers: pp.112-115
  • Keywords: Wireless sensor networks, Localization, Graph Theory
  • Ondokuz Mayıs University Affiliated: Yes

Abstract

This paper introduces a novel graph-theoretic self localization algorithm that resolves ambiguities in the position candidates. The algorithm is especially effective in very sparse networks where other algorithms usually fail. Even when the algorithm cannot locate a given node, it produces a polygonal estimate of the region in which the node is located. Monte Carlo simulations show that this algorithm performs better than other well known algorithms.