• DocumentCode
    3311360
  • Title

    Range-free localization using grid graph extraction

  • Author

    Kubo, T. ; Tagami, Atsushi ; Hasegawa, T. ; Hasegawa, T. ; Walrand, Jean

  • Author_Institution
    KDDI R&D Labs., Inc., Fujimino, Japan
  • fYear
    2012
  • fDate
    Oct. 30 2012-Nov. 2 2012
  • Firstpage
    1
  • Lastpage
    11
  • Abstract
    This paper proposes a new type of range-free localization method based on affine transformation. Nodes extract subgraphs with a grid topology from a sensor network and assign x-y coordinates to themselves in a decentralized manner. The nodes estimate their positions using an affine transformation based on the mapping of the physical positions and the x-y coordinates of three anchors in an extracted graph. In contrast with multilateration-based localization methods, the proposed method works well even in a non-convex hull deployment, such as a terrain with big regions without sensors. We provide a theoretical analysis and simulation results. We also present a strategy for minimizing the position estimation error and maximizing the coverage of the proposed method. In the simulation results, the position estimation error is 0.18 (normalized by the radio communication range) and the coverage is almost 100% in a non-convex hull deployment.
  • Keywords
    graph theory; sensor placement; wireless sensor networks; affine transformation; grid graph extraction; grid topology; multilateration-based localization method; nonconvex hull deployment; position estimation error; radio communication range; range-free localization method; sensor network; subgraph extraction; Accuracy; Algorithm design and analysis; Estimation error; Network topology; Radio communication; Topology; Vectors; Range-free localization; affine transformation; decentralized algorithm; grid graph;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Protocols (ICNP), 2012 20th IEEE International Conference on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4673-2445-8
  • Electronic_ISBN
    978-1-4673-2446-5
  • Type

    conf

  • DOI
    10.1109/ICNP.2012.6459988
  • Filename
    6459988