Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks

TL;DR

This paper introduces Dead Reckoning Localization for Mobile Wireless Sensor Networks, a novel technique that localizes all nodes efficiently at discrete intervals using dead reckoning and Bezouts theorem, improving over existing Monte-Carlo methods.

Contribution

The paper presents a new localization method for mobile WSNs where all nodes are mobile, reducing complexity and resource use compared to prior static or semi-static approaches.

Findings

DRLMSN achieves accurate localization with fewer anchor nodes.

Simulation shows DRLMSN outperforms RSS-MCL in accuracy and efficiency.

Method effectively localizes nodes at discrete checkpoints using dead reckoning.

Abstract

Localization in wireless sensor networks not only provides a node with its geographical location but also a basic requirement for other applications such as geographical routing. Although a rich literature is available for localization in static WSN, not enough work is done for mobile WSNs, owing to the complexity due to node mobility. Most of the existing techniques for localization in mobile WSNs uses Monte-Carlo localization, which is not only time-consuming but also memory intensive. They, consider either the unknown nodes or anchor nodes to be static. In this paper, we propose a technique called Dead Reckoning Localization for mobile WSNs. In the proposed technique all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are localized for the first time using three anchor nodes. For their subsequent localizations, only two anchor nodes are used. The proposed technique estimates two possible locations of a node Using Bezouts theorem. A dead reckoning approach is used to select one of the two estimated locations. We have evaluated DRLMSN through simulation using Castalia simulator, and is compared with a similar technique called RSS-MCL proposed by Wang and Zhu .