MNCE: Multi-hop node localization algorithm for wireless sensor network based on error correction

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Considering the problems of large error and high localization costs of current range-free localization algorithms, a MNCE algorithm based on error correction is proposed in this study. This algorithm decomposes the multi-hop distance between nodes into several small hops. The distance of each small hop is estimated by using the connectivity information of adjacent nodes; small hops are accumulated to obtain the initial estimated distance. Then, the error-correction rate based on the error-correction concept is proposed to correct the initial estimated distance. Finally, the location of the target node is resolved by total least square methods, according to the information on the anchor nodes and estimated distances. Simulation experiments show that the MNCE algorithm is superior to the similar types of localization algorithms.

Cite

CITATION STYLE

APA

Meng, Y., Chen, Y., Zhang, Q., & Zhang, W. (2020). MNCE: Multi-hop node localization algorithm for wireless sensor network based on error correction. Information (Switzerland), 11(5). https://doi.org/10.3390/INFO11050269

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free