Pascal's triangle-based range-free localization for anisotropic wireless networks

Abstract

This paper introduces a Pascal's triangle model to draw the potential locations and their probabilities for a normal node given the hop counts to the anchors according to the extent of detour of the shortest paths. Based on our proposed model, a Pascal's triangle-based localization (PTL) algorithm using local connectivity information is presented for anisotropic wireless networks with a small number of anchors. The superiority of the PTL algorithm has been validated over the state-of-the-art algorithms through MATLAB simulations. We have shown that compared to the other algorithms, the PTL algorithm achieves higher localization accuracy with even fewer anchors. We have also validated the performance of the PTL algorithm in a real environment.