RANGE-FREE LOCALIZATION PROTOCOL FOR

MOBILE SENSOR NETWORKS

Abstract

Mobile sensor networks mostly use Sequential Monte Carlo (SMC) method for

Localization. SMC has low sampling efficiency or require high beacon density to achieve

high localization accuracy. In this paper, I am going to improve the energy efficient

algorithm, called WMCL, which can achieve both high sampling efficiency and high

localization accuracy in various scenarios. WMCL can further reduce the size of a sensor

node’s bounding-box by a factor of up to 87 percent and, consequently, improve the

sampling efficiency by a factor of up to 95 percent. The improvement in sampling

efficiency dramatically reduces the computational cost. WMCL algorithm uses the

estimated position information of sensor nodes to improve localization accuracy.

Compared with algorithms adopting similar methods, WMCL can achieve similar

localization accuracy with less communication cost and computational cost. We need to

improve localization accuracy when nodes move very fast. The performance can be

evaluated using simulation. We need to determine a maximum transmission range

between two nodes. The connectivity between two sensor nodes is very unstable. The

connectivity status may vary greatly in different times, in different places, or even

between different sensor nodes.