Font Size: a A A

The Research Of Localization Algorithm Based On DV-HOP For Wireless Sensor Networks

Posted on:2015-05-16Degree:MasterType:Thesis
Country:ChinaCandidate:L LiFull Text:PDF
GTID:2298330431492609Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
Wireless sensor networks as a dynamic network-aware, consisting of numerousmicro-sensor nodes, deployed in the monitoring region, it is a self-organizingmulti-hop network system to perceive, collect and process the information. It isbecoming more and more important in human life, it is even slowly changing the waypeople live, such as smart home completely subvert the original way of indoor homeuse. As a key technology of wireless sensor networks-wireless sensor positioned, is avital part in its core technology. No precise positioning, real-time monitoring orpersonnel positioning these are empty words. The current positioning technology ingeneral there is still much room for growth, the positioning accuracy needs to beimproved, which is the focus of this study.This paper focuses on the DV-HOP localization algorithm and particle swarmoptimization in the application of DV-HOP localization algorithm. DV-HOPlocalization algorithm is a widely used non-distance positioning algorithm, its twokey factors are the smallest number of hops and the average hop distance, the two isalso the root of the algorithm to produce positioning error. This paper analyzed theerror, and makes improvement, the major works are as follows:First, the paper made a brief overview of the historical origin of wireless sensornetwork, the technology development and the important roles in modern society.Besides, the paper introduced several classic positioning methods based on rangingand non-ranging.Second, when the DV-HOP in the calculation of the smallest number of hops,without considering the actual physical distance between nodes. No matter how muchdistance between two nodes, as long as the node receives the neighbor nodesbroadcast information,then plus a fixed number of hops, which is bound to bring asubsequent calculation error, leading to decreased positioning accuracy. For thisreason, we propose a hop optimized algorithm(OHDV-HOP), the algorithmintroduced RSSI technology, consider the actual distance between nodes, to modify the minimum hop. Through simulation reveals the new algorithm has been someimprovement on the positioning accuracy.Third, the DV-HOP in the calculation of the average hop distance, since mostof the network nodes arranged in random, tortuous path is not a straight line, so thecalculation of the average hop distance, with the increase of the number of anchornodes and the average hop distance calculated actual there are small incremental jumpfrom trend. For this reason, we propose a hop size optimizing algorithm(OSDV-HOP),the algorithm introduces three parameters, including the ratio of anchor nodes p, theaverage hop distance values of the entire network and the maximum average hopdistance value of all the anchor nodes, to modify the hop distance. Throughsimulation reveals the new algorithm has been some improvement on the positioningaccuracy.Fourth, make a detail discuss on the principle and process of Particle swarmoptimization theory. Use the good performance of particle swarm optimization andcombined with the proposed positioning algorithm of DV-HOP. The simulation showsthat at no additional cost, the positioning performance of the proposed DV-HOPimproved algorithm has been further improved.
Keywords/Search Tags:Wireless sensor networks, DV-HOP localization, Minimum hops, Average hop distance, Particle Swarm Optimization
PDF Full Text Request
Related items