Location information is of utmost importance for most applications in wireless sensor networks. Recent localization schemes have been categorized into range and range-free based techniques. Obvious inclination is towards range free algorithms since they do not rely on special hardware that would be required in range based algorithms. In the most proposed range-free algorithms, nodes estimate their location using the geometric constraints imposed by the location of a mobile anchor. However, there is no discussion on how the mobile anchor moves so that the maximal location accuracies of all sensor nodes can be obtained with the constraint of energy consumption of a mobile anchor. This paper assumes that traditional range-free algorithms have been executed for a certain time period and the deployed sensors are with different location accuracies. We propose path guiding mechanisms that sensor nodes cooperatively guide the mobile anchor moving along an efficient path which can maximize the improvement of location accuracies or minimize the accuracy differences for all sensor nodes in a given WSN. Experimental study reveals that the proposed path guiding mechanisms effectively guide the mobile anchor moving along the efficient path and thereby saves time and energy consumptions for improving or balancing the location accuracies of all sensor nodes.
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference, pp.98-105