Wireless Sensor Networks Dv-hop Algorithm

Wireless sensor networks, as a new pattern of information obtaining, have many advantages such as low cost, fast deployment, sefl-conducting,flexibility. Through abundant micro-sensor nodes deployed randomly in the monitor and control area, it can fulfill real-time target information obtaining, processing and transmission. Since definition of the localization of monitoring target is the presupposition for the working of most sensor networks, localization of the system and sensor network node have become one of the most important subjects within the profession.Varieties of different positioning algorithms have been proposed by scholars from many countries. This paper begins with the introduction of most basic concepts of wireless sensor network as well as its systematical structure, main technologies, relevant applying area, previous researches at home and abroad. Then this paper gives a detailed analysis of several classical localization algorithms in the process of sensor network node localization as well as their classifications, standards for the assessment of their performance. It is followed by a deep analysis of DV-Hop. In accordance with its deficiencies, one improved algorithm has been proposed. Calculate the distance between anchor nodes and the unknown nodes in single hop using RSSI, upgrade the unknown nodes in single hop which have been located to anchor nodes, then take them part in position calculation in the follow-up, improve the caculation method of the average distance of each hop. In the end, simulating experiment for the improved algorithm is conducted by MATLAB software and comparison with original DV-Hop in the respect of positioning accuracy, coverage, and energy consumption is made, superiority of the improved algorithm is verified.