The Research Of Self-localization Algorithm For Wireless Sensor Network

Wireless sensor networks have great prospect in the applications of military affairs, circumstance observation, disaster relief operation, dangerous area domination, etc. One of the key qualifications for these applications is localization of the targets needing monitoring and the network node. And some routing scheme, information of network coverage, load balance, topology control, and so on also depend on the location information of the nodes in networks. All these indicate that localization is a fundamental and critical issue for the application, operation and management of wireless sensor networks, and the study for self-positioning of wireless sensor networks possesses great significance in the theory and practice, will become an important part in the research area.According to the DV-Hop location algorithm theory, this thesis intends to analyze the typical node location system and its algorithm so as to put forward a self-location algorithm of wireless sensor network node, namely, two phase node self-location algorithm. The algorithm can be divided into two processes:the first phase is calculating the initial location of nodes with no consideration of the distance in the location algorithm; the second stage is achieving precisely the exact location of sensor nodes in iterative method. The algorithm has taken into consideration the energy consumption and location accuracy in the location of sensor node and network coverage as well, which are three important performance parameters. It is in this way that it can overcome the shortcomings of the non-distance related location algorithm since it has a low location accuracy. Finally, the simulation of the network proves effective than other location algorithms for it consumes less energy and provides more accurate location and network coverage.