Transitive nearest neighbor search in mobile environments

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

doi:10.1109/SUTC.2006.1636154

Transitive nearest neighbor search in mobile environments

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

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Pages	14-21
Number of pages	8
DOIs	https://doi.org/10.1109/SUTC.2006.1636154
State	Published - 2006
Event	IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Taichung, Taiwan, Province of China Duration: Jun 5 2006 → Jun 7 2006

Publication series

Name	Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
Volume	2006 II

Other

Other	IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing
Country/Territory	Taiwan, Province of China
City	Taichung
Period	6/5/06 → 6/7/06

All Science Journal Classification (ASJC) codes

Engineering(all)

Access to Document

10.1109/SUTC.2006.1636154

Cite this

Zheng, B., Lee, K. C. K., & Lee, W. C. (2006). Transitive nearest neighbor search in mobile environments. In Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006 (pp. 14-21). [1636154] (Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing; Vol. 2006 II). https://doi.org/10.1109/SUTC.2006.1636154

@inproceedings{5bd958297835462a9fe649991a543d4d,

title = "Transitive nearest neighbor search in mobile environments",

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.",

author = "Baihua Zheng and Lee, {Ken C.K.} and Lee, {Wang Chien}",

note = "Copyright: Copyright 2008 Elsevier B.V., All rights reserved.; IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing ; Conference date: 05-06-2006 Through 07-06-2006",

year = "2006",

doi = "10.1109/SUTC.2006.1636154",

language = "English (US)",

isbn = "0769525539",

series = "Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing",

pages = "14--21",

booktitle = "Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006",

}

Zheng, B, Lee, KCK & Lee, WC 2006, Transitive nearest neighbor search in mobile environments. in Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006., 1636154, Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, vol. 2006 II, pp. 14-21, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, Taichung, Taiwan, Province of China, 6/5/06. https://doi.org/10.1109/SUTC.2006.1636154

Transitive nearest neighbor search in mobile environments. / Zheng, Baihua; Lee, Ken C.K.; Lee, Wang Chien.
Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006. 2006. p. 14-21 1636154 (Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing; Vol. 2006 II).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Transitive nearest neighbor search in mobile environments

AU - Zheng, Baihua

AU - Lee, Ken C.K.

AU - Lee, Wang Chien

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33845411204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845411204&partnerID=8YFLogxK

U2 - 10.1109/SUTC.2006.1636154

DO - 10.1109/SUTC.2006.1636154

M3 - Conference contribution

AN - SCOPUS:33845411204

SN - 0769525539

SN - 9780769525532

T3 - Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

SP - 14

EP - 21

BT - Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006

T2 - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

Y2 - 5 June 2006 through 7 June 2006

ER -

Transitive nearest neighbor search in mobile environments

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this