Monte Carlo based wireless node localization

Abstract

In this paper we propose the WNMCL algorithm that allows iteratively locate unknown wireless nodes. The algorithm requires only one mobile node, which collects RSS signal from other nodes with unknown position and approximates their distance by path-loss model. These data are used for the probability occurrence correction of the nodes in the space modelled by Monte Carlo. The WNMCL algorithm was validated using simulations and the results are presented in this paper.