Authors: A. Alhasanat; B. Sharif; C. Tsimenidis; J. Neasham
Addresses: Department of Computer Engineering, Al-Hussien Bin Talal University, P.O. Box 20, Ma'an, Jordan ' College of Engineering, Khalifa University, P.O. Box 127788, UAE ' School of Electrical, Electronic and Computer Engineering, Newcastle University, Newcastle Upon Tyne, NE1 7RU, UK ' School of Electrical, Electronic and Computer Engineering, Newcastle University, Newcastle Upon Tyne, NE1 7RU, UK
Abstract: This paper presents a new collaborative location estimation method for wireless sensor networks (WSN), referred to as an iterative tree search algorithm (I-TSA). The proposed method is based on the grid search least square estimator (LSE), which provides efficient estimation in the presence of noisy received signal strength (RSS) range measurements. The complexity analysis of the I-TSA algorithm showed that the computational requirement by each unknown-location sensor node scales linearly with the number of its neighbouring nodes, and that only a small communication overhead is required until its location estimate converges. This, in contrast to centralised methods, such as maximum likelihood estimator (MLE) and multidimensional scaling (MDS), provides a feasible solution for distributed computation in large scale WSN. Furthermore, the performance of I-TSA, is evaluated with reference to the Cramér-Rao bound (CRB) and compared with MLE, MDS and MDS-MLE methods. The results showed that I-TSA achieves lower standard deviations and biases for various simulation scenarios.
Keywords: collaborative localisation; CRB; Cramer-Rao bound; RSS; received signal strength; WSNs; wireless sensor networks; iterative tree search; simulation.
International Journal of Sensor Networks, 2016 Vol.22 No.1, pp.27 - 36
Accepted: 04 Sep 2015
Published online: 23 Sep 2016 *