Optimization of the Wireless Sensor Nodes Localization Algorithm Based on Genetic Algorithm

Optimization of the Wireless Sensor Nodes Localization Algorithm Based on Genetic Algorithm

Tan Zhi (Beijing University of Civil Engineering and Architecture, Beijing, China) and Zhang Yuting (Beijing University of Civil Engineering and Architecture, Beijing, China)
DOI: 10.4018/IJITN.2014100106
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The node localization technology is a foundation for practical application in wireless sensor networks. According to DV-HOP positioning algorithm in wireless sensor network low precision, the defect of inaccurate positioning, this paper presents an optimization algorithm of improved DV-HOP based on genetic algorithm. The algorithm is to redefine the scope of initial population, the reference weight, redesigned the fitness function and selection of anchor nodes. The simulation results show that compared with the traditional DV - HOP algorithm, the algorithm without any increase in the node hardware overhead on the basis of significantly higher positioning accuracy.
Article Preview

Dv-Hop Algorithm

DV-Hop algorithm was made by Dragons Niculescu from the Lutegesi University of United States etc., the basic idea is: the node itself only exchange information with its adjacent nodes, the distance between the unknown nodes and the anchor nodes is represented by the product of network average Hop distance and the shortest path between two nodes, and uses trilateral measurement to obtain the node location information (Niculescu,2003, Kaoru,2008). The nodes don’t need have distance measurement or Angle measurement function; also do not need additional location or Angle measuring equipment. This can reduce the ratio of anchor nodes in a network deployment, reduce network deployment cost.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing