Skip navigation
Skip navigation

Noisy Network Localization via Optimal Measurement Refinement Part 2: Distance-Only Network Localization

Shames, Iman; Bishop, Adrian


In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks.

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: IFAC World Congress 2011 proceedings
DOI: 10.3182/20110828-6-IT-1002.01291


File Description SizeFormat Image
01_Shames_Noisy_Network_Localization_via_2011.pdf359.29 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator