Font Size: a A A

Study Of Node Localization Algorithm Based On Simple Particle Swarm Optimization In Wireless Sensor Network

Posted on:2014-02-10Degree:MasterType:Thesis
Country:ChinaCandidate:C G GaoFull Text:PDF
GTID:2268330401462183Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
As a new network technology, Wireless Sensor Networks have been applied tomilitary, intelligent transportation, environmental monitoring and other fields.Localization is one of the important support technologies of Wireless SensorNetworks. Location information is important to network monitoring. It ismeaningless, if there is no location information. We need to adopt a certainmechanism and algorithm to implement the localization of wireless sensor network.In this paper, according to the characteristics of Wireless Sensor Networks, weintroduce the simple particle optimization algorithm respectively to range-based andrange-free node localization algorithm. We put forward a simple particle swarmoptimization algorithm based on dynamic extremum disturbed arithmetic operatorsof the localization algorithm (DTSPSO) and a DV-hop algorithm based on DTSPSO.First of all, this paper introduces the concept and characteristics of WirelessSensor Networks and system structure. This paper gives a brief introduce of thenecessity and important significance of the node positioning. This paper elaboratesthe basic principle of node localization and the classification methods of localizationalgorithm. And it also describes the performance evaluation standard.Secondly, this paper introduces the origin and the main principle of the particleswarm optimization algorithm and the algorithm flow. In view of the localconvergence problems of the optimization algorithm, we introduced the dynamicextremum disturbed arithmetic operators disturbing the individual and globalextremum to improve the algorithm. According to the characteristics of RSSIranging, a distance error correction coefficient is introduced to limit the search scopeof feasible solution. And we put forward a simple particle swarm optimizationalgorithm based on dynamic extremum disturbed arithmetic operators of thelocalization algorithm (DTSPSO), and the specific process of the algorithm is given.In addition, in order to improve the positioning accuracy of DV-hop algorithm, thecalculation method of distance between anchor node and the unknown is impromved.We use simple particle swarm optimization algorithm based on dynamic extremum disturbed arithmetic operators to localize the unknown node. In order to limit thesearch scope, estimated distance correction factor is introduced, and a DV-hopalgorithm which is based on DTSPSO is proposed.Finally, NS-2simulation tool is used, and the simulation results prove that theDTSPSO which is proposed in this paper and DV-hop based on simple particleswarm optimization algorithm showed good performance on localization in WSNs.
Keywords/Search Tags:wireless sensor networks, localization, simple particle swarmoptimization, DV-hop
PDF Full Text Request
Related items