Multi-Hop Localization Algorithm Based on Grid-Scanning for Wireless Sensor Networks

• DOI: 10.3390/s110403908
• Publication Date: 2011-04-04T14:07:21Z
• Authors: Jiangwen Wan; Xiaolei Guo; Ning Yu; Yinfeng Wu; Renjian Feng
• Keywords: Adaptability; Bounding overwatch

For large-scale wireless sensor networks (WSNs) with a minority of anchor nodes, multi-hop localization is popular scheme for determining the geographical positions normal nodes. However, in practice existing methods suffer from various kinds problems, such as poor adaptability to irregular topology, high computational complexity, low positioning accuracy, etc. To address these issues this paper, we propose novel Multi-hop Localization algorithm based on Grid‑Scanning (MLGS). First, factors that influence distance estimation are studied and more realistic model constructed. Then, feasible regions nodes determined according intersection bounding square rings. Finally, verifiably good approximation grid-scanning developed estimate coordinates Additionally, accuracy can be improved through neighbors’ collaboration. Extensive simulations performed isotropic anisotropic networks. The comparisons some typical algorithms node confirm effectiveness efficiency our algorithm.