Abstract
This paper aims to improve the positioning accuracy of the traditional DV-hop algorithm in networks of uneven node distribution. For this purpose, an improved algorithm was proposed that reduces the errors in terms of the hop count, the mean single-hop distance of anchor nodes and the mean single-hop distance of unknown nodes. Specifically, the hop count was modified based on the RSSI value of the node and the critical RSSI ratio; the mean single-hop distance of anchor nodes was corrected based on the ratio of the single-hop RSSI path length between two nodes to the mean single-hop RSSI path length (i.e. the correction factor); the mean single-hop distance of unknown nodes was divided into two sections to achieve better estimation of the distance between anchor nodes and unknown nodes. The simulation results indicate that the improved algorithm boasts better positioning accuracy and stability than the contrastive algorithms, with the addition of a few computing and communication overhead. The research findings shed new light on the accurate positioning of nodes in wireless sensor networks (WSNs).
Highlights
Node location information is essential to various applications of wireless sensor network (WSN), including but not limited to target, detection, target tracking, and automatic configuration of network topology [1]
To further enhance the positioning accuracy, this paper proposes an algorithm that reduces the errors in such three aspects as the hop count, the single-hop distance of anchor nodes and the mean single-hop distance of unknown nodes
Proposed by Niculescu et al [11, 12], the DV-hop algorithm estimates the distance between anchor nodes and unknown nodes by multiplying hop count with the mean single-hop distance, and calculates the coordinates of unknown nodes with threesided measurement
Summary
Node location information is essential to various applications of wireless sensor network (WSN), including but not limited to target, detection, target tracking, and automatic configuration of network topology [1]. The ranging-free algorithms, featured by low hardware requirements, and positioning accuracy, mainly include DV-hop algorithm, centroid algorithm and approximate point in triangle (APIT) algorithm. Reference [5] modifies the mean single-hop distance of anchor nodes and unknown nodes to improve positioning accuracy. Reference [8] relies on the error in mean single-hop distance to correct the mean single-hop distance between anchor nodes and unknown nodes. Reference [9] adjusts the hop count using the RSSI method, and identifies the mean single-hop distance of unknown nodes by weighting the mean single-hop distance of each anchor node. To further enhance the positioning accuracy, this paper proposes an algorithm that reduces the errors in such three aspects as the hop count, the single-hop distance of anchor nodes and the mean single-hop distance of unknown nodes
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call