Localization of sensor networks using sweeps

J. Fang*, M. Cao, A. S. Morse, B. D.O. Anderson

*Corresponding author for this work

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

    27 Citations (Scopus)

    Abstract

    The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. We present a specialized localization algorithm and identify the graph properties of some classes of networks that can be localized by the algorithm. We also give an important application of our algorithm in creating formations in multi-agent systems.

    Original languageEnglish
    Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages4645-4650
    Number of pages6
    ISBN (Print)1424401712, 9781424401710
    DOIs
    Publication statusPublished - 2006
    Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
    Duration: 13 Dec 200615 Dec 2006

    Publication series

    NameProceedings of the IEEE Conference on Decision and Control
    ISSN (Print)0743-1546
    ISSN (Electronic)2576-2370

    Conference

    Conference45th IEEE Conference on Decision and Control 2006, CDC
    Country/TerritoryUnited States
    CitySan Diego, CA
    Period13/12/0615/12/06

    Fingerprint

    Dive into the research topics of 'Localization of sensor networks using sweeps'. Together they form a unique fingerprint.

    Cite this