Noisy network localization via optimal measurement refinement part 2: Distance-only network localization

Iman Shames*, Adrian N. Bishop

*Corresponding author for this work

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

    5 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationProceedings of the 18th IFAC World Congress
    PublisherIFAC Secretariat
    Pages8848-8853
    Number of pages6
    Edition1 PART 1
    ISBN (Print)9783902661937
    DOIs
    Publication statusPublished - 2011

    Publication series

    NameIFAC Proceedings Volumes (IFAC-PapersOnline)
    Number1 PART 1
    Volume44
    ISSN (Print)1474-6670

    Fingerprint

    Dive into the research topics of 'Noisy network localization via optimal measurement refinement part 2: Distance-only network localization'. Together they form a unique fingerprint.

    Cite this