Font Size: a A A

Research Of Node Localization Algorithm On Wireless Sensor Network

Posted on:2011-01-07Degree:MasterType:Thesis
Country:ChinaCandidate:F P BaoFull Text:PDF
GTID:2248330395957705Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
WSN(Wireless Sensor Networks) has developed rapidly and has important research values and utility values in lots of fields such as industry and agriculture, military affairs,and environmental monitoring. In the Wireless Sensor Networks, the location information of sensor nodes is an important issue. Ensuring the event’s location or getting the node position is one of the basis functions of WSN and plays a key role in the validity of WSN.This paper mainly researches the node localization algorithm of WSN and has the following sections:The node localization’s research background and significance of WSN is introduced, as well as the utility value and the domestic and foreign research status.The WSN’s relative technology and the concept and fundamental principle of node localization are introduced. The typical algorithms’ principle and characteristics are discussed. The existed problems of these algorithms are generalized by analyzing and comparing several distant unrelated algorithms.On the basis of DV-Hop node localization algorithm, to improve the error of beacon nodes’ estimated distances in DV-Hop algorithm, an improved DV-HOP based on PSO algorithm by analyzing the error of beacon nodes’ estimated distances is proposed. In this algorithm, the average one-hop distance error of beacon nodes is modified, and the PSO algorithm is applied to calculate the unknown nodes’ positions, which are more accurate. The simulation results show that the proposed algorithm can make the distance of unknown nodes and beacon nodes close to the actual distance and increase the location precision effectively.By researching the relationship of classical MDS algorithms deeply, a MDS localization algorithm based on clustering is proposed. Firstly, the algorithm divides the network into clusters. Then, the relative positions are calculated iteratively combining the Non-metric MDS algorithm with the PSO algorithm. Next, the nodes’ positions are transformed to generate the network’s location graph. Finally, the node’s absolute position is calculated with the beacon node’ position. The simulation results show that this algorithm can overcome the disadvantages of the traditional classical MDS in localization precision and energy cost and has a high precision and a low cost.
Keywords/Search Tags:Wireless sensor networks, Multidimensional scaling, Node location, PSO, DV-Hop, Cluster
PDF Full Text Request
Related items