Font Size: a A A

Study On Localization Algorithm For Wireless Sensor Networks

Posted on:2012-04-17Degree:MasterType:Thesis
Country:ChinaCandidate:H ZhangFull Text:PDF
GTID:2178330335952727Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
As a new method of obtaining information, wireless sensor networks have displayed incomparable advantages compared with traditional methods of obtaining information. They will exert a great influence on production and life of human. Wireless sensor networks have many advantages such as low cost, fast deployment, flexibility. They have broad application prospects in military surveillance, industrial control, agricultural production, counter-terrorism and disaster relief. Node localization is one of the key technologies in wireless sensor network, it is the basis for many applications, however, because random deployment of wireless sensor network nodes, the large number of nodes and the limitation of hardware and software resources, many of the traditional location algorithms do not apply to wireless sensor networks Therefore, studying effective localization algorithm for wireless sensor networks has a very important significance.This thesis introduces the basic information in wireless sensor networks, including network architecture, composition of sensor nodes, characteristics, key technologies and application fields and so on, then introduces the basic concepts and terminology of localization algorithm, evaluation criteria of localization algorithm, classification criteria and classification of localization algorithm, introduced the commonly used distance measurement technology, including TOA, TDOA, AOA, RSSI, etc., the commonly used calculation methods of coordinates, including: trilateration, triangulation method, maximum likelihood estimation, the several classical localization algorithms, such as:APS localization algorithm, MDS-MAP localization algorithm, SPA localization algorithm and centroid localization algorithm.This thesis points out the shortcomings of DV-HOP algorithm based on the deep analysis of it, based on improving positioning accuracy and coverage, improves DV-HOP algorithm from the following aspects:1. Calculate the distance between beacon nodes and unknown nodes in single hop using RSSI instead of using the average distance of each hop to replace it directly in DV-HOP algorithm. This will improve the positioning accuracy of the unknown nodes in single hop.2. Upgrade the unknown nodes in single hop which are located to beacon nodes, they will take part in position calculation in the follow-up. Set the priority of the previous beacon nodes and beacon nodes to upgrade, and the use of previous beacon nodes is preferred in the follow-up to improve positioning accuracy while maintaining coverage.3. Improve the calculation method of the average distance of each hop, use the arithmetic mean of the average distance of each hop of various beacon nodes to replace the average distance of each hop of a single beacon node in DV-HOP, considering the state of the entire network, and further improve the positioning accuracy.Finally, this thesis simulates DV-HOP algorithm and improved algorithm using the NS2 simulation software. Simulation results show that the improved algorithm has higher accuracy and greater coverage than DV-HOP algorithm.This work is supported by National Natural Science Foundation of China(No: 60970064), National Key Basic Research Program of China(No.2011CB302601), Open Fund of the State Key Laboratory of Software Development Environment(Grand No:SKLSDE-2011KF-01), New Century Excellent Talents, Research Funds for the Central Universities(2010-Ⅱ-003) and the National High Technology Research and Development Program of China(863 Program) under Grant No.2009AA043303.
Keywords/Search Tags:wireless sensor networks, localization algorithms, DV-HOP algorithm, positioning accuracy, coverage
PDF Full Text Request
Related items