The Research Of Node Localization In Wireless Sensor Networks

Wireless Sensor Networks (WSN), which is made by the Sensor, Embodied Computation, Networks Information and Wireless Communication technologies, is a new technology that is used for localizing the events and tracing the origin. And This network has a wide application in national defense, environment detection, medical treatment etc. And self-localization of WSN is a significant and critical section of this field. In order to improve the modern combat level and cater for the modern and scientific war, efficiency evaluation system for precision-attack is proposed. The system mainly realizes the localization of impact point through Wireless Sensor Network where self-localization of the nodes is precondition.The research of this paper introduces the fundamental principles of the localization algorithms of WSN. And then this paper proposes a new location algorithm called Euclidean-Iteration on the base of these algorithms.The new algorithm use the way of Euclidean Algorithm to obtain the distance between the unknown nodes and the beacon that is two hops away from this unknown node in order to increase the number of beacon around the nodes. And then the unknown is localized and the precision of localization is improved by the way of iteration. The simulation results show that this algorithm improve sharply in the good position accuracy and location covering rate, it is a practical localization approach. At the same time, after further research, a three dimension localization algorithm of WSN that is basis of two dimension algorithms of WSN is proposed. And the simulation results show that this algorithm has better performance in the small or middle field and the performance has descended sharply in the large field.