Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Mobile Communications Handbook
Mobile Communications Handbook
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Efficient Localized Localization Algorithm for Wireless Sensor Networks
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Path loss exponent estimation for wireless sensor network localization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed and energy-efficient target localization and tracking in wireless sensor networks
Computer Communications
Computers and Electronics in Agriculture
Advances in communication networks for pervasive and ubiquitous applications
The Journal of Supercomputing
Hi-index | 0.00 |
In ad hoc sensor networks, it is very essential for sensors to know their own positions exactly which provide the context to sensed data. Sensors in ad hoc sensor networks enable to locate their positions from a relatively small number of landmarks that know their coordinates through external means (e.g., GPS). In this paper, we assume that sensor nodes can measure the distances and relative bearings to neighboring nodes within their transmission range. The proposed method will utilize the distances and relative bearings to find the locations of nodes. Firstly, sensors nearest landmarks will locate their position and then in order nodes more hops far from landmark will. We utilize many landmark coordinates and multiple paths to a landmark to improve the accuracy of the position. Simulation results under the various conditions have been obtained and especially compared with the results using DV-hop and DV-distances.