MN/2 Algorithm to resolve uncertainty of sensors localization

Dogan Yildiz, Serap Karagol, Okan Ozgonenel, Satish Tadiparthi, Marwan Bikdash

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2016 39th International Conference on Telecommunications and Signal Processing, TSP 2016
EditorsNorbert Herencsar
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages112-115
Number of pages4
ISBN (Electronic)9781509012886
DOIs
StatePublished - Nov 28 2016
Externally publishedYes
Event39th International Conference on Telecommunications and Signal Processing, TSP 2016 - Vienna, Austria
Duration: Jun 27 2016Jun 29 2016

Publication series

Name2016 39th International Conference on Telecommunications and Signal Processing, TSP 2016

Conference

Conference39th International Conference on Telecommunications and Signal Processing, TSP 2016
Country/TerritoryAustria
CityVienna
Period06/27/1606/29/16

Keywords

  • Graph theory
  • Localization
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'MN/2 Algorithm to resolve uncertainty of sensors localization'. Together they form a unique fingerprint.

Cite this