Distance-Based Distributed Multihop Localization in Mobile Wireless Sensor Networks

Abstract—Localization in wireless sensor networks has been a big challenge for researchers in the past years. Besides physical problems like estimating the distance between two nodes, appli-cable algorithms are still on the list of open research issues. While single-hop localization with direct connection to fixed anchors is well researched, the localization with fixed anchors over a multi-hop route is still at its beginning. Especially the combination of multi-hop networks and mobile nodes needs further research. In this paper, we present and discuss a refined algorithm and a simulation-based approach regarding the mentioned scenario. Using a five phase structure that pursues a greedy approach, in-cluding a refining anchor selection, we investigate and discuss the precision of localization in a mobile environment. To approximate the distance between node and anchor over a multi-hop route, we make use of the mentioned greedy algorithm which fits best for processing multiple distance measurements between nodes. Furthermore, we evaluate different simulation-based experiments with mobile nodes and multi-hop routes. Index Terms—wireless sensor networks, lateration, mobile localization, radio runtime measuremnt, indoor localization I