Transitive Nearest Neighbor Search in Mobile Environments
Publication Type
Conference Proceeding Article
Publication Date
6-2007
Abstract
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) E¸ S x R such that the total distance from p to s and then to r, i.e., dis(p, s) + dis(s, r), is minimum. We propose various algorithms for supporting TNN search as a kind of locationbased services in both on-demand-based and broadcastbased mobile environments. In addition, we develop a novel validation algorithm that allows the clients to verify whether their TNN query answers are still valid after they moved to new positions. Finally, we conduct a comprehensive simulation to evaluate performance of the proposed TNN search algorithms.
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Publication
IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06)
First Page
14
Last Page
21
ISBN
9780769525532
Identifier
10.1109/SUTC.2006.138
Publisher
IEEE
Citation
ZHENG, Baihua; LEE, Ken C. K.; and LEE, Wang-Chien.
Transitive Nearest Neighbor Search in Mobile Environments. (2007). IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06). 14-21.
Available at: https://ink.library.smu.edu.sg/sis_research/527
Additional URL
http://dx.doi.org/10.1109/SUTC.2006.138