An efficient algorithm for mobile localization in sensor networks

Authors:
Xin-Min Xu;Yao Chen;Wen-Yao Xu;Fang Gong
Affiliations:
Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027;Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China 310027;Electrical Engineering Department, University of California, Los Angeles, USA 90095;Electrical Engineering Department, University of California, Los Angeles, USA 90095
Venue:
International Journal of Automation and Computing
Year:
2012

Citing 6
Cited 0

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
Habitat monitoring with sensor networks

Communications of the ACM - Wireless sensor networks
Robust distributed network localization with noisy range measurements

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Probabilistic localization for outdoor wireless sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
An as-rigid-as-possible approach to sensor network localization

ACM Transactions on Sensor Networks (TOSN)
Optimizing data collection path in sensor networks with mobile elements

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Node localization is a fundamental problem in wireless sensor network. There are many existing algorithms to estimate the locations of the nodes. However, most of the methods did not consider the presence of obstacles. In practice, obstacles will lead to blockage and reflection of communication signals between sensor nodes. Therefore, the presence of obstacles will greatly affect the localization result. In this paper, we implement an obstacle-handling algorithm based on the localization tool developed by MIT, The experimental result shows that the enhanced algorithm can reduce the average distance error by up to 46%, compared to the original algorithm.