Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
| Hi-index | 0.00 |
Localization has been a major challenge in Wireless Sensor Networks (WSN) because without finding the position of the sensor that is reporting sensed data, the data reported will not be useful. However, most of the previous localization approaches demand that sensors have plenty of resources like power, memory, or extra hardware used for ranging. In this paper we propose a new localization algorithm that accurately localizes sensors while minimizing power consumption and memory requirement of the sensors, and without depending on any extra hardware. Moreover, the proposed algorithm does not necessitate the presence of many nodes with preconfigured positions, or anchor nodes. In the proposed algorithm, anchors are placed in a circle or a semi-circle around the perimeter of the WSN. Not only this placement strategy leads to more accurate localization, but also it is very convenient for WSNs used for environment monitoring or military surveillance or tracking applications, since in these applications it is not convenient to deploy anchors in the middle of a hostile or enemy terrain.