Localization Algorithm using Expected Hop Progress in Wireless Sensor Networks

In this paper, we propose a novel localization algorithm using expected hop progress (LAEP) to predict the positions of sensor nodes in WSNs. Our algorithm is based on a hop progress analytical model for a given network topology. By deriving relationship between node connectivity and expected-hop progress from the model, the distance between any two nodes can be accurately computed. As the distance estimation is a key issue in positioning system of WSNs, our expected-hop progress based localization algorithm also achieves reasonable performance in anchor-based WSNs with very few anchors. In addition, we considered the impact of deterministic anchor placement on the algorithm performance when the sensors are random deployed. Both grid and triangular placement of anchor nodes have been examined in this paper. Simulation results are seen to be in good agreement with the theoretical analysis and substantiate the validity of our proposed scheme LAEP