Robust Localization Algorithm Based on Best Length Optimization for Wireless Sensor Networks

Abstract

In this paper, a robust range-free localization algorithm by realizing best hop length optimization is proposed for node localization problem in wireless sensor networks (WSNs). This algorithm is derived from classic DV-Hop method but the critical hop length between any relay nodes is accurately computed and refined in space WSNs with arbitrary network connectivity. In case of network parameters hop length between nodes can be derived without complicated computation and further optimized using Kalman filtering in which guarantees robustness even in complicated environment with random node communication range. Especially sensor fusion techniques used has well gained robustness, accuracy, scalability, and power efficiency even without accurate distance or angle measurement which is more suitable in nonlinear conditions and power limited WSNs environment. Simulation results indicate it gained high accuracy compared with DV-Hop and Centroid methods in random communication range conditions which proves it gives characteristic of high robustness. Also it needs relatively little computation time which possesses high efficiency. It can well solve localization problem with many unknown nosed in the network and results prove the theoretical analysis.