Abstract
We present two distributed algorithms for localizing sensor nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kwon, O. H., & Song, H. J. (2006). Counting-based distance estimations and localizations in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3983 LNCS, pp. 306–315). Springer Verlag. https://doi.org/10.1007/11751632_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
