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
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
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
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
A Map-growing Localization Algorithm for Ad-hoc Wireless Sensor Networks
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
A Sorted RSSI Quantization Based Algorithm for Sensor Network Localization
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
A Distributed Location Estimating Algorithm for Wireless Sensor Networks
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
| Hi-index | 0.00 |
Localization of the nodes in Wireless sensor networks (WSNs) is an important research issue, since it can enhance the efficiency in computation and minimize the power consumption of the nodes. In this paper, a novel localization algorithm is proposed to estimate the location information of the normal nodes with help of few beacon nodes and angle information of the anchor nodes. Our localization scheme can use at most three beacon nodes to find location information of any normal node in a distributed manner. Besides, we give the theoretical basis for determining the localization error using probability distribution function. Our performance analysis shows that there is a tradeoff between deployed number of beacon nodes and localization error and average localization time of the network can be increased with deployed number of normal nodes.