Therefore the computational complexity of the proposed method is little more than the DV-Hop algorithm due to linear programming as shown in Table 2. At the same time, it is sensible to mention that ODR considers some of the anchor nodes only to estimate the unknown nodes’ location at the final step to keep the complexity low in comparison to some other similar variations like- Advanced DV-Hop algorithm [21], and Improved DV-Hop algorithm [25]. Thus ODR strives a balanced tradeoff between localization accuracy and its cost.