Multihop range-free localization with approximate shortest path in anisotropic networks

This paper presents a multihop range-free localization algorithm that tolerates network anisotropy with a small number of anchors. A detoured path detection is proposed which measures the deviation in the hop count between the direct and shortest paths of a node pair. A novel distance estimation method is introduced to approximate the shortest path based on the path deviation and to estimate their Euclidean distance by taking into account the extent of the detour of the approximate shortest path. Compared to other range-free localization algorithms, the proposed algorithm requires fewer anchors while achieving higher localization accuracy in anisotropic networks. We demonstrated its superiority over existing range-free localization algorithms through extensive computer simulations.