Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2019, Vol. 42 ›› Issue (3): 98-105.doi: 10.13190/j.jbupt.2018-233

• Reports • Previous Articles     Next Articles

An Iteration Localization Algorithm in Wireless Sensor Network Based on Intersection Degree Ratio

QIAN Kai-guo1, PU Chun-fen2, WANG Yu-jian1, SHEN Shi-kai1   

  1. 1. School of Information Engineering, Kunming University, Kunming 650214, China;
    2. School of Teacher Education, Kunming University, Kunming 650214, China
  • Received:2018-11-15 Online:2019-06-28 Published:2019-06-20

Abstract: In order to improve the performance of range-free localization algorithm such as DV-Hop and Amorphous for wireless sensor network,the problem of using the minimum hop path distance to replace the Euclidean distance between nodes and choosing the approximate collinearity beacons to calculate location of unknown node that introduces large positioning error is studied. An iteration localization algorithm in wireless sensor network based on intersection degree ratio (ILA-IDR) is proposed. The ILA-IDR algorithm first uses the localization group topology distribution quality function to select three 1-hop neighbor reference nodes form a non-collinear positioning unit, and then the distance calculation based on the intersection degree ratio is used to improve the estimation distance accuracy. Finally, the hyperbolic calculation method is adopted to reduce the error to improve the node location accuracy. Simulation shows that the ILA-IDR algorithm is superior to those of the DV-Hop, Amorphous and the advanced algorithm for that the localization error of the ILA-IDR algorithm is lower than those algorithms both in the node uniform and C-Shape distribution scenario.

Key words: wireless sensor network, localization group, intersection degree ratio, localization accuracy

CLC Number: