Abstract de la publi numéro 12982

For most of the applications in wireless sensor networks, localization is fundamental and essential. The localization systems can be categorized into two types: range-based and range-free. In this paper, we propose a new range-free localization algorithm. We define two classes of nodes, according to the number of anchors in the neighborhood. The computation complexity of related algorithms has also been analyzed. The simulation results prove that our proposed two-class algorithm has acceptable complexity, and achieves better precision than the existing ones, such as Centroid, CPE and DV-hop.