Cart (Loading....) | Create Account
Close category search window

Range-Based Localization in Wireless Networks Using the DBSCAN Clustering Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Almuzaini, K.K. ; Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada ; Gulliver, T.A.

Node localization has many applications in wireless networks. For example, it can be used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and/or AoA to estimate the distance between nodes. Range free algorithms are based on proximity sensing. Range-based algorithms are more accurate but also more computationally complex. However, in applications such as target tracking, localization accuracy is important. In this paper, we propose a new range-based algorithm which is based on decision tree classification and the density based spatial clustering of applications with noise (DB SCAN) algorithm, which are well known in data mining. The Euclidean distance between intersection points is used as a distance metric, and the DBSCAN algorithm is applied to a subset of intersection points based on this metric. Different performance measures are used to compare our localization algorithm with linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS SVD). The proposed algorithm is shown to perform better than the LLS and WLS-SVD algorithms even when the anchor geometric distribution about an unlocalized node is poor.

Published in:

Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd

Date of Conference:

15-18 May 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.