A Is Positioning Itself For Wireless Sensor Networks Based On Euclidean Algorithm-hop-the Euclidean

Advances in MEMS(Micro-Electro-Mechanism System),SOC(Svstem on Chip)and Wireless Communications have made WSN (Wireless Sensor Network) possible, where each sensor node individually senses the environment but collaboratively achieves complex information gathering and dissemination tasks. Instrumenting the physical world through large networks of wireless sensor nodes requires that these nodes be very small, lightweight, untethered, and unobtrusive. These networked sensor nodes, however, possess several characteristics that have challenged many aspects of traditional computer network design. The problem of self-localization, which is, determinin where a given node is physically or relatively located in a network, is one of the challenging tasks.and yet extremely crucial for many applications.The research of this thesis is based on the analysis of a great deal of recent technical reports and research results on WSN and its main work include:1. From the range Minding and localizationing method, the fundamental principles of the self-localization techniques of are described.2. The evaluation criterion of the performance and the taxonomy for wireless sensor networks self-localization system and algorithms are described, the principles and characteristics of recent representative localization approaches are discussed and presented in detail.3. Based on the Euclidean algorithm. Utilizeing the iterative approach to improve the density of anchor nodes gradually, and taking advantage of the concept of DV routing, a novel distributed, hop-by-hop, simple positioning algorithm, referred to as Hop-Euclidean, is presented and simulated. The results show that it has the good positioning accuracy and coverage4. The directions of research in this area are introduced.