Study Of Distance Vector-Hop Algorithmin Wireless Sensor Networks

As the basis for the implementation of the Internet of Things (IOT), also animportant part of the Innovation project for the present IOT, the Wireless SensorNetwork (WSN) was confirmed as the critical information transmission technology inthe12thfive-year development plan for IOT published by National Industry andInformation Technology Ministry in2012. Location technology is the supportingtechnology for the WSN. With the social development and progress, the market of thelocation service is growing continuously. Hence, the research on location technologywill be of great value in both theory and practice.A widely used algorithm-Distance Vector-Hop (DV-HOP) was chose to make thefurther research on location technology. According to the difference in the applicationrequirements of the location service, two improved algorithms were developed basedon the high precision-based and the low energy consumption-based design targets,respectively. The work in this paper would deepen the research of the locationtechnology in the field of WSN and also provide some fundamental ideas for theapplication and the expansion of this technology.The main research resultsin this paper are described as follows.①The importance of the usage of the location technology in WSN was discussedfully. Furthermore, the shortness for applying the current strategy or technology oflocation to WSN was also analyzed. In order to strengthen the foundation for thefollow-studies on the location algorithms, the advantage and disadvantage of the rangelocalization algorithms and the range-free localization algorithms were reviewed indetail when using them into the realization for the location technology. According tosome evaluation criteria for the location algorithms, typical range-free localizationalgorithms were analyzed and discussed in depth.②As for the high-precision demands of the location, a DV-HOP algorithm basedon membership-twice refinement was proposed and discussed. Since some problemsconcerned on the location error will always be encountered when using the DV-HOPalgorithm, a modified algorithm was developed by applying the correspondingcalibration method to reduce the calculation error of the distance between nodes. Thisalgorithm chooses the distance range determined by the hop count among thenodes asthe principle to select the clustering core, then uses the membership function of the nodes to do a twice refinement calculation for the unknown nodes to calibrate thelocation of the unknown nodes. By that way, this algorithm finished the locationprocess. Simulation results indicated that this algorithm can improve the accuracy ofthe location. The practicability of this algorithm was also verified on a small self-builtWSN.③For the low-energy consumption demands of the location, a DV-HOP algorithmbased on the probabilityof the limitation of the hops was analyzed in this paper. Thenode distribution in a random deployment network is analyzed in thisalgorithm by anapproximate probability way. According to the distribution feature of network nodesand the requirement of the information on location, the hops between nodes are underrestriction. In this way, the amount of the network traffic was reduced effectively andthe purpose to reduce energy consumption was also achieved. The energy-savingpotential was discussed from two aspects of the computation and communicationoverhead, respectively.