On semantic caching and query scheduling for mobile nearest-neighbor search

Baihua Zheng, Wang-chien Lee, Dik Lun Lee

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Location-based services have received increasing attention in recent years. In this paper, we address the performance issues of mobile nearest-neighbor search, in which the mobile user issues a query to retrieve stationary service objects nearest to him/her. An index based on Voronoi Diagram is used in the server to support such a search, while a semantic cache is proposed to enhance the access efficiency of the service. Cache replacement policies tailored for the proposed semantic cache are examined. Moreover, several query scheduling policies are proposed to address the inter-cell roaming issues in multi-cell environments. Simulations are conducted to evaluate the proposed methods. The result shows that the system performance, in terms of cache hit ratio, query response time, cell-cross number and cell-recross number, is improved significantly.

Original languageEnglish (US)
Pages (from-to)653-664
Number of pages12
JournalWireless Networks
Volume10
Issue number6
DOIs
StatePublished - Nov 1 2004

Fingerprint

Semantics
Scheduling
Location based services
Servers
Nearest neighbor search

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Zheng, Baihua ; Lee, Wang-chien ; Lee, Dik Lun. / On semantic caching and query scheduling for mobile nearest-neighbor search. In: Wireless Networks. 2004 ; Vol. 10, No. 6. pp. 653-664.
@article{e4d149a59c8e4be6a70c1ff8310f02b4,
title = "On semantic caching and query scheduling for mobile nearest-neighbor search",
abstract = "Location-based services have received increasing attention in recent years. In this paper, we address the performance issues of mobile nearest-neighbor search, in which the mobile user issues a query to retrieve stationary service objects nearest to him/her. An index based on Voronoi Diagram is used in the server to support such a search, while a semantic cache is proposed to enhance the access efficiency of the service. Cache replacement policies tailored for the proposed semantic cache are examined. Moreover, several query scheduling policies are proposed to address the inter-cell roaming issues in multi-cell environments. Simulations are conducted to evaluate the proposed methods. The result shows that the system performance, in terms of cache hit ratio, query response time, cell-cross number and cell-recross number, is improved significantly.",
author = "Baihua Zheng and Wang-chien Lee and Lee, {Dik Lun}",
year = "2004",
month = "11",
day = "1",
doi = "10.1023/B:WINE.0000044026.38487.b2",
language = "English (US)",
volume = "10",
pages = "653--664",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "6",

}

On semantic caching and query scheduling for mobile nearest-neighbor search. / Zheng, Baihua; Lee, Wang-chien; Lee, Dik Lun.

In: Wireless Networks, Vol. 10, No. 6, 01.11.2004, p. 653-664.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On semantic caching and query scheduling for mobile nearest-neighbor search

AU - Zheng, Baihua

AU - Lee, Wang-chien

AU - Lee, Dik Lun

PY - 2004/11/1

Y1 - 2004/11/1

N2 - Location-based services have received increasing attention in recent years. In this paper, we address the performance issues of mobile nearest-neighbor search, in which the mobile user issues a query to retrieve stationary service objects nearest to him/her. An index based on Voronoi Diagram is used in the server to support such a search, while a semantic cache is proposed to enhance the access efficiency of the service. Cache replacement policies tailored for the proposed semantic cache are examined. Moreover, several query scheduling policies are proposed to address the inter-cell roaming issues in multi-cell environments. Simulations are conducted to evaluate the proposed methods. The result shows that the system performance, in terms of cache hit ratio, query response time, cell-cross number and cell-recross number, is improved significantly.

AB - Location-based services have received increasing attention in recent years. In this paper, we address the performance issues of mobile nearest-neighbor search, in which the mobile user issues a query to retrieve stationary service objects nearest to him/her. An index based on Voronoi Diagram is used in the server to support such a search, while a semantic cache is proposed to enhance the access efficiency of the service. Cache replacement policies tailored for the proposed semantic cache are examined. Moreover, several query scheduling policies are proposed to address the inter-cell roaming issues in multi-cell environments. Simulations are conducted to evaluate the proposed methods. The result shows that the system performance, in terms of cache hit ratio, query response time, cell-cross number and cell-recross number, is improved significantly.

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

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

U2 - 10.1023/B:WINE.0000044026.38487.b2

DO - 10.1023/B:WINE.0000044026.38487.b2

M3 - Article

VL - 10

SP - 653

EP - 664

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 6

ER -