Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Anchorless localization with local manifold flattening|
|Author:||Popescu, Dan C.|
|Citation:||PIMRC'11: 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications: pp.1284-1288|
|Publisher:||Institute of Electrical and Electronics Engineers|
|Conference Name:||IEEE International Symposium on Personal Indoor and Mobile Radio Communications (22nd : 2011 : Toronto, Canada)|
|School/Discipline:||School of Computer Science|
|Dan C. Popescu, Mark Hedley and Thuraiappah Sathyan|
|Abstract:||We present a new method for anchorless localization of mobile nodes in wireless networks using only measured distances between pairs of nodes. The novelty of the algorithm lies in the method to complete the Euclidean distance matrix by inferring the unknown distances such as to align all nodes on a k-hyperplane, where typically k is 2 or 3. The relative locations of the nodes are then computed using multidimensional scaling. We also present experimental results with data collected using our WASP platform to verify the improvement in localization using our algorithm over previously published techniques.|
|Rights:||© 2011 Crown|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.