Change search
ReferencesLink to record
Permanent link

Direct link
Noisy network localization via optimal measurement refinement part 2: Distance-only network localization
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
2011 (English)In: IFAC Proceedings Volumes: (IFAC-PapersOnline), 2011, no PART 1, 8848-8853 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2011. no PART 1, 8848-8853 p.
, IFAC Proceedings Volumes (IFAC-PapersOnline), ISSN 1474-6670 ; 18
Keyword [en]
Computationally efficient, Network localization, Optimal measurements, Algorithms
National Category
Control Engineering
URN: urn:nbn:se:kth:diva-149756DOI: 10.3182/20110828-6-IT-1002.01291ScopusID: 2-s2.0-84866753301ISBN: 9783902661937OAI: diva2:749305
18th IFAC World Congress; Milano; Italy; 28 August 2011 through 2 September 2011

QC 20140923

Available from: 2014-09-23 Created: 2014-08-27 Last updated: 2014-10-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Shames, Iman
By organisation
Automatic ControlACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 6 hits
ReferencesLink to record
Permanent link

Direct link