TY - GEN
T1 - Efficient valid scope computation for location-dependent spatial queries in mobile and wireless environments
AU - Lee, Ken C.K.
AU - Lee, Wang Chien
AU - Leong, Hong Va
AU - Unger, Brandon
AU - Zheng, Baihua
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - 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 efficien 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 signifi cantly outperform existing approaches.
AB - 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 efficien 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 signifi cantly outperform existing approaches.
UR - http://www.scopus.com/inward/record.url?scp=70349159972&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349159972&partnerID=8YFLogxK
U2 - 10.1145/1516241.1516264
DO - 10.1145/1516241.1516264
M3 - Conference contribution
AN - SCOPUS:70349159972
SN - 9781605584058
T3 - Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09
SP - 131
EP - 140
BT - Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09
T2 - 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09
Y2 - 15 January 2009 through 16 January 2009
ER -