Research On DV_Hop Localization Algorithm In Wireless Sensor Network

Wireless sensor network is constituted by a series of sensor nodes,which are randomdistribution.WSN is a self-organized wireless network,which aims is to perceptioncollaborative,acquisition and processing the information of network coverage in the geographicarea;and sent the information to the observer. Localization is one of the essential issues in theapplication of Wireless Sensor Networks(WSN), and reliable and effective node localization issignificant in event observation, target tracking and route efficiency improvement. In the light ofcharacteristics and specific applications of WSN, it has world-wide applicationbackground and vital value to research the appropriate localization algorithms in WSN.The paper has three parts, First, the thesis systematically studies the wireless sensor networkpositioning methods and the development status, analysis and comparison of the algorithms.Then,we give a priority to the study of DV_Hop localization algorithm and analyze itsadvantages and disadvantages. we introduce the idea of the mobile anchor node, and propose animproved algorithm. At last,we verify and discuss the overall performance of the improvedlocalization algorithm. We do a simulated comparison between the improved algorithm andDV_Hop localization algorithm.Experiments show that the improved localization algorithmproposed in the thesis has a higher precision and a bigger coverage rate. Paper has five chapters,the main points of each chapter are: The first chapter is an introduction, briefly introduced theresearch background and an overview of wireless sensor networks, analysis of the research statusof the wireless sensor network localization algorithm, and established the research content andstructure of this article.The second chapter discusses the positioning of wireless sensor networks,focused on range_free algorithm,summary research focus of improve the positioningperformance of range_free algorithm, laid the foundation for subsequent chapters seminar.Chapter III discuss the DV_Hop algorithm, analysis the advantages of localization algorithmbased on the mobile anchor node and propose an improved algorithm. The main idea of thealgorithm is: The mobile anchor node moves in the entire region along the Scan model andbroadcast its own location information to the surrounding nodes. The fixed anchor nodescalculate the average hop distance and broadcast. Unknown node determine distance to theanchor node by weighted the received average hop distance, and finally, calculating its own location information by selected combination of message. Chapter IV is the experimentalstudy.Based on the Matlab simulation platform,we do a simulated comparison between theimproved algorithm and the DV_Hop algorithm.Experiments show that,compared with the samekind of algorithms, the improved algorithm proposed in the thesis has a higher precision and abigger coverage rate.