Incremental localisation algorithm based on distance matrix in wireless sensor networks
by Shuai Chen; Yang Yu
International Journal of Information and Communication Technology (IJICT), Vol. 11, No. 1, 2017

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

Online publication date: Fri, 28-Jul-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com