6. Algorithm Cost
The applicability of any model depends upon its cost to a network. In
the case of localization, the cost refers to the cost of communication
and computation.
Here the cost of communication is the cost incurred by the network to
spread out the information about the hop size between every connected
pair of the nodes. In the DV-Hop algorithm, each anchor node out of the
total anchor nodes \({}^{\prime}m^{\prime}\) has to inform all the nodes \({}^{\prime}N^{\prime}\) of the
network about its hop size value. So every node informs every other node
in the network about the hop size of an anchor node. Repeatedly this
controlled flooding takes place the same number of times as that of the
number of anchor nodes [11]. Therefore the communicational cost is\(O\left(mN^{2}\right)\). Since the proposed model ODR and IDV
[18] follow the same process as that of the DV-Hop algorithm to
communicate the hop size, so the communication complexity is also the
same as summarized by Table 1. The other causal factor in the cost is
computational complexity. DV-Hop [15] employs the least square
method to estimate the location in its last step. It (i.e. least square
method) needs matrix multiplication three times and inversion of a
matrix one time.