{"title":"Range-Free Localization Schemes for Wireless Sensor Networks","authors":"R. Khadim, M. Erritali, A. Maaden","country":null,"institution":"","volume":103,"journal":"International Journal of Computer and Information Engineering","pagesStart":1723,"pagesEnd":1731,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/10002217","abstract":"Localization of nodes is one of the key issues of\r\nWireless Sensor Network (WSN) that gained a wide attention in\r\nrecent years. The existing localization techniques can be generally\r\ncategorized into two types: range-based and range-free. Compared\r\nwith rang-based schemes, the range-free schemes are more costeffective,\r\nbecause no additional ranging devices are needed. As a\r\nresult, we focus our research on the range-free schemes. In this paper\r\nwe study three types of range-free location algorithms to compare the\r\nlocalization error and energy consumption of each one. Centroid\r\nalgorithm requires a normal node has at least three neighbor anchors,\r\nwhile DV-hop algorithm doesn\u2019t have this requirement. The third\r\nstudied algorithm is the amorphous algorithm similar to DV-Hop\r\nalgorithm, and the idea is to calculate the hop distance between two\r\nnodes instead of the linear distance between them. The simulation\r\nresults show that the localization accuracy of the amorphous\r\nalgorithm is higher than that of other algorithms and the energy\r\nconsumption does not increase too much.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 103, 2015"}