Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Sequence-Based Localization in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
MoteTrack: a robust, decentralized approach to RF-Based location tracking
LoCA'05 Proceedings of the First international conference on Location- and Context-Awareness
An improved localisation algorithm for performance improvement
International Journal of Mobile Communications
Hi-index | 0.00 |
Automatic localization of sensor node is a fundamental problem in wireless sensor networks. For many applications, it is meaningless without relating the sensed data to a particular position. Many localization procedures have been proposed in the field recently. In this paper, we present a collaborative localization scheme from connectivity (CLFC) for wireless sensor networks. In this scheme, the connectivity information is used to improve the accuracy of position estimation. Relative positions between sensors are corrected to satisfy the constraints of connectivity. The scheme is composed by two phases: initial setup phase and collaborative refinement phase. In initial setup phase, DV-Hop is run once to get a coarse location estimation of each unlocalized sensor. In collaborative refinement phase, a refinement algorithm is run iteratively to improve the accuracy of position estimation. We compare our work via simulation with two classical localization schemes: DV-Hop and AFL. The results show the efficiency of our localization scheme. When compared with DV-Hop, estimation error of CLFC is reduced by 14% and 20% for random beacon deployment and fixed beacon deployment respectively. Furthermore, the proposed method CLFC is much better than the traditional mass-spring optimization based scheme AFL in terms of convergence rate. This results in significant saving in message complexity and computation complexity.