Abstract
Node localization is employed in many wireless networks as it can be used to improve routing and enhance security. In this paper, we propose a new algorithm based on decision tree classification and K-means clustering which are well known techniques in data mining. Several performance measures are used to compare the K-means localization algorithm with those using linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD). It is shown that the proposed algorithm performs better than the LLS and WLS-SVD algorithms even when the geometric anchor distribution about an unlocalized node is poor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
