Beacon moving location algorithm in WSN Online publication date: Sun, 29-Sep-2013
by Keji Mao; Qike Shao; Wenxiu He; Rong Chen; Qingzhang Chen
International Journal of Sensor Networks (IJSNET), Vol. 14, No. 2, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook