• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.574-592
• /
• 2016

Range-free localization algorithm computes a normal node's position by estimating the distance to anchors which know their actual position. In recent years, reliable anchor selection research has been gained a lot of attention because this approach improves localization accuracy by selecting the only subset of anchors called reliable anchor. The distance estimation accuracy and the geometric shape formed by anchors are the two important factors which need to be considered when selecting the reliable anchors. In this paper, we study the relationship between a relative position of three anchors and localization error. From this study, under ideal condition, which is with zero localization error, we find two conditions for anchor selection, thereby proposing a novel anchor selection algorithm that selects three anchors matched most closely to the two conditions, and the validities of the conditions are proved using two theorems. By further employing the conditions, we finally propose a novel range-free localization algorithm. Simulation results show that the proposed algorithm shows considerably improved performance as compared to other existing works.