Distributed range‐free localisation algorithm for wireless sensor networks
Authors:
Open Access
- 1 June 2014
- journal article
- wireless communications
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 50 (12) , 894-896
Abstract
A novel distributed range‐free localisation algorithm to accurately locate regular nodes in wireless sensor networks is presented. Existing methods reduce the possible area where a regular node would be located by using anchors (i.e. nodes with known locations) only. These methods are effective only when anchor density is high. In contrast, the work presented here reduces the possible area of a regular node iteratively, using both anchor node locations and the possible areas of its neighbouring and non‐neighbouring ‘regular’ nodes from early iteration. This allows a significant improvement in the localisation accuracy. Simulations verify the advantage of the proposed algorithm and show that the localisation error can be controlled within 15% with off‐the‐shelf devices.Keywords
Funding Information
- National Natural Science Foundation of China (61373091, 60933011, 11102124, 61202478)
- National Science Foundation (US NSF CNS‐0917097)
This publication has 3 references indexed in Scilit:
- Group-based discovery in low-duty-cycle mobile sensor networks2012
- Range-free localization and its impact on large scale sensor networksACM Transactions on Embedded Computing Systems, 2005
- DV Based Positioning in Ad Hoc NetworksTelecommunication Systems, 2003