Study On Localization Algorithms In Wireless Sensor Networks

Wireless Sensor Network (WSN) technology, as one of the most essential information technologies, has been developed rapidly and applied in wide fields recently. Sensor node's location information is crucial to the network's performance and functionalities. Without node's location information the sensing data would be meaningless in most WSN applications.The study in this paper focuses on node's localization algorithms in WSN, and mainly discusses on the improvement schemes of range-free localization algorithms and secure localization schemes. Firstly, an improved DV-Hop localization algorithm based on the ordered neighboring nodes in space was proposed in order to improve the precision of nodes'localization result, the performance would be better when the beacon nodes are under a low ratio condition. Secondly, a range-free algorithm based on mobile sink node and DV-Hop localization scheme was proposed in order to decrease the hardware cost and implement complexity in WSN, the mobile sink node do not required to cover the whole network area and without attach any distance measure equipment, the localization inaccuracy would become smaller as the virtual beacon's ratio become greater. Finally, assumed that some of beacon nodes were attacked as a result of the secure vulnerability of WSN, a secure DV-Hop localization algorithm based on beacons' credits was proposed, by distributed calculating the credits of beacons, nodes could effective eliminate the malicious beacon information to ensure the correctness of beacon location information they received.