A Localization Algorithm in Wireless Sensor Network Based on Positioning Group Quality

Localization is fundamental component for many critical applications in wireless sensor networks (WSNs). However, DV-Hop localization algorithm and its improved ones cannot meet the requirement of positioning accuracy for their high localization errors. This paper proposes a localization algorithm based on positioning group quality (LA-PGQ). The average estimate hop size was first corrected by link singularity and difference between the estimation hop length and true hop length among beacons, the best positioning group was constituted for unknown node by using node trust function and positioning group quality evaluation function to choose three beacons with best topological distribution. Third, LA-PGQ algorithm uses two-dimensional hyperbolic algorithm instead of the classical three-side method/least square method to determine the coordinates of nodes, which are more accurate. Simulation results show the positioning accuracy of LA-PGQ algorithm is obviously improved in WSNs, and the average localization error of LA-PGQ algorithm is remarkable lower than those of the DV-Hop algorithm and its improved algorithm and Amorphous, under both the isotropy and anisotropy distributions.