Research On Range Free Self-localization Algorithm For Wireless Sensor Network

Wireless sensor network is developing rapidly in recent years, its main task is the acquisition, transmission, analysis and processing of information. With the decline in the price of components, wireless communication technology and protocol, algorithm development, wireless sensor network in military reconnaissance, geological exploration, disaster forecast, environmental protection etc has broad application prospects.Wireless sensor node returns information must contain the position of node. Because the cost of wireless sensor network is limited, a large number of sensor nodes in monitoring area of only a few expensive node to use a GPS device to obtain their own position accurately. But most nodes are not know their locations, these nodes must put the location of the event returned. So it’s important to locate the large number of nodes in wireless sensor network in the initialization phase. Existing Range-free localization algorithm have shortcomings, so research and improve wireless sensor network node self localization range-free algorithm is a research hotspot.The work of the paper is research on range free self-localization algorithm for wireless sensor network. In order to solve the traditional centroid algorithm’s poor positioning accuracy, positioning the low coverage when monitoring area beacon nodes sparse and node’s communication radius is small, to improve centroid algorithm, The algorithm, Improved centroid based on Ad Hoc localization algorithm, ICAH algorithm using the distance vector routing principle to make the unknown node can use more beacon nodes to locate itself, the beacon node in accordance with the unknown node distance given the corresponding weight, in order to correct the beacons to coordinate the size of influence. Through the software MATLAB simulation experimental results demonstrate ICAH algorithm, positioning accuracy and coverage are better than the centroid algorithm; In order to improve the traditional DV-Hop algorithm positioning effect, this paper proposes an improved DV-Hop algorithm, Improved DV-Hop based on hop-distance Error Correction localization algorithm. The new algorithm based on average hop distance for the entire network average, to eliminate the monitoring of regional node distribution effects, then use the beacon node distance is known, the average hop distance error correction. Finally in the unknown node localization beacons to GPS coordinates for error correction. Software MATLAB simulation experimental results show that the IDHEC algorithm can reduce the localization error.