• DocumentCode
    2936594
  • Title

    GASA-Hop Localization Algorithm for Wireless Sensor Networks

  • Author

    Zhao, Shijun ; Sun, Meiling ; Zhang, Zhaohui

  • Author_Institution
    Dept. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing
  • Volume
    2
  • fYear
    2009
  • fDate
    6-8 Jan. 2009
  • Firstpage
    152
  • Lastpage
    156
  • Abstract
    Wireless sensor networks are highly useful for many location-sensitive applications. The position of each node is assumed in most wireless sensor networks, which can make the sensed information meaningful. Finding position without GPS is important when GPS is not accessible or not practical to use. Typically, with the positions of only a few sensors predetermined, localization algorithms work for estimation of remaining sensor positions. DV-Hop is the most popular one. Intrinsically, localization is an optimization problem based on various distance/path measures. GA and SA are both widely used approaches toward optimization problems with certain strength and weakness. GASA which combines GA and SA can provide a more powerful optimization method. In this paper, we firstly propose GASA-Hop which uses GASA as a post-optimizer of DV-Hop to further improve the accuracy of its position estimation. Our simulation results reveal that GASA-Hop is effective.
  • Keywords
    Global Positioning System; genetic algorithms; simulated annealing; wireless sensor networks; GASA-hop localization; GPS; genetic algorithm; location-sensitive applications; simulated annealing; wireless sensor networks; Computational modeling; Computer networks; Global Positioning System; Goniometers; Mobile communication; Mobile computing; Optimization methods; Phase measurement; Power engineering computing; Wireless sensor networks; DV-Hop; GASA; localization; optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on
  • Conference_Location
    Yunnan
  • Print_ISBN
    978-0-7695-3501-2
  • Type

    conf

  • DOI
    10.1109/CMC.2009.43
  • Filename
    4797106