A Heuristic Method for Wireless Sensor Network Localization
Autor: | Fariborz Mahmoudi, Abolfazl Toroghi Haghighat, Mohamadreza Shahrokhzadeh, Behrooz Shahrokhzadeh |
---|---|
Rok vydání: | 2011 |
Předmět: |
Brooks–Iyengar algorithm
Computer science business.industry Heuristic (computer science) Distributed computing Multilateration Base station Key distribution in wireless sensor networks Iterative Multilateration Localization Simulated annealing Mobile wireless sensor network General Earth and Planetary Sciences Wireless Wireless Sensor Networks Simulated Annealing business Wireless sensor network Algorithm General Environmental Science |
Zdroj: | ANT/MobiWIS |
ISSN: | 1877-0509 |
DOI: | 10.1016/j.procs.2011.07.111 |
Popis: | Random deployment of wireless sensors in the network environment and the need for determining sensors location has made the localization problem as a critical challenge in wireless sensor networks. One of the efficient approaches to solve this problem is the heuristic algorithm based on simulated annealing. Despite the advantages of such an algorithm, its major weakness is accuracy reduction in low density networks and the increase of the localization processing time associated with the growth of the network density. This paper aims at providing a solution to increase the efficiency of this algorithm. To this end, first we applied Iterative Multilateration method in a base station. With this idea the completely random initial estimation is replaced by an appropriate estimation location of sensor nodes, so while the prevention of localization error propagation in the whole network, the computation is decreased considerably at the beginning of the algorithm. In addition, by changing the probability distribution function P(Δf), the localization error has been reduced even in highly noisy environments. The evaluation results indicate a significant increase in the localization accuracy and speed in all networks especially in high noisy ones. |
Databáze: | OpenAIRE |
Externí odkaz: |