DV-Hop and its various improvements overexpose hop size and hop count for localization. Whereas hop size is always erroneous and hop path is not a straight line, which leads to a faulty location estimation. The proposed model Optimized Distance Range Free (ODR) localization algorithm limits the use of hop size and hop count to approximate nearly a straight line distance between a known and an unknown node without additional hardware and without increasing extra communication. The refrain use of hop size and hop count improves localization accuracy of ODR and makes it robust against those network variables which affect the hop size accuracy adversely. In fact ODR modifies the last two steps of DV-Hop. DV-Hop finds hop size in its second step. Here ODR rectifies this hop size and then a centroid is obtained from the minimum distant anchor nodes for an unknown node. Now a minimum possible distance known as base distance is estimated with a routing table assistance. In the last step DV-Hop uses least square regression to localize, while ODR exploits linear optimization to comprehend the base distance for localization. The paper establishes ODR analytically and rugged with ranging error of the omnidirectional antenna coverage pattern experimentally.