Transitive nearest neighbor search in mobile environments

Baihua Zheng, Ken C.K. Lee, Wang Chien Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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) ∈ S × 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 location-based services in both on-demand-based and broadcast-based 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.

Original languageEnglish (US)
Title of host publicationProceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Pages14-21
Number of pages8
DOIs
StatePublished - 2006
EventIEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Taichung, Taiwan, Province of China
Duration: Jun 5 2006Jun 7 2006

Publication series

NameProceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
Volume2006 II

Other

OtherIEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
CountryTaiwan, Province of China
CityTaichung
Period6/5/066/7/06

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Transitive nearest neighbor search in mobile environments'. Together they form a unique fingerprint.

Cite this