Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2018, Vol. 41 ›› Issue (2): 75-80.doi: 10.13190/j.jbupt.2017-186

• Papers • Previous Articles     Next Articles

Node Localization with Random Walk for Wireless Sensor Networks

YIN Yu-qing1, GAO Shou-wan1, WANG Xiao-qi2, NIU Qiang1   

  1. 1. School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China;
    2. School of Physics and Electronic Information, Henan Polytechnic University, Henan Jiaozuo 454000, China
  • Received:2017-09-15 Online:2018-04-28 Published:2018-03-17

Abstract: In order to improve node localization accuracy, a node localization algorithm based on adaptive random-walk module was presented for wireless sensor networks. First, a novel metric for relative distance among node sensors was modeled by applying the idea of random walk to the connectivity of system topology. Then an adaptive approach was designed to increase the validity of the metric. At last, node positions were finally obtained by embedding the metric in the classical localization algorithm distance vector-hop (DV-Hop). Simulation and outdoor environment's results show that the design achieves better robustness and positioning performance, and localization errors of the proposed method reduce by about 20%~30% compared with that of DV-Hop algorithm.

Key words: node localization, wireless sensor network, random walk, a metric for relative distance, adaptive algorithm

CLC Number: