TY - JFULL AU - R. Khadim and M. Erritali and A. Maaden PY - 2015/8/ TI - Range-Free Localization Schemes for Wireless Sensor Networks T2 - International Journal of Computer and Information Engineering SP - 1715 EP - 1723 VL - 9 SN - 1307-6892 UR - https://publications.waset.org/pdf/10002217 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 103, 2015 N2 - Localization of nodes is one of the key issues of Wireless Sensor Network (WSN) that gained a wide attention in recent years. The existing localization techniques can be generally categorized into two types: range-based and range-free. Compared with rang-based schemes, the range-free schemes are more costeffective, because no additional ranging devices are needed. As a result, we focus our research on the range-free schemes. In this paper we study three types of range-free location algorithms to compare the localization error and energy consumption of each one. Centroid algorithm requires a normal node has at least three neighbor anchors, while DV-hop algorithm doesn’t have this requirement. The third studied algorithm is the amorphous algorithm similar to DV-Hop algorithm, and the idea is to calculate the hop distance between two nodes instead of the linear distance between them. The simulation results show that the localization accuracy of the amorphous algorithm is higher than that of other algorithms and the energy consumption does not increase too much. ER -