%0 Book Section %1 springerlink:10.1007/978-3-642-04383-3_20 %A Mirebrahim, Hamid %A Dehghan, Mehdi %B Ad-Hoc, Mobile and Wireless Networks %D 2009 %E Ruiz, Pedro %E Garcia-Luna-Aceves, Jose %I Springer Berlin / Heidelberg %K montecarlo wlanpos %P 270-283 %T Monte Carlo Localization of Mobile Sensor Networks Using the Position Information of Neighbor Nodes %U http://dx.doi.org/10.1007/978-3-642-04383-3_20 %V 5793 %X Localization is a fundamental problem in wireless sensor networks. Most existing localization algorithm is designed for static sensor networks. There are a few localization methods for mobile sensor networks. However, Sequential Monte Carlo method (SMC) has been used in localization of mobile sensor networks recently. In this paper, we propose a localization algorithm based on SMC which can improve the location accuracy. A new method is used for sample generation. In that, samples distributes uniformly over the area from which samples are drawn instead of random generation of samples in that area. This can reduces the number of required samples; besides, this new sample generation method enables the algorithm to estimate the maximum location error of each node more accurately. Our algorithm also uses the location estimation of non-anchor neighbor nodes more efficiently than other algorithms. This can improve the localization estimation accuracy highly.

@incollection{springerlink:10.1007/978-3-642-04383-3_20, abstract = {Localization is a fundamental problem in wireless sensor networks. Most existing localization algorithm is designed for static sensor networks. There are a few localization methods for mobile sensor networks. However, Sequential Monte Carlo method (SMC) has been used in localization of mobile sensor networks recently. In this paper, we propose a localization algorithm based on SMC which can improve the location accuracy. A new method is used for sample generation. In that, samples distributes uniformly over the area from which samples are drawn instead of random generation of samples in that area. This can reduces the number of required samples; besides, this new sample generation method enables the algorithm to estimate the maximum location error of each node more accurately. Our algorithm also uses the location estimation of non-anchor neighbor nodes more efficiently than other algorithms. This can improve the localization estimation accuracy highly.}, added-at = {2010-10-13T11:25:02.000+0200}, affiliation = {Amirkabir University of Technology Computer Engineering Department Tehran Iran}, author = {Mirebrahim, Hamid and Dehghan, Mehdi}, biburl = {https://www.bibsonomy.org/bibtex/229bbe3576e1bdd3646890f225f1c5ec8/kw}, booktitle = {Ad-Hoc, Mobile and Wireless Networks}, editor = {Ruiz, Pedro and Garcia-Luna-Aceves, Jose}, interhash = {0ab840afe61dd836a1d28f7b93189154}, intrahash = {29bbe3576e1bdd3646890f225f1c5ec8}, keywords = {montecarlo wlanpos}, note = {10.1007/978-3-642-04383-3_20}, pages = {270-283}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2010-10-13T11:25:02.000+0200}, title = {Monte Carlo Localization of Mobile Sensor Networks Using the Position Information of Neighbor Nodes}, url = {http://dx.doi.org/10.1007/978-3-642-04383-3_20}, volume = 5793, year = 2009 }