Beacon moving location algorithm in WSN

Authors:
Keji Mao;Qike Shao;Wenxiu He;Rong Chen;Qingzhang Chen
Affiliations:
College of Computer, Zhejiang University of Technology, Hangzhou, China;College of Computer, Zhejiang University of Technology, Hangzhou, China;College of Information, Zhejiang University of Technology, Hangzhou, China;College of Computer, Zhejiang University of Technology, Hangzhou, China;College of Computer, Zhejiang University of Technology, Hangzhou, China
Venue:
International Journal of Sensor Networks
Year:
2013

Citing 3
Cited 0

Range-free sensor localisation with ring overlapping based on comparison of received signal strength indicator

International Journal of Sensor Networks
RF angle of arrival-based node localisation

International Journal of Sensor Networks
Error analysis of range-based localisation algorithms in wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Location is one of the key technologies in Wireless Sensor Networks WSN. A lot of location algorithms assume that beacon nodes are fixed, but in most practical applications, the locations of some beacons will be changed after deployment, which leads to other unknown nodes rely on these beacons cannot be accurately located. In this paper we proposed an Area Division-based Beacon Movement Detection Algorithm AD-BMD to solve the location problems with beacons movement, through two judgement processes to determine which beacon have moved, and set a coordinate confidence value for each beacon. We also proposed a Beacon Movement Detection based Beacon Optimal Selection Location Algorithm BMD-BOS to use moving and unmoving beacons more reasonably, by selecting beacons reasonably to calculate the position of unknown nodes. Experimental results show that AD-BMD has high-correct rate and low-error rate. Compared with LB and SSV, AD-BMD has better performance. The location accuracy of BMD-BOS is much higher than N-BMDs and D-BMDs.