A Design of Wireless Sensor Network Node Location Algorithm

Abstract

Wireless sensor network belongs to an emerging concept and a technology for creating new application field. Range-free location algorithm can obtain distance information without any specific hardware, and thereby range-free location algorithm is more economic and effective, which is suitable for large-scale wireless sensor network. DV-hop algorithm is a distributed range-free location algorithm. It has advantages of simplicity and none dependence on the fact of measurement error. However, the algorithm has the disadvantage of low localization accuracy. In the paper, DV-hop location algorithm is improved. An improved DV-hop algorithm is proposed, namely a method of improving average hop distance calculation by introducing weight. It can be more rational. Topology relationship is utilized for selecting anchor node. Finally, weighted centroid algorithm is used for estimating location. The algorithm can reduce the algorithm complexity and location error.

A Hybrid Range-free Algorithm Using Dynamic Communication Range for Wireless Sensor Networks

“…It is given higher weighted coefficient for one hop count of target node. Li et al designed a newly 3D location algorithm in paper [17]. Firstly, average hop distance is calculation by weighted coefficient.…”