Localization through Clustering Methods In WSN With Analyzing Leach Algorithm

摘要

Today Localization in wireless sensor networks is the topic of many researches. Methods of localization in the sensor networks are divided into two sets of anchor-based and anchor-free. Furthermore, localization methods may work centralized or distributed. Distributed and anchor-free are methods, which use clustering techniques. In these methods, Localization happens in three principle stages of dividing network into smaller clusters, localization in each cluster and gaining local maps and their combination (map stitching). Lots of clustering methods have been proposed. Moreover, there are Algorithms for gaining the local maps such as MDS. For stitching the local maps, we can assume various strategies such as incremental and concurrent. In this paper, the sensor networks and localization methods based on clustering are introduced, as an example the Leach algorithm with its characteristics and parameters is demonstrated. In addition, a scenario in which the LEACH algorithm is used for clustering is proposed and an evaluation of its analytical results is done with the NS2 simulation tool.