Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

1-2009

Abstract

In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client can assert whether the new LDSQs can be answered with the maintained LDSQ result, thus eliminating the LDSQs sent to the server. As such, contention on wireless channel and client energy consumed for data transmission can be considerably reduced. In this paper, we design efficient algorithms to compute the valid scope for common types of LDSQs, including nearest neighbor queries and range queries. Through an extensive set of experiments, our proposed valid scope computation algorithms are shown to significantly outperform existing approaches.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Science and Engineering

Publication

ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, Suwon, Korea, January 15-16

First Page

131

Last Page

140

ISBN

9781605584058

Identifier

10.1145/1516241.1516264

Publisher

ACM

City or Country

New York

Additional URL

https://doi.org/10.1145/1516241.1516264

Download

Share

COinS