The Research On The Wireless Sensor Network Node Localization Algorithms Based On Dv-hop

As a new technique in information acquisition and processing, wireless sensornetworks, with the development of the lower-power electronic and the radiotechniques, has been wildly used in a lot of areas such as the national defense, outerspace exploration, environmental supervision, counter-terrorism, disaster retrievaland so on. But for most applications, only data without location information leads tothe limited use in wireless sensor network. So the demestic and foreign scholars paymore attention to the localization technique in wireless sensor networks.Existing localization algorithms can be approximately divided into twocategories: the range-free localization algorithm and the range-based localizationalgorithm. The range-based one has the better accuracy, at the same time requires theadditional hardware cost, which doesn’t meet the regular application for the sensornetwork. Obviously, the range-free one can provide the location accuracy which isavailable for the use, needing less support from the hardware, has higher significantadvantages on the cost and power. This thesis focuses on the research of therange-free location algorithm.At first, the investigation status of wireless location positioning systems forWSN both in china and the foreign countries are summarized. Besides, the basicknowledge and related techniques have been introduced. Then the principles,characteristics and advantages of related outstanding approaches on WSN arepresented and discussed, especially the classic positioning algorithm. The thesisfocuses on the investigation of Dv-hop location algorithm as well as the improvementon it. There are two improved node positioning algorithm: the first one is with theaverage jump distance of the multi-dimensional (ADMD) Dv-hop, the second is therevision hops within a certain space range (RHWSR).ADMD, which use the average jump distance of multi-dimentsional hop to takeplace of the single one, at the same time, take use of the multi-dimentsinal one tocalculate the distance between the unknown node and the beacons. By simulatingthese algorithms, the porposed improvements can greatly enhance the localizationaccuracy of the unknown nodes without the additional hardware.RHWSR refines its hop value by assigning the hop interval to the nodes withinthe range of one beacon, and uses the hop interval to calculate the total number of hops between nodes in the network. By simulating the RHWSR and Dv-hopalgorithms, the former one needs less beancons to get the same accuracy, will meetmore applications at less cost.Finally, the conclusion of this thesis and the prospect for the future researchwork are proposed.