Fig. 3: Minimum Base Distance estimation of unknown node nearest
to a single anchor node.
As shown in this figure, the actual distance between any anchor pair
(out of the available anchor nodes- ‘A’, ‘B’, and ‘C’) is most likely
less than what can be drawn with the help of hop size and hop counts.
The unknown node ‘U’ is needed to localize. Now instead of using hops to
find out the distance, the model try to establish a probable point for
the unknown node ‘U’ only; so as a minimum distance from some of the
anchor nodes can be observed. Therefore to estimate the minimum
distance, find out the anchor nodes nearest to the ‘U’, which are known
as minimum hop distant anchor nodes from ‘U’. Here, ‘A’ is the anchor
node nearest to ‘U’. Then find out the intersections from the other
connected anchor nodes with the communication periphery of ‘A’, say\(\text{pt}_{1},\ and\ \ \text{pt}_{2}\) respectively from ‘C’ and ‘B’.
It implies that the distances B \(\text{pt}_{2}\) and C\(\text{pt}_{1}\) are the minimum possible distance values from ‘B’ and
‘C’ respectively.
But still, there is a need to understand the applicability of the
proposed model beyond just an elemental situation presented in Fig. 3.
The real-time situation may go complex. It may be possible that the
unknown node is still one hop away as a minimum hop distance, but the
minimum hop distant anchor nodes are more than just one. This
investigative situation is shown in Fig. 4.