Research On Gossip-based Localization Algorithms In Wireless Sensor Networks

In today’s era of mobile Internet, wireless sensor network technology hasundoubtedly become a hot topic of theoretical research. The positioning of wirelesssensor networks is widespread concern that the theoretical and engineering researchfocus. In recent years， the research on wireless sensor network localization technologyfinally focused on distributed localization algorithm and technology. In this paper, withthe problem of distributed localization in wireless sensor network as the researchbackground, the pairwise and broadcast gossip algorithms are introduced to the originallocation algorithm framework, and the main research results are as follows:First of all, the history and idea of gossip algorithms are introduced in this paper.The implementation of the firstly proposed pairwise gossip algorithm, the recently hotbroadcast gossip algorithm and other gossip algorithms are given. And discuss thepossibility of application of gossip algorithms aiming at the typical distributedenvironment for distributed localization in wireless sensor network.Secondly, analyze and study in depth the time difference of arrival localization fordistributed localization, grasp several classical methods for the time difference of arrivallocalization. On this basis, we successfully combine gossip algorithm and the timedifference of arrival localization, thus establish the formation of the arrival timedifference positioning mechanism based on gossip in wireless sensor network. The newalgorithm not only improves the positioning accuracy and stability of the originalalgorithm, but also solves the problem of distributed consensus localization that originallocalization algorithms can’t complete.Finally, the angle of arrival localization problem in distributed localization isstudied in depth. A new angle of arrival localization algorithm is formed when thegossip mechanism is introduced. The new algorithm has the advantage of higherlocalization precision and stability and can complete distributed consensus localization.