A Lightweight Iterative Positioning Algorithm for Context-Aware Wireless Sensor Networks: Proof of Correctness

In this paper we propose an energy-efficient iterative positioning algorithm for Wireless Sensor Networks (WSNs). In the proposed algorithm, localization is achieved in two phases: initial position estimation and iterative refinement. In the initial position estimation phase, instead of flooding the network with beacon messages, we propose to limit the propagation of the messages by using a random time-to-live for the majority of the beacon nodes. In the second phase of the algorithm, the nodes select random waiting periods for correcting their position estimates based on the information received from the neighbouring nodes. We propose to use weighted moving average when the nodes have received multiple position corrections from a neighbouring node to emphasize the corrections with a high confidence. In addition, in the refinement phase, the algorithm employs low-duty cycling for the nodes that have low confidence in their position estimates with the goal of reducing their impact on localization of neighboring nodes and preserving their energy. In this paper, we present the implementation of our algorithm and its proof of correctness.