Proceedings of the 6th International Conference on Information Processing in Sensor Networks - IPSN '07 2007
DOI: 10.1145/1236360.1236399
|View full text |Cite
|
Sign up to set email alerts
|

Wireless localization using self-organizing maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
58
0
1

Year Published

2009
2009
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 55 publications
(59 citation statements)
references
References 34 publications
0
58
0
1
Order By: Relevance
“…The two major methods, multi-dimensional scaling (MDS) based [1][2][3] and neural network based [4,5], achieve the highest localization accuracy and yield coordinates of sensor nodes that preserve the distance matrix between the data points of the input space and the output space (i.e., a 2D plane) as much as possible.…”
Section: Challenges Of Previous Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…The two major methods, multi-dimensional scaling (MDS) based [1][2][3] and neural network based [4,5], achieve the highest localization accuracy and yield coordinates of sensor nodes that preserve the distance matrix between the data points of the input space and the output space (i.e., a 2D plane) as much as possible.…”
Section: Challenges Of Previous Approachesmentioning
confidence: 99%
“…The second method is based on neural networks [4,5], where non-linear mapping techniques and neural network models such as self-organizing map (SOM) are employed for dimension reduction of multidimensional datasets, yielding coordinates of sensor nodes that preserve the distances (also approximated by hop counts) between the data points of the input space and the output space (i.e., a 2D plane) as much as possible.…”
Section: Related Workmentioning
confidence: 99%
“…Giorgetti et al proposed the SOM (self-organizing maps) algorithm [14], which is based on a neural network formalism known as self-organizing map and generates virtual coordinates that describe the relative positions of nodes [10]. The SOM [14] algorithm estimates the distance between every possible pairs of nodes roughly by using the shortest path algorithm and deduces the pairs of nodes distance by utilizing multidimensional scaling method and locates unknown nodes by using the position of anchor nodes.…”
Section: Related Workmentioning
confidence: 99%
“…The SOM [14] algorithm estimates the distance between every possible pairs of nodes roughly by using the shortest path algorithm and deduces the pairs of nodes distance by utilizing multidimensional scaling method and locates unknown nodes by using the position of anchor nodes.…”
Section: Related Workmentioning
confidence: 99%
“…The method presented by Giorgetti et al [19], which we name CSOM, employs the classical SOM [20] to the localization in which the SOM-winner node updates the weights (estimated locations) of its neighbors when they are found out to be outside its radio range. It uses centralized implementation and requires thousands of learning steps.…”
Section: Introductionmentioning
confidence: 99%