Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Node density independent localization
Proceedings of the 5th international conference on Information processing in sensor networks
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
| Hi-index | 0.00 |
Most of the current RSS (Received Signal Strength)-based localization algorithms in Wireless Sensor Networks (WSNs) rely on isotropic radio propagation model to infer the distance between a pair of nodes from received signal strength, which however has been proved to be quite unreliable in recent research work. Performance analysis is important to evaluate the applicability of a localization algorithm, however little work has been done on evaluating the existing localization algorithms in simulated realistic settings. This paper firstly presents the motivation and detailed implementation of a proposed Link-State Based Annulus (LSBA) localization algorithm, and then gives a panorama of performance comparison among LSBA and other four localization algorithms in terms of estimation error, convergence speed, computational complexity and communication cost in the simulated realistic environment. Simulation results show that LSBA achieves the best tradeoff among all the four metrics in WSNs with moderate number of anchors, and has good adaptability to irregular node deployment as well.