Performance Analysis of 3D-OSSDL and 3D-VCN Localization Algorithms in WSN

摘要

A range-free three dimensional optimum space step distance localization scheme (3D-OSSDL) and a node self-localization algorithm based on virtual central node (VCN) for wireless sensor network (WSN) are proposed in our previous papers. The 3D-OSSDL algorithm is realized by analyzing classic two dimensional DV-Hop localization algorithm. By optimizing distances from the 3D network model, the optimum space step distance from nodes to anchors is obtained and the coordinates of all unknown nodes are derived finally. During the localization process of the VCN algorithm, by deducing a 3D special node in the cube formed by eight anchor nodes, which is called virtual central node, unknown nodes can compute their own positions automatically, fn this paper;a comprehensive performance analysis of OSSDL and VCN are presented to explore their performances. Also comparisons with classic DV-Hop and Centroid algorithms are made under different simulation environments. Two aspects of the performance comparison are addressed: positioning accuracy and computational time. VCN has better estimation accuracy than OSSDL, which is much better than that of DV-Hop. Also VCN costs the least localization time of all.