Analysis of OSSDL and IVCN self-localization algorithms in wireless sensor networks

A range-free three dimensional localization scheme based on optimum space step distance (OSSDL) and an improved node self-localization algorithm based on virtual central node (IVCN) for wireless sensor network (WSN) are proposed in our previous papers. By analyzing classic two dimensional DV-Hop localization algorithm, OSSDL algorithm realizes localization. Especially by optimizing distances from the 3D network model, the optimum space step distance from nodes to anchors in OSSDL is obtained and the coordinates of all unknown nodes can be derived finally. However in IVCN localization algorithm, by deducing a 3D special node in the cube which is virtually formed by eight anchor nodes, which is called virtual central node, unknown nodes can compute their own estimated positions automatically. In this paper, a comprehensive analysis of OSSDL and IVCN are presented to explore their true performances. We also have made comparisons with classic DV-Hop and Centroid algorithms with several parameters changed under the same simulation environments. The index of positioning accuracy is addressed. From simulation results, IVCN performs better on localization accuracy than OSSDL, which is definitely much better than that of original DV-Hop.