The Research Of Node Localization Technology Of Wireless Sensor Network

Wireless Sensor Networks, which integrates wireless communication, embedded computing and information processing, is a new distributed and organized networks of data acquisition. The Localization technique is one of important support techniques of the wireless sensor networks, is the precondition of many applications of the sensor networks, such as target identification, surveillance and tracking. Self-localization of sensor node is to get the position information of unknown nodes by using information of some already known nodes and some special mechanisms. The basic approach to use beacons that aware of positions as reference nodes, and other nodes compute their positions through the relationship of distance, angel, or network connectivity to the beacons.This paper analyzes the wireless sensor network node self-positioning classical algorithm DV-Hop, and studies the influence of the angle of three neighbor nodes in line path on the path length. Because of the shortages of using DV-Hop algorithm to compute the distance from unknown node to beacon node and computing the jump distance of neighbor node, it uses ways of computing angle with neighbor set overlap and using network average connectivity to compute node jump distance which improves DV-Hop algorithm. The improved DV-Hop algorithm makes anchor path node compute jump distance accurately. The experimental simulation result shows that the DV-Hop algorithm increases node positioning accurately and coverage effectively.