A modified fastmap algorithm for node localization in Wireless Sensor Networks

In recent years node localization in wireless sensor networks (WSNs) has attracted much attention due to the increase of usage and applications of WSNs. Many algorithms and techniques for locating sensor nodes have been proposed in the literature. A recent algorithm, which is based on a given set of pairwise distance estimates among nodes and the target, generates a map of node locations. This algorithm, known as FastMap, uses projections onto orthogonal hyperplanes to find the coordinates successively. In this paper, we analytically study the performance of the FastMap algorithm for 2D positioning. Moreover a modified version of FastMap with better performance is proposed and analyzed. The analysis shows that the optimum anchor placement should be at the edge of the network.