An Improved Algorithm Based on Dv-Hop Localization for Wireless Sensor Network
DV-Hop is a typical range-free node localization algorithm in Wireless Sensor Networks (WSN); the localization cost and the hardware requirements are not high and localization accuracy of nodes is still low under certain circumstances. Based on the main r
- PDF / 586,724 Bytes
- 10 Pages / 439.37 x 666.142 pts Page_size
- 32 Downloads / 208 Views
An Improved Algorithm Based on Dv-Hop Localization for Wireless Sensor Network Su Bing and Xue Wei Jie Abstract DV-Hop is a typical range-free node localization algorithm in Wireless Sensor Networks (WSN); the localization cost and the hardware requirements are not high and localization accuracy of nodes is still low under certain circumstances. Based on the main reasons of the error of DV-Hop algorithm, an improved algorithm is proposed which is based on the average hop distance correction. The algorithm uses error correction value δ to modify the average hop distance, to reduce the deviation between the average hop distance and the true average hop distance. Simulation results show that, the improved algorithm has to more effectively reduce the average localization error of unknown nodes, and to improve the localization accuracy, and not require additional hardware. Keywords Wireless sensor networks (WSN) • Node localization • Distance vector-hop (DV-Hop) • Average hop distance • Error correction
26.1 Introduction Node location is one of the key technologies in wireless sensor networks (WSN). In most WSN applications, sensor nodes are randomly distributed, except for some anchor nodes; most of the node positions are unknown. Therefore, only under the premise of the clear nodes’ position information, further realization of the locating and tracking of the external target can be achieved. According to the localization mechanism, the existing localization algorithms can be divided into two types: range-based algorithm and range-free algorithm [1]. Compared with range-based X. W. Jie (*) Institute of Information Science and Engineering, Changzhou University, Changzhou 213164, Jiangsu, China e-mail: [email protected] S. Bing (*) Key Laboratory of Process Perception and Internet Technology of Changzhou, Changzhou University, Changzhou 213164, Jiangsu, China e-mail: [email protected]
Z. Zhong (ed.), Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012, Lecture Notes in Electrical Engineering 220, DOI: 10.1007/978-1-4471-4844-9_26, © Springer-Verlag London 2013
181
182
S. Bing and X. W. Jie
algorithm, range-free algorithm has lower hardware requirements and lower localization cost. This type of algorithm has gained wide attention due to these advantages. Among them, the DV-Hop [2] algorithm is widely used which is one of the range-free localization algorithms. It is a distributed localization algorithm based on range-free proposed by the Niculescu and Nath in the Navigate project. For research on the DV-Hop improved algorithm, the country has also made some achievements, such as literature. These improved algorithms to a certain extent though improve localization accuracy, but also increase the energy consumption and computing cost, etc. However, there is still room for improvement in the algorithms. It uses the product of the average hop distance between the nodes and these hops, to estimate the position of the unknown nodes, so that its localization
Data Loading...
