Title: Incremental localisation algorithm based on distance matrix in wireless sensor networks

Authors: Shuai Chen; Yang Yu

Addresses: School of Electrical and Information Engineering, Huainan Normal University, Huainan, 232038, China ' School of Electronics and Information Engineering, Huainan Normal University, Huainan, 230039, China

Abstract: In order to search for all localisable blind nodes in algorithm, the proposed incremental localisation method utilised the distance matrix to estimate the blind node in computer centre. The distance matrix with row and column numbers on behalf of node identifier are filled by measured distances from every node. With the help of the distance matrix, the localisable blind nodes may be found out and positions may be calculated by choice of reference nodes step by step. The simulation test of the incremental localisation algorithm for wireless sensor networks was successfully completed using MATLAB. We concluded that the new method based on distance matrix is convenient for localisable blind nodes, with the advantage of reducing the algorithm time, enhancement flexibility of node disposal, improving efficiency of localisation, bringing out less accumulative error in incremental localisation

Keywords: algorithm; incremental localisation; wireless sensor network; matrix; distance.

DOI: 10.1504/IJICT.2017.085460

International Journal of Information and Communication Technology, 2017 Vol.11 No.1, pp.38 - 47

Received: 20 Sep 2014
Accepted: 15 Oct 2014

Published online: 21 Jul 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article