Merging Strategy on Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

2

초록

In this paper, we introduce a new map merging method based on least squares method (LSM) in cluster-based multidimensional scaling (MDS) localization systems. Most map merging algorithms used in cluster-based MDS localization systems cannot avoid the accumulation of errors in the map merging process in common. Unfortunately, these errors accumulated in the map merging process lead to a decrease in the performance of position estimation of the whole nodes in a network. Through the proposed merging algorithm based on LSM, the errors accumulated in the map merging process can be avoided. The proposed algorithm can be applied not only to the MDS-based localization system but also to other coordinate-based localization systems. The proposed map merging algorithm shows better performance of position estimation accuracy than the simple merging method used in many cluster-based MDS localization systems in all simulations which are not considering map weight factors. As an example of the highest improvement, a simulation result shows 29% improvement in position estimation accuracy after using each corresponding merging method.

키워드

Cluster-based; global map; least squares method (LSM); localization; map merging; map weight; multidimensional scaling (MDS); procrustes transform
제목
Merging Strategy on Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks
저자
Kang, Insung; Nam, Haewoon
DOI
10.1109/ICTC49870.2020.9289570
발행일
2020-12
유형
Proceedings Paper
저널명
11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020)
권
2020-October
페이지
1132 ~ 1135