A weighted and distributed algorithm for multi-hop localization

Multi-hop wireless sensor networks are widely used in many location-dependent applications. Most applications assume the knowledge of geographic location of sensor nodes; however, in practical scenarios, the high accuracy on position estimates of sensor nodes is still a great challenge. In this research, we propose a hop-weighted scheme that can be useful in distance-based distributed multi-hop localization. The hop-weighted localization approach generates spatial locations around position estimates of unknown sensors and computes local functions that minimize distance errors among hop-weighted and static neighboring sensors. The iterative process of each unknown sensor to re-estimate its own location allows a significant reduction of initial position estimates. Simulations demonstrate that this weighted localization approach, when compared with other schemes, can be suitable to be used as a refinement stage to improve localization in both isotropic and anisotropic networks. Also, under rough initial position estimates, the proposed algorithm achieves root mean square error values less than the radio range of unknown sensors, in average, with only a few iterations