thm
The DV-Hop algorithm is fully dependent upon the calculation of the
distance values obtained with the help of hop size (or average hop size
is the same in the paper) of each anchor node. This hop size is an
average value only. The algorithm assumes that all the hops are of the
same size as an anchor node. The conversion of the hop size and the hop
count into a distance value is an erroneous calculation because it has
no intention to find Euclidean distance. After it, the poor estimated
distance values passed to a regression method for localization. The
ill-fated distance values just propagate error and yields a poor
estimation of the location only. With the help of an example, the
algorithm and its limitations can be analyzed. Here the Fig. 1 creates a
scenario of the random positions of anchor and unknown nodes.